Search the dblp DataBase

Publications of Author

1. Constantinos Daskalakis, Alex Fabrikant, Christos H. Papadimitriou
   The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games. [Citation Graph (0, 0)][DBLP]
   ICALP (1), 2006, pp:513-524 [Conf]
   
2. Constantinos Daskalakis, Cameron Hill, Alexander Jaffe, Radu Mihaescu, Elchanan Mossel, Satish Rao
   Maximal Accurate Forests from Distance Matrices. [Citation Graph (0, 0)][DBLP]
   RECOMB, 2006, pp:281-295 [Conf]
   
3. Constantinos Daskalakis, Christos H. Papadimitriou
   Computing pure nash equilibria in graphical games via markov random fields. [Citation Graph (0, 0)][DBLP]
   ACM Conference on Electronic Commerce, 2006, pp:91-99 [Conf]
   
4. Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou
   The complexity of computing a Nash equilibrium. [Citation Graph (0, 0)][DBLP]
   STOC, 2006, pp:71-78 [Conf]
   
5. Constantinos Daskalakis, Elchanan Mossel, Sébastien Roch
   Optimal phylogenetic reconstruction. [Citation Graph (0, 0)][DBLP]
   STOC, 2006, pp:159-168 [Conf]
   
6. Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou
   A Note on Approximate Nash Equilibria. [Citation Graph (0, 0)][DBLP]
   WINE, 2006, pp:297-306 [Conf]
   
7. Constantinos Daskalakis, Aranyak Mehta, Christos H. Papadimitriou
   Progress in approximate nash equilibria. [Citation Graph (0, 0)][DBLP]
   ACM Conference on Electronic Commerce, 2007, pp:355-358 [Conf]
   
8. Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright
   Probabilistic analysis of linear programming decoding. [Citation Graph (0, 0)][DBLP]
   SODA, 2007, pp:385-394 [Conf]
   
9. Christian Borgs, Jennifer T. Chayes, Constantinos Daskalakis, Sébastien Roch
   First to market is not everything: an analysis of preferential attachment with fitness. [Citation Graph (0, 0)][DBLP]
   STOC, 2007, pp:135-144 [Conf]
   
10. Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright
    Probabilistic Analysis of Linear Programming Decoding [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
    
11. Constantinos Daskalakis, Alexandros G. Dimakis, Elchanan Mossel
    Connectivity and Equilibrium in Random Games [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
    
12. Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha Riesenfeld, Elad Verbin
    Sorting and Selection in Posets [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
    
13. Constantinos Daskalakis, Christos H. Papadimitriou
    Computing Equilibria in Anonymous Games [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
    
14. 
    Computing Equilibria in Large Games We Play. [Citation Graph (, )][DBLP]
    
    
15. 
    Computing Equilibria in Anonymous Games. [Citation Graph (, )][DBLP]
    
    
16. 
    Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games. [Citation Graph (, )][DBLP]
    
    
17. 
    On a Network Generalization of the Minmax Theorem. [Citation Graph (, )][DBLP]
    
    
18. 
    Online Bipartite Perfect Matching With Augmentations. [Citation Graph (, )][DBLP]
    
    
19. 
    Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep. [Citation Graph (, )][DBLP]
    
    
20. 
    Alignment-Free Phylogenetic Reconstruction. [Citation Graph (, )][DBLP]
    
    
21. 
    On the complexity of Nash equilibria of action-graph games. [Citation Graph (, )][DBLP]
    
    
22. 
    Sorting and selection in posets. [Citation Graph (, )][DBLP]
    
    
23. 
    How Good is the Chord Algorithm?. [Citation Graph (, )][DBLP]
    
    
24. 
    Message passing algorithms and improved LP decoding. [Citation Graph (, )][DBLP]
    
    
25. 
    On oblivious PTAS's for nash equilibrium. [Citation Graph (, )][DBLP]
    
    
26. 
    A Note on Strictly Competitive Games. [Citation Graph (, )][DBLP]
    
    
27. 
    An Efficient PTAS for Two-Strategy Anonymous Games. [Citation Graph (, )][DBLP]
    
    
28. 
    Global Alignment of Molecular Sequences via Ancestral State Reconstruction. [Citation Graph (, )][DBLP]
    
    
29. 
    The complexity of computing a Nash equilibrium. [Citation Graph (, )][DBLP]
    
    
30. 
    Computing Pure Nash Equilibria via Markov Random Fields [Citation Graph (, )][DBLP]
    
    
31. 
    On the Complexity of Nash Equilibria of Action-Graph Games [Citation Graph (, )][DBLP]
    
    
32. 
    Discretized Multinomial Distributions and Nash Equilibria in Anonymous Games [Citation Graph (, )][DBLP]
    
    
33. 
    An Efficient PTAS for Two-Strategy Anonymous Games [Citation Graph (, )][DBLP]
    
    
34. 
    Global Alignment of Molecular Sequences via Ancestral State Reconstruction [Citation Graph (, )][DBLP]