Author of the publication

Multiple-Choice Balanced Allocation in (Almost) Parallel.

, , , , and . APPROX-RANDOM, volume 7408 of Lecture Notes in Computer Science, page 411-422. Springer, (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

Fast Generation of Random Permutations Via Networks Simulation., , , and . Algorithmica, 21 (1): 2-20 (1998)Sublinear-time approximation algorithms for clustering via random sampling., and . Random Struct. Algorithms, 30 (1-2): 226-256 (2007)Testing hypergraph colorability., and . Theor. Comput. Sci., 331 (1): 37-52 (2005)Euclidean Traveling Salesman Problem.. Encyclopedia of Algorithms, (2016)Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes., , , and . SODA, page 271-280. ACM/SIAM, (1999)Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs., , and . Electronic Colloquium on Computational Complexity (ECCC), (2007)Planar graphs: Random walks and bipartiteness testing., , , and . Random Struct. Algorithms, 55 (1): 104-124 (2019)Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth., , and . ISAAC, volume 2906 of Lecture Notes in Computer Science, page 544-553. Springer, (2003)Property Testing in Computational Geometry., , and . ESA, volume 1879 of Lecture Notes in Computer Science, page 155-166. Springer, (2000)Bounded Degree Spanning Trees (Extended Abstract)., and . ESA, volume 1284 of Lecture Notes in Computer Science, page 104-117. Springer, (1997)