| Adding Dual Variables to Algebraic Reasoning for Gate-Level Multiplier Verification | 0 | 0.34 | 2022 |
| On the Bias of Reed-Muller Codes over Odd Prime Fields. | 0 | 0.34 | 2020 |
| Edge Estimation with Independent Set Oracles | 1 | 0.35 | 2020 |
| Verifying Properties of Bit-vector Multiplication Using Cutting Planes Reasoning | 0 | 0.34 | 2020 |
| Technical perspective: Two for the price of one | 0 | 0.34 | 2020 |
| Smoothing Structured Decomposable Circuits. | 0 | 0.34 | 2019 |
| Edge Estimation with Independent Set Oracles. | 2 | 0.41 | 2018 |
| Time-Space Tradeoffs for Learning Finite Functions from Random Evaluations, with Applications to Polynomials. | 0 | 0.34 | 2018 |
| Stabbing Planes. | 0 | 0.34 | 2017 |
| Time-Space Tradeoffs for Learning from Small Test Spaces: Learning Low Degree Polynomial Functions. | 2 | 0.42 | 2017 |
| Toward Verifying Nonlinear Integer Arithmetic | 1 | 0.36 | 2017 |
| Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube. | 0 | 0.34 | 2017 |
| Exact Model Counting of Query Expressions: Limitations of Propositional Methods. | 4 | 0.39 | 2017 |
| Worst-Case Optimal Algorithms for Parallel Query Processing. | 14 | 0.59 | 2016 |
| Communication Cost in Parallel Query Processing. | 2 | 0.36 | 2016 |
| Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds for Superlinear Space. | 1 | 0.37 | 2016 |
| Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method | 2 | 0.40 | 2016 |
| Symmetry in Probabilistic Databases. | 0 | 0.34 | 2015 |
| Finding the Median (Obliviously) with Bounded Space | 1 | 0.35 | 2015 |
| New Limits for Knowledge Compilation and Applications to Exact Model Counting | 5 | 0.45 | 2015 |
| Skew in parallel query processing | 42 | 1.20 | 2014 |
| Symmetric Weighted First-Order Model Counting. | 8 | 0.49 | 2014 |
| Counting of Query Expressions: Limitations of Propositional Methods. | 3 | 0.47 | 2014 |
| Model Counting of Query Expressions: Limitations of Propositional Methods. | 3 | 0.38 | 2013 |
| Lower Bounds for Exact Model Counting and Applications in Probabilistic Databases. | 9 | 0.75 | 2013 |
| Element Distinctness, Frequency Moments, and Sliding Windows | 8 | 0.49 | 2013 |
| The Value of Multiple Read/Write Streams for Approximating Frequency Moments | 11 | 0.91 | 2012 |
| Multiparty Communication Complexity and Threshold Circuit Size of sfAC0. | 0 | 0.34 | 2012 |
| Approximating AC^0 by Small Height Decision Trees and a Deterministic Algorithm for #AC^0SAT | 2 | 0.37 | 2012 |
| Sliding Windows with Limited Storage | 0 | 0.34 | 2012 |
| Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space | 20 | 0.67 | 2011 |
| Making Branching Programs Oblivious Requires Superlogarithmic Overhead | 3 | 0.42 | 2011 |
| Separating Deterministic from Randomized Multiparty Communication Complexity | 2 | 0.36 | 2010 |
| Making RAMs Oblivious Requires Superlogarithmic Overhead | 5 | 1.05 | 2010 |
| The quantum query complexity of AC0 | 3 | 0.39 | 2010 |
| Special Issue "Conference on Computational Complexity 2008" Guest Editors' Foreword | 0 | 0.34 | 2009 |
| Hardness amplification in proof complexity | 13 | 0.51 | 2009 |
| On the Value of Multiple Read/Write Streams for Approximating Frequency Moments | 13 | 0.77 | 2008 |
| Multiparty Communication Complexity and Threshold Circuit Size of AC^0 | 9 | 0.44 | 2008 |
| Multiparty Communication Complexity of AC^0 | 6 | 0.49 | 2008 |
| Lower Bounds for Lov[a-acute]sz--Schrijver Systems and Beyond Follow from Multiparty Communication Complexity | 7 | 0.47 | 2007 |
| The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs | 11 | 0.51 | 2007 |
| Separating deterministic from nondeterministic nof multiparty communication complexity | 4 | 0.56 | 2007 |
| A dynamic approach to MPE and weighted MAX-SAT | 3 | 0.54 | 2007 |
| Lower bounds for randomized read/write stream algorithms | 21 | 0.81 | 2007 |
| A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness | 20 | 1.03 | 2006 |
| Formula Caching in DPLL | 5 | 0.42 | 2006 |
| Heuristics for fast exact model counting | 44 | 1.88 | 2005 |
| Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity | 27 | 0.84 | 2005 |
| A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness | 10 | 0.61 | 2005 |
