Author of the publication

Matching Triangles and Basing Hardness on an Extremely Popular Conjecture.

, , and . STOC, page 41-50. ACM, (2015)

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

If the Current Clique Algorithms are Optimal, So is Valiant's Parser., , and . FOCS, page 98-117. IEEE Computer Society, (2015)Safe-Zones for Monitoring Distributed Streams., , , , , and . BD3@VLDB, volume 1018 of CEUR Workshop Proceedings, page 7-12. CEUR-WS.org, (2013)New hardness results for planar graph problems in p and an algorithm for sparsest cut., , and . STOC, page 996-1009. ACM, (2020)Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond., , , and . STOC, page 1487-1500. ACM, (2022)Subquadratic High-Dimensional Hierarchical Clustering., , and . NeurIPS, page 11576-11586. (2019)Impossibility Results for Grammar-Compressed Linear Algebra., , , and . NeurIPS, (2020)Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made., , , and . STOC, page 375-388. ACM, (2016)The 4/3 additive spanner exponent is tight., and . STOC, page 351-361. ACM, (2016)More Applications of the Polynomial Method to Algorithm Design., , and . SODA, page 218-230. SIAM, (2015)Reachability Preservers: New Extremal Bounds and Approximation Algorithms., and . SODA, page 1865-1883. SIAM, (2018)