| Computational game theory | 2 | 0.40 | 2011 |
| On the Benefits of Keyword Spreading in Sponsored Search Auctions: An Experimental Analysis | 0 | 0.34 | 2010 |
| An optimal multiprocessor combinatorial auction solver | 10 | 0.48 | 2009 |
| The complexity of equilibria: Hardness results for economies via a correspondence with games | 7 | 0.50 | 2008 |
| An experimental analysis of Lemke-Howson algorithm | 7 | 0.55 | 2008 |
| Efficient Computation of Nash Equilibria for Very Sparse Win-Lose Games | 3 | 0.47 | 2006 |
| Efficient computation of nash equilibria for very sparse win-lose bimatrix games | 10 | 0.54 | 2006 |
| Computing equilibrium prices in exchange economies with tax distortions | 1 | 0.36 | 2006 |
| Computing equilibrium prices: does theory meet practice? | 4 | 0.43 | 2005 |
| Market equilibrium for CES exchange economies: existence, multiplicity, and computation | 15 | 0.91 | 2005 |
| An experimental study of different approaches to solve the market equilibrium problem | 7 | 0.60 | 2005 |
| Market equilibrium via the excess demand function | 40 | 1.68 | 2005 |
| On the polynomial time computation of equilibria for certain exchange economies | 34 | 1.99 | 2005 |
| On the computational complexity of Nash equilibria for (0, 1) bimatrix games | 16 | 1.27 | 2005 |
| UbiCrawler: a scalable fully distributed web crawler | 258 | 15.98 | 2004 |
| Spectral Analysis of Symmetric Threshold Functions. | 0 | 0.34 | 2004 |
| Approximation algorithms for a hierarchically structured bin packing problem | 8 | 0.70 | 2004 |
| The computation of market equilibria | 16 | 1.66 | 2004 |
| Computation of the Lovász Theta Function for Circulant Graphs | 0 | 0.34 | 2003 |
| Generating Realistic Data Sets For Combinatorial Auctions | 1 | 0.36 | 2003 |
| Some Remarks On The Shannon Capacity Of Odd Cycles | 4 | 0.53 | 2003 |
| Non-approximability of the Permanent of Structured Matrices over Finite Fields | 2 | 0.43 | 2002 |
| On the hardness of approximating the permanent of structured matrices | 4 | 0.49 | 2002 |
| The Role of Arithmetic in Fast Parallel Matrix Inversion | 2 | 0.37 | 2001 |
| Distributed Algorithm for Certain Assignment Problems | 0 | 0.34 | 2001 |
| Trovatore: Towards a Highly Scalable Distributed Web Crawler | 8 | 1.63 | 2001 |
| A Characterization of Bent Functions in Terms of Strongly Regular Graphs | 12 | 0.92 | 2001 |
| On the Lovász Number of Certain Circulant Graphs | 6 | 0.56 | 2000 |
| Spectral analysis of Boolean functions as a graph eigenvalue problem | 25 | 2.28 | 1999 |
| Checking Properties of Polynomials (Extended Abstract) | 0 | 0.34 | 1997 |
| Some structural properties of low-rank matrices related to computational complexity | 11 | 1.03 | 1997 |
| On the Amount of Randomness Needed in Distributed Computations | 1 | 0.35 | 1997 |
| Broadcast and Associative Operations on Fat-Trees | 2 | 0.38 | 1997 |
| Parallel algorithms for certain matrix computations | 0 | 0.34 | 1997 |
| Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP | 27 | 2.06 | 1996 |
| Symmetry Breaking in Anonymous Networks: Characterizations | 59 | 2.38 | 1996 |
| Strong NP-completeness of a matrix similarity problem | 0 | 0.34 | 1996 |
| Average Circuit Depth and Average Communication Complexity | 2 | 0.52 | 1995 |
| Self-Correcting for Function Fields Transcendental Degree | 0 | 0.34 | 1995 |
| Algebraic techniques in communication complexity | 0 | 0.34 | 1995 |
| Global Strategies for Augmenting the Efficiency of TSP Heuristics | 4 | 0.58 | 1993 |
| Repeated Matrix Squaring for the Parallel Solution of Linear Systems | 4 | 1.31 | 1992 |
| An experimental environment for design and analysis of global routing heuristics | 0 | 0.34 | 1991 |
| Visualizing A Channel Router: An Experimental Study | 0 | 0.34 | 1989 |
| Efficient Reconfiguration of VLSI Arrays | 2 | 0.54 | 1988 |
| VLSI implementation of fast solvers for band linear systems with constant coefficient matrix | 5 | 0.93 | 1985 |
