Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Panagiotou, Konstantinos"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Multi-target ray searching problems
Spyros Angelopoulos
,
Alejandro López-Ortiz
,
Konstantinos Panagiotou
Theoretical Computer Science
540-541
, 2014, pp. 2-12
Internal DLA: Efficient simulation of a physical growth model
Karl Bringmann
,
Fabian Kuhn
,
Konstantinos Panagiotou
,
Ueli Peter
,
Henning Thomas
Lecture Notes in Computer Science
8572
, 2014, pp. 247-258
Going after the
k
-SAT threshold
Amin Coja-Oghlan
,
Konstantinos Panagiotou
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 705-714
A central limit theorem for the number of degree-
k
vertices in random maps
Michael Drmota
,
Konstantinos Panagiotou
Algorithmica
66
(4), 2013, pp. 741-761
On the insertion time of cuckoo hashing
Nikolaos Fountoulakis
,
Konstantinos Panagiotou
,
Angelika Steger
SIAM Journal on Computing
42
(6), 2013, pp. 2156-2181
On the connectivity of random graphs from addable classes
Mihyun Kang
,
Konstantinos Panagiotou
Journal of Combinatorial Theory Series B
103
(2), 2013, pp. 306-312
Faster rumor spreading with multiple calls
Konstantinos Panagiotou
,
Ali Pourmiri
,
Thomas Sauerwald
Lecture Notes in Computer Science
8283
, 2013, pp. 446-456
Asynchronous rumor spreading on random graphs
Konstantinos Panagiotou
,
Leo Speidel
Lecture Notes in Computer Science
8283
, 2013, pp. 424-434
Efficient sampling methods for discrete distributions
Karl Bringmann
,
Konstantinos Panagiotou
Lecture Notes in Computer Science
7391
, 2012, pp. 133-144
Catching the
k
-NAESAT threshold
Amin Coja-Oglan
,
Konstantinos Panagiotou
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 899-908
Random hyperbolic graphs: Degree sequence and clustering
Luca Gugelmann
,
Konstantinos Panagiotou
,
Ueli Peter
Lecture Notes in Computer Science
7392
, 2012, pp. 573-585
Vertices of degree
k
in random unlabeled trees
Konstantinos Panagiotou
,
Makrand Sinha
Journal of Graph Theory
69
(2), 2012, pp. 114-130
Multi-target ray searching problems
Spyros Angelopoulos
,
Alejandro López-Ortiz
,
Konstantinos Panagiotou
Lecture Notes in Computer Science
6844
, 2011, pp. 37-48
Approximate counting of cycles in streams
Madhusudan Manjunath
,
Kurt Mehlhorn
,
Konstantinos Panagiotou
,
He Sun
Lecture Notes in Computer Science
6942
, 2011, pp. 677-688
On properties of random dissections and triangulations
Nicla Bernasconi
,
Konstantinos Panagiotou
,
Angelika Steger
Combinatorica
30
(6), 2010, pp. 627-654
Orientability of random hypergraphs and the power of multiple choices
Nikolaos Fountoulakis
,
Konstantinos Panagiotou
Lecture Notes in Computer Science
6198
, 2010, pp. 348-359
Optimal algorithms for
k
-search with application in option pricing
Julian Lorenz
,
Konstantinos Panagiotou
,
Angelika Steger
Algorithmica
55
(2), 2009, pp. 311-328
On the chromatic number of random graphs
Amin Coja-Oghlan
,
Konstantinos Panagiotou
,
Angelika Steger
Journal of Combinatorial Theory Series B
98
(5), 2008, pp. 980-993
On the chromatic number of random graphs
Amin Coja-Oghlan
,
Konstantinos Panagiotou
,
Angelika Steger
Lecture Notes in Computer Science
4596
, 2007, pp. 777-788
Optimal algorithms for
k
-search with application in option pricing
Julian Lorenz
,
Konstantinos Panagiotou
,
Angelika Steger
Lecture Notes in Computer Science
4698
, 2007, pp. 275-286
On adequate performance measures for paging
Konstantinos Panagiotou
,
Alexander Souza
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 487-496