From post

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

, , , и . Fun with Algorithms, стр. 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.

 

Другие публикации лиц с тем же именем

The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots., , , , и . Algorithmica, 46 (2): 193-221 (2006)Performance guarantees for the TSP with a parameterized triangle inequality., и . Inf. Process. Lett., 73 (1-2): 17-21 (2000)Two-level main memory co-design: Multi-threaded algorithmic primitives, analysis, and simulation., , , , , , , , , и . J. Parallel Distributed Comput., (2017)An adaptive packed-memory array., и . PODS, стр. 20-29. ACM, (2006)Run Generation Revisited: What Goes Up May or May Not Come Down., , , , и . ISAAC, том 9472 из Lecture Notes in Computer Science, стр. 703-714. Springer, (2015)From Streaming B-Trees to Tokutek: How a Theoretician Learned to be VP of Engineering.. SEA, том 5526 из Lecture Notes in Computer Science, стр. 2. Springer, (2009)The Cost of Cache-Oblivious Searching., , , , , , , и . Algorithmica, 61 (2): 463-505 (2011)Introduction to SODA 2002 and 2003 special issue., , и . ACM Trans. Algorithms, 3 (4): 36 (2007)The snowblower problem., , , и . Comput. Geom., 44 (8): 370-384 (2011)IcebergHT: High Performance PMEM Hash Tables Through Stability and Low Associativity., , , , , , и . CoRR, (2022)