BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Germany
1 × Greece
1 × Italy
1 × Portugal
1 × Switzerland
2 × USA
Collaborated with:
M.Thorup T.Rauhe J.Holm U.Zwick G.S.Brodal A.M.Ben-Amram P.W.Lauridsen H.Kaplan K.d.Lichtenberg I.L.Gørtz
Talks about:
find (3) union (2) optim (2) dynam (2) tree (2) algorithm (1) structur (1) constant (1) ancestor (1) univers (1)

Person: Stephen Alstrup

DBLP DBLP: Alstrup:Stephen

Contributed to:

STOC 20152015
ICALP 20052005
STOC 20012001
ICALP 20002000
STOC 19991999
ICALP 19971997
SAS 19961996

Wrote 7 papers:

STOC-2015-AlstrupKTZ #graph
Adjacency Labeling Schemes and Induced-Universal Graphs (SA, HK, MT, UZ), pp. 625–634.
ICALP-2005-AlstrupGRTZ #constant
Union-Find with Constant Time Deletions (SA, ILG, TR, MT, UZ), pp. 78–89.
STOC-2001-AlstrupBR
Optimal static range reporting in one dimension (SA, GSB, TR), pp. 476–482.
ICALP-2000-AlstrupH #algorithm
Improved Algorithms for Finding Level Ancestors in Dynamic Trees (SA, JH), pp. 73–84.
STOC-1999-AlstrupBR #worst-case
Worst-Case and Amortised Optimality in Union-Find (SA, AMBA, TR), pp. 499–506.
ICALP-1997-AlstrupHLT
Minimizing Diameters of Dynamic Trees (SA, JH, KdL, MT), pp. 270–280.
SAS-1996-AlstrupLT #source code
Generalized Dominators for Structured Programs (SA, PWL, MT), pp. 42–51.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.