The following pages link to Stephen Alstrup (Q290263):
Displaying 41 items.
- Optimal on-line decremental connectivity in trees (Q290266) (← links)
- Nearest common ancestors: a survey and a new algorithm for a distributed environment (Q706323) (← links)
- (Q1578405) (redirect page) (← links)
- Generalized dominators for structured programs (Q1578407) (← links)
- An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators (Q1847358) (← links)
- Dynamic nested brackets (Q1882928) (← links)
- Constructing light spanners deterministically in near-linear time (Q2077383) (← links)
- Near-optimal induced universal graphs for cycles and paths (Q2185721) (← links)
- (Q2721967) (← links)
- (Q2754135) (← links)
- A cell probe lower bound for dynamic nearest-neighbour searching (Q2768380) (← links)
- Worst-case and amortised optimality in union-find (extended abstract) (Q2819582) (← links)
- Adjacency Labeling Schemes and Induced-Universal Graphs (Q2941558) (← links)
- Black box for constant-time insertion in priority queues (note) (Q2944491) (← links)
- Maintaining information in fully dynamic trees with top trees (Q2944498) (← links)
- (Q3046473) (← links)
- (Q4250200) (← links)
- Dominators in Linear Time (Q4268860) (← links)
- (Q4471359) (← links)
- Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees (Q4485190) (← links)
- Minimizing diameters of dynamic trees (Q4571959) (← links)
- Simpler, faster and shorter labels for distances in graphs (Q4575602) (← links)
- Distance labeling schemes for trees (Q4598274) (← links)
- Sublinear Distance Labeling (Q4606270) (← links)
- (Q4607996) (← links)
- Adjacency Labeling Schemes and Induced-Universal Graphs (Q4610450) (← links)
- Optimal Induced Universal Graphs and Adjacency Labeling for Trees (Q4640278) (← links)
- (Q4829034) (← links)
- (Q4952658) (← links)
- (Q4952706) (← links)
- Union-Find with Constant Time Deletions (Q4962164) (← links)
- Generalized dominators for structured programs (Q5030185) (← links)
- Optimal pointer algorithms for finding nearest common ancestors in dynamic trees (Q5054814) (← links)
- Constructing Light Spanners Deterministically in Near-Linear Time (Q5075736) (← links)
- Finding cores of limited length (Q5096925) (← links)
- Near-Optimal Induced Universal Graphs for Bounded Degree Graphs (Q5111460) (← links)
- Optimal static range reporting in one dimension (Q5176005) (← links)
- Near-optimal labeling schemes for nearest common ancestors (Q5384034) (← links)
- Compact Labeling Scheme for Ancestor Queries (Q5470735) (← links)
- Labeling Schemes for Small Distances in Trees (Q5470771) (← links)
- Automata, Languages and Programming (Q5716834) (← links)
