Stephen Alstrup

Available identifiers

zbMath Open alstrup.stephenWikidataQ28865053 ScholiaQ28865053MaRDI QIDQ290263

List of research outcomes

Publication	Date of Publication	Type
Optimal pointer algorithms for finding nearest common ancestors in dynamic trees	2022-12-09	Paper
Finding cores of limited length	2022-08-19	Paper
Constructing Light Spanners Deterministically in Near-Linear Time	2022-05-11	Paper
Constructing light spanners deterministically in near-linear time	2022-02-21	Paper
Generalized dominators for structured programs	2022-02-16	Paper
Near-optimal induced universal graphs for cycles and paths	2020-06-05	Paper
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs	2020-05-27	Paper
Near-optimal labeling schemes for nearest common ancestors	2019-06-20	Paper
Adjacency Labeling Schemes and Induced-Universal Graphs	2019-01-16	Paper
Union-Find with Constant Time Deletions	2018-10-30	Paper
Simpler, faster and shorter labels for distances in graphs	2018-07-16	Paper
Minimizing diameters of dynamic trees	2018-07-04	Paper
Optimal Induced Universal Graphs and Adjacency Labeling for Trees	2018-05-17	Paper
https://portal.mardi4nfdi.de/entity/Q4607996	2018-03-15	Paper
Sublinear Distance Labeling	2018-03-02	Paper
Distance labeling schemes for trees	2017-12-19	Paper
Worst-case and amortised optimality in union-find (extended abstract)	2016-09-29	Paper
Optimal on-line decremental connectivity in trees	2016-06-01	Paper
Maintaining information in fully dynamic trees with top trees	2015-09-02	Paper
Black box for constant-time insertion in priority queues (note)	2015-09-02	Paper
Adjacency Labeling Schemes and Induced-Universal Graphs	2015-08-21	Paper
Optimal static range reporting in one dimension	2015-02-27	Paper
Compact Labeling Scheme for Ancestor Queries	2006-06-01	Paper
Labeling Schemes for Small Distances in Trees	2006-06-01	Paper
Automata, Languages and Programming	2006-01-10	Paper
Nearest common ancestors: a survey and a new algorithm for a distributed environment	2005-02-08	Paper
https://portal.mardi4nfdi.de/entity/Q4829034	2004-11-29	Paper
Dynamic nested brackets	2004-10-01	Paper
https://portal.mardi4nfdi.de/entity/Q3046473	2004-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q4471359	2004-07-28	Paper
An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators	2003-06-24	Paper
A cell probe lower bound for dynamic nearest-neighbour searching	2002-01-30	Paper
https://portal.mardi4nfdi.de/entity/Q2754135	2001-12-09	Paper
https://portal.mardi4nfdi.de/entity/Q2721967	2001-07-11	Paper
Generalized dominators for structured programs	2000-08-27	Paper
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees	2000-06-05	Paper
https://portal.mardi4nfdi.de/entity/Q4952706	2000-05-10	Paper
https://portal.mardi4nfdi.de/entity/Q4952658	2000-05-10	Paper
Dominators in Linear Time	1999-10-28	Paper
https://portal.mardi4nfdi.de/entity/Q4250200	1999-06-17	Paper

Research outcomes over time

This page was built for person: Stephen Alstrup