( en | de | ru )

 

Disambiguation of "Alstrup, Stephen"

Author of the publication

copydeleteadd this publication to your clipboard
Simpler, faster and shorter labels for distances in graphs.

, , , and . SODA, page 338-350. SIAM, (2016)

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.

Stephen Wagner

Andreas Stephen

Stephen Novak

Stephen Riedel

Stephen Stürzenbaum

 

Other publications of authors with the same name

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