| Set-Multilinear and Non-commutative Formula Lower Bounds for Iterated Matrix Multiplication | 0 | 0.34 | 2022 |
| On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials | 0 | 0.34 | 2022 |
| A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates | 0 | 0.34 | 2022 |
| Variants of the Determinant Polynomial and the sf VP-Completeness. | 0 | 0.34 | 2021 |
| A Fixed-Depth Size-Hierarchy Theorem For Ac(0)[Circle Plus] Via The Coin Problem | 0 | 0.34 | 2021 |
| Skew circuits of small width. | 0 | 0.34 | 2020 |
| More on $AC^0[oplus]$ and Variants of the Majority Function. | 0 | 0.34 | 2019 |
| A fixed-depth size-hierarchy theorem for AC 0 [⊕] via the coin problem | 0 | 0.34 | 2019 |
| Schur Polynomials do not have small formulas if the Determinant doesn't! | 0 | 0.34 | 2019 |
| More on AC0[oplus] and Variants of the Majority Function. | 0 | 0.34 | 2019 |
| A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas. | 0 | 0.34 | 2018 |
| The Coin Problem in Constant Depth: Sample Complexity and Parity gates. | 1 | 0.35 | 2018 |
| A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits | 0 | 0.34 | 2018 |
| A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates | 0 | 0.34 | 2018 |
| Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes | 0 | 0.34 | 2018 |
| A Unified Method for Placing Problems in Polylogarithmic Depth. | 0 | 0.34 | 2017 |
| Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. | 0 | 0.34 | 2017 |
| Lower Bounds and PIT for Non-Commutative Arithmetic circuits with Restricted Parse Trees. | 0 | 0.34 | 2017 |
| The shifted partial derivative complexity of Elementary Symmetric Polynomials. | 1 | 0.38 | 2017 |
| Space-Efficient Approximations for Subset Sum. | 0 | 0.34 | 2016 |
| Lower bounds for non-commutative skew circuits. | 0 | 0.34 | 2016 |
| An Almost Cubic Lower Bound for ΣΠΣ Circuits Computing a Polynomial in VP. | 0 | 0.34 | 2016 |
| Isolation Lemma for Directed Reachability and NL vs. L. | 0 | 0.34 | 2016 |
| Optimal Embedding of Functions for In-Network Computation: Complexity Analysis and Algorithms | 6 | 0.48 | 2016 |
| Value Automata with Filters | 0 | 0.34 | 2015 |
| Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication | 16 | 0.64 | 2015 |
| On the Maximum Rate of Networked Computation in a Capacitated Network | 1 | 0.36 | 2015 |
| An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas | 21 | 0.75 | 2014 |
| Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas | 9 | 0.54 | 2014 |
| Efficient Embedding of Functions in Weighted Communication Networks. | 1 | 0.35 | 2014 |
| Information friction limits on computation | 1 | 0.37 | 2014 |
| DLOGTIME Proof Systems. | 0 | 0.34 | 2013 |
| Lower bounds for depth 4 formulas computing iterated matrix multiplication | 4 | 0.41 | 2013 |
| Small Depth Proof Systems. | 0 | 0.34 | 2013 |
| Counting Paths in VPA Is Complete for #NC 1 | 1 | 0.37 | 2012 |
| In-Network Estimation of Frequency Moments | 0 | 0.34 | 2012 |
| The Complexity of Unary Subset Sum. | 0 | 0.34 | 2012 |
| Streaming algorithms for recognizing nearly well-parenthesized expressions | 4 | 0.38 | 2011 |
| Streaming algorithms for language recognition problems | 2 | 0.42 | 2011 |
| Arithmetizing Classes Around NC\textsf{NC}1 and L\textsf{L} | 0 | 0.34 | 2010 |
| Streaming Algorithms for Some Problems in Log-Space | 4 | 0.41 | 2010 |
| Counting Paths in VPA Is Complete for #NC1 | 1 | 0.37 | 2010 |
| Longest paths in planar DAGs in unambiguous logspace | 6 | 0.53 | 2009 |
| Upper Bounds for Monotone Planar Circuit Value and Variants | 13 | 0.58 | 2009 |
| Planar Graph Isomorphism is in Log-space. | 0 | 0.34 | 2009 |
| Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata | 1 | 0.38 | 2009 |
| A Log-space Algorithm for Canonization of Planar Graphs | 3 | 0.43 | 2008 |
| 3-connected Planar Graph Isomorphism is in Log-space | 2 | 0.40 | 2008 |
| On the complexity of membership and counting in height-deterministic pushdown automata | 6 | 0.48 | 2008 |
| Planarity, Determinants, Permanents, and (Unique) Matchings | 8 | 0.53 | 2007 |
