Author of the publication

The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye

, , , and . Fun with Algorithms, page 28--39. Berlin, Heidelberg, Springer Berlin Heidelberg, (2012)

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

Scheduling Parallel Jobs Online with Convex and Concave Parallelizability., , and . Theory Comput. Syst., 62 (2): 304-318 (2018)Approximate Similarity Search Under Edit Distance Using Locality-Sensitive Hashing.. CoRR, (2019)Rational Proofs with Multiple Provers., , and . CoRR, (2015)Minimizing Total Weighted Flow Time with Calibrations., , , and . SPAA, page 67-76. ACM, (2017)Rational Proofs with Multiple Provers., , and . ITCS, page 237-248. ACM, (2016)Cache-Adaptive Algorithms., , , , , and . SODA, page 958-971. SIAM, (2014)Adaptive MapReduce Similarity Joins., and . BeyondMR@SIGMOD, page 4:1-4:4. ACM, (2018)Telescoping Filter: A Practical Adaptive Filter., , , and . ESA, volume 204 of LIPIcs, page 60:1-60:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Run Generation Revisited: What Goes Up May or May Not Come Down., , , , and . ISAAC, volume 9472 of Lecture Notes in Computer Science, page 703-714. Springer, (2015)Scheduling Parallel Jobs Online with Convex and Concave Parallelizability., , and . WAOA, volume 9499 of Lecture Notes in Computer Science, page 183-195. Springer, (2015)