Stephen Alstrup

According to our database1, Stephen Alstrup
  • authored at least 54 papers between 1996 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Optimal Induced Universal Graphs and Adjacency Labeling for Trees.
J. ACM, 2017

Constructing Light Spanners Deterministically in Near-Linear Time.
CoRR, 2017

Smart City Analytics: Ensemble-Learned Prediction of Citizen Home Care.
CoRR, 2017

Sequence Modelling For Analysing Student Interaction with Educational Systems.
CoRR, 2017

Near-Optimal Induced Universal Graphs for Bounded Degree Graphs.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Smart City Analytics: Ensemble-Learned Prediction of Citizen Home Care.
Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, 2017

2016
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs.
CoRR, 2016

Simpler, faster and shorter labels for distances in graphs.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Distance Labeling Schemes for Trees.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Sublinear Distance Labeling.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Distance labeling schemes for trees.
CoRR, 2015

Simpler, faster and shorter labels for distances in graphs.
CoRR, 2015

Sublinear distance labeling for sparse graphs.
CoRR, 2015

Optimal induced universal graphs and adjacency labeling for trees.
CoRR, 2015

Adjacency Labeling Schemes and Induced-Universal Graphs.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Optimal Induced Universal Graphs and Adjacency Labeling for Trees.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014
Union-Find with Constant Time Deletions.
ACM Trans. Algorithms, 2014

Adjacency labeling schemes and induced-universal graphs.
CoRR, 2014

Near-optimal labeling schemes for nearest common ancestors.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Temporal Context for Authorship Attribution - A Study of Danish Secondary Schools.
Proceedings of the Multidisciplinary Information Retrieval, 2014

2013
Near-optimal labeling schemes for nearest common ancestors.
CoRR, 2013

2006
Compact Labeling Scheme for Ancestor Queries.
SIAM J. Comput., 2006

2005
Black box for constant-time insertion in priority queues (note).
ACM Trans. Algorithms, 2005

Maintaining information in fully dynamic trees with top trees.
ACM Trans. Algorithms, 2005

Labeling Schemes for Small Distances in Trees.
SIAM J. Discrete Math., 2005

Union-Find with Constant Time Deletions.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004
Dynamic nested brackets.
Inf. Comput., 2004

2003
Maintaining Information in Fully-Dynamic Trees with Top Trees
CoRR, 2003

Labeling schemes for small distances in trees.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002
Efficient Tree Layout in a Multilevel Memory Hierarchy
CoRR, 2002

Time and Space Efficient Multi-method Dispatching.
Proceedings of the Algorithm Theory, 2002

Nearest common ancestors: a survey and a new distributed algorithm.
SPAA, 2002

Improved labeling scheme for ancestor queries.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Small Induced-Universal Graphs and Compact Implicit Graph Representations.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
Optimal static range reporting in one dimension.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

A cell probe lower bound for dynamic nearest-neighbor searching.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees.
J. Algorithms, 2000

Generalized Dominators for Structured Programs.
Algorithmica, 2000

Maintaining Center and Median in Dynamic Trees.
Proceedings of the Algorithm Theory, 2000

Word encoding tree connectivity works.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Pattern matching in dynamic texts.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Improved Algorithms for Finding Level Ancestors in Dynamic Trees.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

New Data Structures for Orthogonal Range Searching.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Dominators in Linear Time.
SIAM J. Comput., 1999

Worst-Case and Amortised Optimality in Union-Find (Extended Abstract).
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

1998
Direct Routing on Trees (Extended Abstract).
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

Marked Ancestor Problems.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
Optimal On-Line Decremental Connectivity in Trees.
Inf. Process. Lett., 1997

Finding Cores of Limited Length.
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

Minimizing Diameters of Dynamic Trees.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
An O(|V|*|E|) Algorithm for Finding Immediate Multiple-Vertex Dominators.
Inf. Process. Lett., 1996

Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees.
Proceedings of the Algorithm Theory, 1996

Generalized Dominators for Structured Programs.
Proceedings of the Static Analysis, Third International Symposium, 1996


  Loading...