| Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth. | 0 | 0.34 | 2018 |
| On the Fine-grained Complexity of One-Dimensional Dynamic Programming. | 5 | 0.43 | 2017 |
| Nondeterministic Extensions Of The Strong Exponential Time Hypothesis And Consequences For Non-Reducibility | 14 | 0.61 | 2016 |
| Subquadratic Algorithms for Succinct Stable Matching | 6 | 0.43 | 2015 |
| 0-1 Integer Linear Programming with a Linear Number of Constraints. | 13 | 0.76 | 2014 |
| Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331). | 0 | 0.34 | 2013 |
| Finding Heavy Hitters from Lossy or Noisy Data. | 4 | 0.53 | 2013 |
| Jealousy Graphs: Structure and Complexity of Decentralized Stable Matching. | 0 | 0.34 | 2013 |
| Exact Complexity and Satisfiability - (Invited Talk). | 0 | 0.34 | 2013 |
| On The Exact Complexity Of Evaluating Quantified K-Cnf | 1 | 0.34 | 2013 |
| A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits | 18 | 0.84 | 2013 |
| Experimental study of the impact of historical information in human coordination | 0 | 0.34 | 2012 |
| Common knowledge and state-dependent equilibria | 0 | 0.34 | 2012 |
| On Problems as Hard as CNF-SAT | 29 | 1.00 | 2012 |
| Does more connectivity help groups to solve social problems | 4 | 0.49 | 2011 |
| A satisfiability algorithm for AC0 | 8 | 0.50 | 2011 |
| On the complexity of circuit satisfiability | 9 | 0.57 | 2010 |
| Uniquely satisfiable k-SAT instances with almost minimal occurrences of each variable | 0 | 0.34 | 2010 |
| Exact algorithms and complexity | 0 | 0.34 | 2010 |
| Low memory distributed protocols for 2-coloring | 0 | 0.34 | 2010 |
| 10441 Abstracts Collection - Exact Complexity of NP-hard Problems. | 0 | 0.34 | 2010 |
| k-SAT Is No Harder Than Decision-Unique-k-SAT | 3 | 0.40 | 2009 |
| The Complexity of Satisfiability of Small Depth Circuits | 48 | 1.54 | 2009 |
| Xl: an efficient network routing algorithm | 17 | 1.12 | 2008 |
| A Duality between Clause Width and Clause Density for SAT | 55 | 1.94 | 2006 |
| On the difficulty of scalably detecting network attacks | 16 | 1.35 | 2004 |
| Circuit lower bounds and linear codes | 5 | 0.42 | 2004 |
| The complexity of unique k-SAT: an isolation lemma for k-CNFs | 28 | 1.39 | 2003 |
| On the complexity of K-SAT | 281 | 7.99 | 2001 |
| Exponential lower bounds for depth three boolean circuits | 8 | 0.68 | 2000 |
| Complexity of k-SAT | 28 | 1.62 | 1999 |
| Which problems have strongly exponential complexity? | 304 | 10.75 | 1998 |
| Dimension of Projections in Boolean Functions | 1 | 0.42 | 1998 |
| Satisfiability Coding Lemma | 87 | 8.49 | 1997 |
| Exponential lower bounds for depth 3 Boolean circuits | 8 | 2.40 | 1997 |
| Size--Depth Tradeoffs for Threshold Circuits | 32 | 1.89 | 1997 |
| Approximating threshold circuits by rational functions | 21 | 1.38 | 1994 |
| Program speedup in a heterogeneous computing network | 31 | 4.15 | 1994 |
| Effect of connectivity in an associative memory model | 8 | 0.80 | 1993 |
| Size-depth trade-offs for threshold circuits | 12 | 1.01 | 1993 |
| On the degree of polynomials that approximate symmetric Boolean functions (preliminary version) | 47 | 3.04 | 1992 |
| Milking the Aanderaa argument | 3 | 0.39 | 1990 |
| On threshold circuits for parity (abstract) | 3 | 0.74 | 1990 |
| There are no p-complete families of symmetric Boolean functions | 0 | 0.34 | 1989 |
| Universal traversal sequences of length nO(log n) for cliques | 17 | 2.79 | 1988 |
| Convergence results in an associative memory model | 39 | 10.37 | 1988 |
| Effect of Connectivity in Associative Memory Models (Preliminary Version) | 0 | 0.34 | 1988 |
| Probabilistic communication complexity | 46 | 13.83 | 1986 |
| Probabilistic Communication Complexity (Preliminary Version) | 0 | 0.34 | 1984 |
| Lower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary Version) | 1 | 0.38 | 1983 |
