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: Alstrup:Stephen
Contributed to:
2015
20052001200019991997
1996Wrote 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.