Author of the publication

Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube.

, and . CoRR, (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

Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube., and . CoRR, (2016)Counting of Query Expressions: Limitations of Propositional Methods., , , and . ICDT, page 177-188. OpenProceedings.org, (2014)More on the relative strength of counting principles., and . Proof Complexity and Feasible Arithmetics, volume 39 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 13-35. DIMACS/AMS, (1996)Optimal Bounds for the Predecessor Problem., and . STOC, page 295-304. ACM, (1999)Distributed Computing on TRansitive Networks: The Thorus., and . STACS, volume 349 of Lecture Notes in Computer Science, page 294-303. Springer, (1989)Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space., , and . STOC, page 213-232. ACM, (2012)Stabbing Planes., , , , , , and . ITCS, volume 94 of LIPIcs, page 10:1-10:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Proof complexity.. Computational Complexity Theory, volume 10 of IAS / Park City mathematics series, AMS Chelsea Publishing, (2004)Using Problem Structure for Efficient Clause Learning., , and . SAT, volume 2919 of Lecture Notes in Computer Science, page 242-256. Springer, (2003)Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems., and . STOC, page 688-697. ACM, (2002)