Searching for authors named "Stephen Alstrup" – sorted by Relevance.
-
Marked ancestor problems (extended abstract
- Marked Ancestor Problems (Extended Abstract) Stephen Alstrup DIKU, Comp. Sc. Dept., University
- Cited by 2 (2 self) – Add To MetaCart
-
Optimal Algorithms for Finding Nearest Common Ancestors in Dynamic Trees
- Optimal algorithms for finding nearest common ancestors in dynamic trees Stephen Alstrup
- Cited by 3 (2 self) – Add To MetaCart
-
Optimal static range reporting in one dimension
- Optimal Static Range Reporting in One Dimension Stephen Alstrup* The IT University of
- Cited by 9 (0 self) – Add To MetaCart
-
Introducing — a new technology for large-scale streaming over the Internet
- the Internet Stephen Alstrup and Theis Rauhe Octoshape The popularity of live streaming over the Internet
- Add To MetaCart
-
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
- Improved Algorithms for Finding Level Ancestors in Dynamic Trees Stephen Alstrup and Jacob Holm
- Cited by 10 (1 self) – Add To MetaCart
-
Small Induced-Universal Graphs and Compact Implicit Graph Representations
- Small Induced-Universal Graphs and Compact Implicit Graph Representations Stephen Alstrup Theis
- Cited by 4 (0 self) – Add To MetaCart
-
Improved Labeling Scheme for Ancestor Queries
- of Improved labeling scheme for ancestor queries Stephen Alstrup Theis Rauhe IT-C Technical Report
- Cited by 39 (7 self) – Add To MetaCart
-
A Cell Probe Lower Bound for Dynamic Nearest-Neighbour Searching
- A cell probe lower bound for dynamic nearest-neighbour searching Stephen Alstrup Thore Husfeldt
- Add To MetaCart
-
Worst-case and Amortised Optimality in Union-Find (Extended abstract )
- Worst-case and Amortised Optimality in Union-Find (Extended abstract) Stephen Alstrup , Amir M
- Add To MetaCart
-
A Simple and Optimal Algorithm for Finding Immediate Dominators in Reducible Graphs
- A simple and optimal algorithm for finding immediate dominators in reducible graphs Stephen
- Cited by 3 (0 self) – Add To MetaCart

