From post

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.

 

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

A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically., , и . PODC, стр. 219-228. ACM, (1999)Quantifiers and Approximation (Extended Abstract), и . STOC, стр. 446-456. ACM, (1990)An experimental study of a simple, distributed edge coloring algorithm., , и . SPAA, стр. 166-175. ACM, (2000)Distributed Weighted Vertex Cover via Maximal Matchings., , и . COCOON, том 3595 из Lecture Notes in Computer Science, стр. 839-848. Springer, (2005)Wavelength rerouting in optical networks, or the Venetian routing problem., , , , и . APPROX, том 1913 из Lecture Notes in Computer Science, стр. 72-83. Springer, (2000)Milgram-routing in social networks., , и . WWW, стр. 725-734. ACM, (2011)Completeness in Approximation Classes., и . FCT, том 380 из Lecture Notes in Computer Science, стр. 116-126. Springer, (1989)The Distortion of Locality Sensitive Hashing., , , и . ITCS, том 67 из LIPIcs, стр. 54:1-54:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Communities, Random Walks, and Social Sybil Defense., , , , и . Internet Math., 10 (3-4): 360-420 (2014)Tracks from hell - When finding a proof may be easier than checking it., , и . Theor. Comput. Sci., (2020)