| Efficient Compression Algorithm for Multimedia Data | 0 | 0.34 | 2020 |
| Randomness Efficient Feature Hashing for Sparse Binary Data. | 0 | 0.34 | 2020 |
| \mathsf CrystalBall - Gazing in the Black Box of SAT Solving. | 1 | 0.36 | 2019 |
| Shortest k-Disjoint Paths via Determinants. | 1 | 0.36 | 2018 |
| Planar Maximum Matching - Towards a Parallel Algorithm. | 0 | 0.34 | 2018 |
| Efficient Compression Technique for Sparse Sets. | 2 | 0.38 | 2018 |
| Efficient Dimensionality Reduction for Sparse Binary Data | 2 | 0.38 | 2018 |
| On the Spectral Properties of Symmetric Functions. | 0 | 0.34 | 2017 |
| On Fractional Block Sensitivity. | 1 | 0.37 | 2016 |
| Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs. | 3 | 0.39 | 2016 |
| Quantum Query Complexity of Subgraph Isomorphism and Homomorphism. | 0 | 0.34 | 2016 |
| Reachability is in DynFO. | 8 | 0.52 | 2015 |
| On the Power of Parity Queries in Boolean Decision Trees. | 0 | 0.34 | 2015 |
| Upper Bounds on Fourier Entropy. | 0 | 0.34 | 2015 |
| Graph properties in node-query setting: effect of breaking symmetry | 0 | 0.34 | 2015 |
| Demystifying incentives in the consensus computer. | 36 | 2.75 | 2015 |
| An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group. | 0 | 0.34 | 2014 |
| Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive. | 1 | 0.37 | 2014 |
| Space Complexity of Optimization Problems in Planar Graphs. | 1 | 0.35 | 2014 |
| Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees. | 4 | 0.45 | 2014 |
| On the Complexity of Trial and Error for Constraint Satisfaction Problems. | 3 | 0.41 | 2014 |
| Dynamic Complexity of Directed Reachability and Other Problems. | 1 | 0.35 | 2014 |
| Space complexity: what makes planar graphs special? | 0 | 0.34 | 2013 |
| Gems in decision tree complexity revisited | 1 | 0.35 | 2013 |
| Evasiveness through a circuit lens | 5 | 0.45 | 2013 |
| Improved Bounds for Bipartite Matching on Surfaces. | 5 | 0.42 | 2012 |
| Query Complexity of Matroids. | 1 | 0.35 | 2012 |
| On the Power of Isolation in Planar Graphs | 5 | 0.49 | 2011 |
| Evasiveness and the Distribution of Prime Numbers | 8 | 0.52 | 2010 |
| Space complexity of perfect matching in bounded genus bipartite graphs | 9 | 0.49 | 2010 |
| Perfect Matching in Bipartite Planar Graphs is in UL | 3 | 0.40 | 2010 |
| Variations on the Sensitivity Conjecture | 24 | 1.20 | 2010 |
| On the Power of Isolation in Planar Structures | 0 | 0.34 | 2009 |
| Space-Efficient Counting in Graphs on Surfaces | 3 | 0.42 | 2009 |
| Some perfect matchings and perfect half-integral matchings in NC | 6 | 0.46 | 2008 |
| Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs | 21 | 0.81 | 2008 |
| Planarity, Determinants, Permanents, and (Unique) Matchings | 8 | 0.53 | 2007 |
| Parity Problems in Planar Graphs | 4 | 0.57 | 2007 |
| A new NC-algorithm for finding a perfect matching in d-regular bipartite graphs when d is small | 0 | 0.34 | 2006 |
| Seeking a Vertex of the Planar Matching Polytope in NC | 5 | 0.52 | 2004 |
