Konstantinos Panagiotou
Titel
Citeret af
Citeret af
År
The asymptotic k-SAT threshold
A Coja-Oghlan, K Panagiotou
Advances in Mathematics 288, 985-1068, 2016
892016
Random hyperbolic graphs: degree sequence and clustering
L Gugelmann, K Panagiotou, U Peter
International Colloquium on Automata, Languages, and Programming, 573-585, 2012
882012
Ultra-fast rumor spreading in social networks
N Fountoulakis, K Panagiotou, T Sauerwald
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
872012
Rumor spreading on random regular graphs and expanders
N Fountoulakis, K Panagiotou
Random Structures & Algorithms 43 (2), 201-220, 2013
742013
Reliable broadcasting in random networks and the effect of density
N Fountoulakis, A Huber, K Panagiotou
INFOCOM, 2010 Proceedings IEEE, 1-9, 2010
722010
Primal dual gives almost optimal energy-efficient online algorithms
NR Devanur, Z Huang
ACM Transactions on Algorithms (TALG) 14 (1), 1-30, 2017
572017
Optimal algorithms for k-search with application in option pricing
J Lorenz, K Panagiotou, A Steger
Algorithmica 55 (2), 311-328, 2009
542009
Bootstrap percolation in power-law random graphs
H Amini, N Fountoulakis
Journal of Statistical Physics 155 (1), 72-92, 2014
522014
On adequate performance measures for paging
K Panagiotou, A Souza
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
502006
Going after the k-SAT threshold
A Coja-Oghlan, K Panagiotou
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
472013
Catching the k-NAESAT threshold
A Coja-Oglan, K Panagiotou
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
472012
Scaling limits of random graphs from subcritical classes
K Panagiotou, B Stufler, K Weller
The Annals of Probability 44 (5), 3291-3334, 2016
442016
Approximate counting of cycles in streams
M Manjunath, K Mehlhorn, K Panagiotou, H Sun
European Symposium on Algorithms, 677-688, 2011
442011
Explosive Percolation in Erdos-Rényi-Like Random Graph Processes
K Panagiotou, R Spöhel, A Steger, H Thomas
43*
Efficient sampling methods for discrete distributions
K Bringmann, K Panagiotou
International Colloquium on Automata, Languages, and Programming, 133-144, 2012
42*2012
On properties of random dissections and triangulations
N Bernasconi, K Panagiotou, A Steger
Combinatorica 30 (6), 627-654, 2010
412010
The Multiple-Orientability Thresholds for Random Hypergraphs
N Fountoulakis, M Khosla, K Panagiotou
Combinatorics, Probability and Computing 25 (6), 870-908, 2016
372016
Maximal biconnected subgraphs of random planar graphs
K Panagiotou, A Steger
ACM Transactions on Algorithms (TALG) 6 (2), 1-21, 2010
372010
Sharp load thresholds for cuckoo hashing
N Fountoulakis, K Panagiotou
Random Structures & Algorithms 41 (3), 306-333, 2012
362012
The degree sequence of random graphs from subcritical classes
N Bernasconi, K Panagiotou, A Steger
Combinatorics, Probability & Computing 18 (5), 647-681, 2009
322009
Systemet kan ikke foretage handlingen nu. Prøv igen senere.
Artikler 1–20