Stephen Alstrup

From MaRDI portal
Person:290263

Available identifiers

zbMath Open alstrup.stephenWikidataQ28865053 ScholiaQ28865053MaRDI QIDQ290263

List of research outcomes





PublicationDate of PublicationType
Optimal pointer algorithms for finding nearest common ancestors in dynamic trees2022-12-09Paper
Finding cores of limited length2022-08-19Paper
Constructing Light Spanners Deterministically in Near-Linear Time2022-05-11Paper
Constructing light spanners deterministically in near-linear time2022-02-21Paper
Generalized dominators for structured programs2022-02-16Paper
Near-optimal induced universal graphs for cycles and paths2020-06-05Paper
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs2020-05-27Paper
Near-optimal labeling schemes for nearest common ancestors2019-06-20Paper
Adjacency Labeling Schemes and Induced-Universal Graphs2019-01-16Paper
Union-Find with Constant Time Deletions2018-10-30Paper
Simpler, faster and shorter labels for distances in graphs2018-07-16Paper
Minimizing diameters of dynamic trees2018-07-04Paper
Optimal Induced Universal Graphs and Adjacency Labeling for Trees2018-05-17Paper
https://portal.mardi4nfdi.de/entity/Q46079962018-03-15Paper
Sublinear Distance Labeling2018-03-02Paper
Distance labeling schemes for trees2017-12-19Paper
Worst-case and amortised optimality in union-find (extended abstract)2016-09-29Paper
Optimal on-line decremental connectivity in trees2016-06-01Paper
Maintaining information in fully dynamic trees with top trees2015-09-02Paper
Black box for constant-time insertion in priority queues (note)2015-09-02Paper
Adjacency Labeling Schemes and Induced-Universal Graphs2015-08-21Paper
Optimal static range reporting in one dimension2015-02-27Paper
Compact Labeling Scheme for Ancestor Queries2006-06-01Paper
Labeling Schemes for Small Distances in Trees2006-06-01Paper
Automata, Languages and Programming2006-01-10Paper
Nearest common ancestors: a survey and a new algorithm for a distributed environment2005-02-08Paper
https://portal.mardi4nfdi.de/entity/Q48290342004-11-29Paper
Dynamic nested brackets2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q30464732004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q44713592004-07-28Paper
An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators2003-06-24Paper
A cell probe lower bound for dynamic nearest-neighbour searching2002-01-30Paper
https://portal.mardi4nfdi.de/entity/Q27541352001-12-09Paper
https://portal.mardi4nfdi.de/entity/Q27219672001-07-11Paper
Generalized dominators for structured programs2000-08-27Paper
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees2000-06-05Paper
https://portal.mardi4nfdi.de/entity/Q49527062000-05-10Paper
https://portal.mardi4nfdi.de/entity/Q49526582000-05-10Paper
Dominators in Linear Time1999-10-28Paper
https://portal.mardi4nfdi.de/entity/Q42502001999-06-17Paper

Research outcomes over time

This page was built for person: Stephen Alstrup