Author of the publication

Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made.

, , , and . STOC, page 375-388. ACM, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331)., , , and . Dagstuhl Reports, 3 (8): 40-72 (2013)LIMITS and Applications of Group Algebras for Parameterized Problems., and . ACM Trans. Algorithms, 12 (3): 31:1-31:18 (2016)Maximizing conjunctive views in deletion propagation., , and . PODS, page 187-198. ACM, (2011)New algorithms and lower bounds for circuits with linear threshold gates.. STOC, page 194-202. ACM, (2014)All-pairs bottleneck paths for general graphs in truly sub-cubic time., , and . STOC, page 585-589. ACM, (2007)Finding heaviest H-subgraphs in real weighted graphs, with applications, , and . CoRR, (2006)Moby: A Blackout-Resistant Anonymity Network for Mobile Devices., , , , , , and . Proc. Priv. Enhancing Technol., 2022 (3): 247-267 (2022)Super-Linear Gate and Super-Quadratic Wire Lower Bounds for Depth-Two and Depth-Three Threshold Circuits., and . Electron. Colloquium Comput. Complex., (2015)Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity., , , , and . Electron. Colloquium Comput. Complex., (2021)Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky., and . SODA, page 1246-1255. SIAM, (2016)