| 2011 |
|---|
| 34 | On Oblivious PTAS's for Nash Equilibrium. Constantinos Daskalakis, Christos H. Papadimitriou. CoRR (abs/1102.2280) (2011). Web SearchBibTeXDownload |
| 33 | Testing $k$-Modal Distributions: Optimal Algorithms via Reductions. Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio, Gregory Valiant, Paul Valiant. CoRR (abs/1112.5659) (2011). Web SearchBibTeXDownload |
| 32 | Sorting and Selection in Posets. Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin. SIAM J. Comput. (40): 597-622 (2011). Web SearchBibTeXDownload |
| 31 | Continuous Local Search. Constantinos Daskalakis, Christos H. Papadimitriou. SODA 2011, 790-804. Web SearchBibTeXDownload |
| 2010 |
|---|
| 30 | Global Alignment of Molecular Sequences via Ancestral State Reconstruction. Alexandr Andoni, Constantinos Daskalakis, Avinatan Hassidim, Sébastien Roch. ICS 2010, 358-369. Web SearchBibTeXDownload |
| 29 | On Learning Algorithms for Nash Equilibria. Constantinos Daskalakis, Rafael Frongillo, Christos H. Papadimitriou, George Pierrakos, Gregory Valiant. SAGT 2010, 114-125. Web SearchBibTeXDownload |
| 28 | How Good is the Chord Algorithm?. Constantinos Daskalakis, Ilias Diakonikolas, Mihalis Yannakakis. SODA 2010, 978-991. Web SearchBibTeXDownload |
| 2009 |
|---|
| 27 | The complexity of computing a Nash equilibrium. Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou. Commun. ACM (52): 89-97 (2009). Web SearchBibTeXDownload |
| 26 | Global Alignment of Molecular Sequences via Ancestral State Reconstruction. Alexandr Andoni, Constantinos Daskalakis, Avinatan Hassidim, Sébastien Roch. CoRR (abs/0912.2577) (2009). Web SearchBibTeXDownload |
| 25 | On a Network Generalization of the Minmax Theorem. Constantinos Daskalakis, Christos H. Papadimitriou. ICALP (2) 2009, 423-434. Web SearchBibTeXDownload |
| 24 | Online Bipartite Perfect Matching With Augmentations. Kamalika Chaudhuri, Constantinos Daskalakis, Robert D. Kleinberg, Henry Lin. INFOCOM 2009, 1044-1052. Web SearchBibTeXDownload |
| 23 | The Complexity of Computing a Nash Equilibrium. Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou. SIAM J. Comput. (39): 195-259 (2009). Web SearchBibTeXDownload |
| 22 | On the complexity of Nash equilibria of action-graph games. Constantinos Daskalakis, Grant Schoenebeck, Gregory Valiant, Paul Valiant. SODA 2009, 710-719. Web SearchBibTeXDownload |
| 21 | Sorting and selection in posets. Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin. SODA 2009, 392-401. Web SearchBibTeXDownload |
| 20 | On oblivious PTAS's for nash equilibrium. Constantinos Daskalakis, Christos H. Papadimitriou. STOC 2009, 75-84. Web SearchBibTeXDownload |
| 19 | A note on approximate Nash equilibria. Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou. Theor. Comput. Sci. (410): 1581-1588 (2009). Web SearchBibTeXDownload |
| 18 | A Note on Strictly Competitive Games. Ilan Adler, Constantinos Daskalakis, Christos H. Papadimitriou. WINE 2009, 471-474. Web SearchBibTeXDownload |
| 2008 |
|---|
| 17 | On the Complexity of Nash Equilibria of Action-Graph Games. Constantinos Daskalakis, Grant Schoenebeck, Gregory Valiant, Paul Valiant. CoRR (abs/0802.1604) (2008). Web SearchBibTeXDownload |
| 16 | Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games. Constantinos Daskalakis, Christos H. Papadimitriou. FOCS (abs/0808.2801): 25-34 (2008). Web SearchBibTeXDownload |
| 15 | Probabilistic Analysis of Linear Programming Decoding. Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright. IEEE Transactions on Information Theory (54): 3565-3578 (2008). Web SearchBibTeXDownload |
| 2007 |
|---|
| 14 | Progress in approximate nash equilibria. Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou. ACM Conference on Electronic Commerce 2007, 355-358. Web SearchBibTeXDownload |
| 13 | Sorting and Selection in Posets. Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin. CoRR (abs/0707.1532) (2007). Web SearchBibTeXDownload |
| 12 | Probabilistic Analysis of Linear Programming Decoding. Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright. CoRR (abs/cs/0702014) (2007). Web SearchBibTeXDownload |
| 11 | Computing Equilibria in Anonymous Games. Constantinos Daskalakis, Christos H. Papadimitriou. FOCS 2007, 83-93. Web SearchBibTeXDownload |
| 10 | Probabilistic analysis of linear programming decoding. Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright. SODA 2007, 385-394. Web SearchBibTeXDownload |
| 9 | First to market is not everything: an analysis of preferential attachment with fitness. Christian Borgs, Jennifer T. Chayes, Constantinos Daskalakis, Sébastien Roch. STOC 2007, 135-144. Web SearchBibTeXDownload |
| 2006 |
|---|
| 8 | Computing pure nash equilibria in graphical games via markov random fields. Constantinos Daskalakis, Christos H. Papadimitriou. ACM Conference on Electronic Commerce 2006, 91-99. Web SearchBibTeXDownload |
| 7 | The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games. Constantinos Daskalakis, Alex Fabrikant, Christos H. Papadimitriou. ICALP (1) 2006, 513-524. Web SearchBibTeXDownload |
| 6 | The complexity of computing a Nash equilibrium. Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou. STOC 2006, 71-78. Web SearchBibTeXDownload |
| 5 | A Note on Approximate Nash Equilibria. Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou. WINE 2006, 297-306. Web SearchBibTeXDownload |
| 2005 |
|---|
| 4 | The complexity of computing a Nash equilibrium. Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou. Electronic Colloquium on Computational Complexity (ECCC) 2005. Web SearchBibTeXDownload |
| 3 | Three-Player Games Are Hard. Konstantinos Daskalakis, Christos H. Papadimitriou. Electronic Colloquium on Computational Complexity (ECCC) 2005. Web SearchBibTeXDownload |
| 2 | The Complexity of Games on Highly Regular Graphs. Konstantinos Daskalakis, Christos H. Papadimitriou. ESA 2005, 71-82. Web SearchBibTeXDownload |
| 2004 |
|---|
| 1 | A fast and efficient heuristic ESOP minimization algorithm. Stergios Stergiou, Konstantinos Daskalakis, George K. Papakonstantinou. ACM Great Lakes Symposium on VLSI 2004, 78-81. Web SearchBibTeXDownload |
