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.

 

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

Nearest common ancestors: a survey and a new distributed algorithm., , , и . SPAA, стр. 258-264. ACM, (2002)Union-Find with Constant Time Deletions., , , , и . ICALP, том 3580 из Lecture Notes in Computer Science, стр. 78-89. Springer, (2005)Minimizing Diameters of Dynamic Trees., , , и . ICALP, том 1256 из Lecture Notes in Computer Science, стр. 270-280. Springer, (1997)Unsupervised Semantic Hashing with Pairwise Reconstruction., , , , и . SIGIR, стр. 2009-2012. ACM, (2020)A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time., , , и . SODA, стр. 1645-1649. SIAM, (2018)Unsupervised Multi-Index Semantic Hashing., , , , и . WWW, стр. 2879-2889. ACM / IW3C2, (2021)Constructing Light Spanners Deterministically in Near-Linear Time., , , , и . CoRR, (2017)Generalized Dominators for Structured Programs., , и . Algorithmica, 27 (3): 244-253 (2000)A cell probe lower bound for dynamic nearest-neighbor searching., , и . SODA, стр. 779-780. ACM/SIAM, (2001)Union-Find with Constant Time Deletions., , , , и . ACM Trans. Algorithms, 11 (1): 6:1-6:28 (2014)