| Fifty Years of P vs. NP and the Possibility of the Impossible | 0 | 0.34 | 2022 |
| Worlds to Die Harder For Open Oracle Questions for the 21st Century | 0 | 0.34 | 2021 |
| Quantized BvND: A Better Solution for Optical and Hybrid Switching in Data Center Networks | 0 | 0.34 | 2018 |
| 2-Hop Eclipse: A Fast Algorithm For Bandwidth-Efficient Data Center Switching | 0 | 0.34 | 2018 |
| Best First Fit (BFF): An Approach to Partially Reconfigurable Hybrid Circuit and Packet Switching | 0 | 0.34 | 2018 |
| Complexity With Rod | 0 | 0.34 | 2017 |
| Compression Complexity. | 0 | 0.34 | 2017 |
| David Stifler Johnson: A Tribute by Lance Fortnow. | 0 | 0.34 | 2016 |
| Nondeterministic Separations. | 0 | 0.34 | 2015 |
| A Personal View of the P versus NP Problem. | 0 | 0.34 | 2013 |
| Learning Reductions to Sparse Sets. | 0 | 0.34 | 2013 |
| The Enduring Legacy of the Turing Machine | 6 | 0.48 | 2012 |
| Multi-outcome and Multidimensional Market Scoring Rules | 1 | 0.37 | 2012 |
| Low-Depth Witnesses are Easy to Find | 3 | 0.40 | 2012 |
| Infeasibility of instance compression and succinct PCPs for NP | 95 | 3.29 | 2011 |
| Extracting Kolmogorov complexity with applications to dimension zero-one laws | 21 | 1.23 | 2011 |
| Repeated matching pennies with limited randomness | 4 | 0.52 | 2011 |
| Gaming Prediction Markets: Equilibrium Strategies with a Market Maker | 23 | 1.66 | 2010 |
| Ubiquity symposium 'What is computation?': The enduring legacy of the Turing machine | 0 | 0.34 | 2010 |
| Testing Closeness of Discrete Distributions | 61 | 2.22 | 2010 |
| Bounding Rationality by Discounting Time | 4 | 0.46 | 2010 |
| Unconditional Lower Bounds against Advice. | 2 | 0.37 | 2009 |
| The status of the P versus NP problem | 53 | 3.29 | 2009 |
| Program equilibria and discounted computation time | 1 | 0.43 | 2009 |
| A Simple Proof of Toda's Theorem | 3 | 0.38 | 2009 |
| Complexity classes of equivalence problems revisited | 8 | 0.82 | 2009 |
| Worst-Case Running Times for Average-Case Algorithms | 5 | 0.49 | 2009 |
| Sophistication Revisited | 8 | 0.82 | 2009 |
| Betting on permutations | 18 | 1.88 | 2007 |
| Inverting onto functions and polynomial hierarchy | 1 | 0.35 | 2007 |
| A tight lower bound for restricted pir protocols | 10 | 0.65 | 2006 |
| Computational depth: concept and applications | 22 | 1.82 | 2006 |
| The complexity of forecast testing | 5 | 0.87 | 2006 |
| Enumerations of the Kolmogorov Function | 6 | 0.81 | 2006 |
| Fixed-Polynomial Size Circuit Bounds | 4 | 0.40 | 2006 |
| Inverting onto functions might not be hard | 0 | 0.34 | 2006 |
| Computation in a distributed information market | 13 | 3.96 | 2005 |
| Counting complexity | 11 | 0.74 | 2005 |
| Betting Boolean-style: a framework for trading in securities based on logical formulas | 22 | 3.25 | 2005 |
| Hierarchies for semantic classes | 12 | 0.60 | 2005 |
| Time-space lower bounds for satisfiability | 30 | 1.01 | 2005 |
| Prediction and dimension | 10 | 0.57 | 2005 |
| Increasing Kolmogorov Complexity | 6 | 0.50 | 2004 |
| Review of "Theory of semi-feasible algorithms" by Lane Hemaspaandra and Leen Torenvliet. Springer. | 0 | 0.34 | 2004 |
| 04421 Abstracts Collection - Algebraic Methods in Computational Complexity | 0 | 0.34 | 2004 |
| On the Complexity of Succinct Zero-Sum Games | 17 | 1.03 | 2004 |
| Tolerant Versus Intolerant Testing for Boolean Properties | 9 | 0.71 | 2004 |
| Hierarchy Theorems for Probabilistic Polynomial Time | 29 | 1.12 | 2004 |
| Proving SAT does not have Small Circuits with an Application to the Two | 0 | 0.34 | 2003 |
| Are Cook and Karp Ever the Same? | 3 | 0.35 | 2003 |
