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="Daskalakis, Constantinos"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An algorithmic characterization of multi-dimensional mechanisms
Yang Cai
,
Constantinos Daskalakis
,
S. Matthew Weinberg
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 459-478
Learning poisson binomial distributions
Constantinos Daskalakis
,
Ilias Diakonikolas
,
Rocco A. Servedio
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 709-728
Sorting and selection in posets
Constantinos Daskalakis
,
Richard M. Karp
,
Elchanan Mossel
,
Samantha J. Riesenfeld
,
Elad Verbin
SIAM Journal on Computing
40
(3), 2011, pp. 597-622
Phylogenies without branch bounds: Contracting the short, pruning the deep
Constantinos Daskalakis
,
Elchanan Mossel
,
Sebastien Roch
SIAM Journal on Discrete Mathematics
25
(2), 2011, pp. 872-893
Alignment-free phylogenetic reconstruction
Constantinos Daskalakis
,
Sebastien Roch
LNCS/LNBI
6044
, 2010, pp. 123-137
Message-passing algorithms and improved LP decoding
Sanjeev Arora
,
Constantinos Daskalakis
,
David Steurer
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 3-12
The complexity of computing a Nash equilibrium
Constantinos Daskalakis
,
Paul W. Goldberg
,
Christos H. Papadimitriou
SIAM Journal on Computing
39
(1), 2009, pp. 195-259
A note on approximate Nash equilibria
Constantinos Daskalakis
,
Aranyak Mehta
,
Christos Papadimitriou
Theoretical Computer Science
410
(17), 2009, pp. 1581-1588
Phylogenies without branch bounds: Contracting the short, pruning the deep
Constantinos Daskalakis
,
Elchanan Mossel
,
Sebastien Roch
LNCS/LNBI
5541
, 2009, pp. 451-465
On a network generalization of the minmax theorem
Constantinos Daskalakis
,
Christos H. Papadimitriou
Lecture Notes in Computer Science
5556
, 2009, pp. 423-434
On oblivious PTAS's for Nash equilibrium
Constantinos Daskalakis
,
Christos H. Papadimitriou
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 75-84
First to market is not everything: An analysis of preferential attachment with fitness
Christian Borgs
,
Jennifer Chayes
,
Constantinos Daskalakis
,
Sebastien Roch
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 135-144
The game world is flat: The complexity of Nash equilibria in succinct games
Constantinos Daskalakis
,
Alex Fabrikant
,
Christos H. Papadimitriou
Lecture Notes in Computer Science
4051
, 2006, pp. 513-524
The complexity of computing a Nash equilibrium
Constantinos Daskalakis
,
Paul W. Goldberg
,
Christos H. Papadimitriou
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 71-78
Maximal accurate forests from distance matrices
Constantinos Daskalakis
,
Cameron Hill
,
Alexandar Jaffe
,
Radu Mihaescu
,
Elehanan Mossel
,
Satish Rao
LNCS/LNBI
3909
, 2006, pp. 281-295
Optimal phylogenetic reconstruction
Constantinos Daskalakis
,
Elchanan Mossel
,
Sébastien Roch
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 159-168