| Total Functions in the Polynomial Hierarchy. | 0 | 0.34 | 2021 |
| Alpha-Rank: Multi-Agent Evaluation By Evolution | 3 | 0.43 | 2019 |
| Reductions in PPP. | 0 | 0.34 | 2019 |
| Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons. | 0 | 0.34 | 2018 |
| From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory. | 1 | 0.37 | 2018 |
| The EATCS Award 2019 - Call for Nominations. | 0 | 0.34 | 2018 |
| The EATCS Award 2017 - Laudatio for Eva Tardos. | 0 | 0.34 | 2017 |
| TFNP: An Update. | 0 | 0.34 | 2017 |
| Optimizing The Diamond Lane: A More Tractable Carpool Problem And Algorithms | 0 | 0.34 | 2016 |
| Variable Binding through Assemblies in Spiking Neural Networks. | 0 | 0.34 | 2016 |
| Optimal deterministic auctions with correlated priors. | 4 | 0.46 | 2015 |
| Simultaneous bayesian auctions and computational complexity | 19 | 0.84 | 2014 |
| Algorithms, Games, and Evolution (Invited Talk). | 0 | 0.34 | 2014 |
| Unsupervised Learning through Prediction in a Model of Cortex. | 1 | 0.37 | 2014 |
| The Intractability of Dynamic Mechanism Design. | 1 | 0.38 | 2014 |
| Algorithms, Games, And Evolution | 18 | 1.65 | 2014 |
| Learning and verifying quantified boolean queries by example | 24 | 0.91 | 2013 |
| The new faces of combinatorial optimization | 2 | 0.36 | 2012 |
| An Algorithmic View of the Universe | 0 | 0.34 | 2012 |
| Modeling social networks through user background and behavior | 13 | 1.06 | 2011 |
| On optimal single-item auctions | 37 | 2.79 | 2011 |
| Mechanisms for complement-free procurement | 25 | 1.04 | 2011 |
| Games, algorithms, and the Internet | 2 | 0.39 | 2011 |
| A New Look at Selfish Routing | 14 | 0.96 | 2010 |
| On a Network Generalization of the Minmax Theorem | 21 | 1.88 | 2009 |
| The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies | 28 | 2.53 | 2009 |
| Worst-case equilibria | 254 | 11.09 | 2009 |
| Internet and Network Economics, 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings | 62 | 8.74 | 2008 |
| The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond | 45 | 1.79 | 2008 |
| Nash equilibria: where we stand | 0 | 0.34 | 2007 |
| Incentive-compatible interdomain routing with linear utilities | 2 | 0.40 | 2007 |
| Computing Equilibria in Anonymous Games | 61 | 3.49 | 2007 |
| Recognizing Hole-Free 4-Map Graphs in Cubic Time | 15 | 0.66 | 2006 |
| Three-Player Games Are Hard | 77 | 6.19 | 2005 |
| Computing equilibria in multi-player games | 52 | 2.79 | 2005 |
| Approximately Dominating Representatives | 21 | 1.37 | 2005 |
| Games other people play | 0 | 0.34 | 2005 |
| The complexity of pure Nash equilibria | 305 | 16.11 | 2004 |
| Networks and games | 1 | 0.39 | 2004 |
| On a network creation game | 255 | 16.74 | 2003 |
| Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet | 115 | 12.25 | 2002 |
| On the complexity of equilibria | 77 | 12.89 | 2002 |
| Special Issue on PODS 1999 - Guest Editors' Foreword | 0 | 0.34 | 2002 |
| The Joy of Theory | 0 | 0.34 | 2002 |
| On a model of indexability and its bounds for range queries | 29 | 1.02 | 2002 |
| Multiobjective query optimization | 50 | 4.19 | 2001 |
| Algorithmic problems related to the Internet | 0 | 0.34 | 2001 |
| Game Theory and Mathematical Economics: A Theoratical Computer Scientist's Introduction | 11 | 2.91 | 2001 |
| On Approximating a Scheduling Problem | 19 | 0.98 | 2001 |
| On the Floyd–Warshall algorithm for logic programs | 10 | 0.70 | 1999 |
