Seguir
Konstantinos Panagiotou
Título
Citado por
Citado por
Ano
Random hyperbolic graphs: degree sequence and clustering
L Gugelmann, K Panagiotou, U Peter
International Colloquium on Automata, Languages, and Programming, 573-585, 2012
1252012
The asymptotic k-SAT threshold
A Coja-Oghlan
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
1172014
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
952012
Rumor spreading on random regular graphs and expanders
N Fountoulakis, K Panagiotou
Random Structures & Algorithms 43 (2), 201-220, 2013
872013
Reliable broadcasting in random networks and the effect of density
N Fountoulakis, A Huber, K Panagiotou
INFOCOM, 2010 Proceedings IEEE, 1-9, 2010
812010
Optimal algorithms for k-search with application in option pricing
J Lorenz, K Panagiotou, A Steger
Algorithmica 55 (2), 311-328, 2009
672009
Catching the k-NAESAT threshold
A Coja-Oglan, K Panagiotou
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
642012
Scaling limits of random graphs from subcritical classes
K Panagiotou, B Stufler, K Weller
The Annals of Probability 44 (5), 3291-3334, 2016
612016
Efficient sampling methods for discrete distributions
K Bringmann, K Panagiotou
International colloquium on automata, languages, and programming, 133-144, 2012
58*2012
Approximate counting of cycles in streams
M Manjunath, K Mehlhorn, K Panagiotou, H Sun
European Symposium on Algorithms, 677-688, 2011
582011
Going after the k-SAT threshold
A Coja-Oghlan, K Panagiotou
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
532013
On adequate performance measures for paging
K Panagiotou, A Souza
Proceedings of the thirty-eighth Annual ACM Symposium on Theory of computing …, 2006
522006
Explosive Percolation in Erdos-Rényi-Like Random Graph Processes
K Panagiotou, R Spöhel, A Steger, H Thomas
48*
The multiple-orientability thresholds for random hypergraphs
N Fountoulakis, M Khosla, K Panagiotou
Combinatorics, Probability and Computing 25 (6), 870-908, 2016
462016
On properties of random dissections and triangulations
N Bernasconi, K Panagiotou, A Steger
Combinatorica 30 (6), 627-654, 2010
432010
Sharp load thresholds for cuckoo hashing
N Fountoulakis, K Panagiotou
Random Structures & Algorithms 41 (3), 306-333, 2012
422012
Maximal biconnected subgraphs of random planar graphs
K Panagiotou, A Steger
ACM Transactions on Algorithms (TALG) 6 (2), 1-21, 2010
422010
On the chromatic number of random graphs
A Coja-Oghlan, K Panagiotou, A Steger
Journal of Combinatorial Theory, Series B 98 (5), 980-993, 2008
422008
Managing default contagion in inhomogeneous financial networks
N Detering, T Meyer-Brandis, K Panagiotou, D Ritter
SIAM Journal on Financial Mathematics 10 (2), 578-614, 2019
38*2019
The degree sequence of random graphs from subcritical classes
N Bernasconi, K Panagiotou, A Steger
Combinatorics, Probability & Computing 18 (5), 647-681, 2009
342009
O sistema não pode efectuar a operação agora. Tente novamente mais tarde.
Artigos 1–20