An O(|V|*|E|) Algorithm for Finding Immediate Multiple-Vertex Dominators. - Stephen Alstrup; Jens Clausen; Kristian Jørgensen (Inf. Process. Lett., 1996)

Minimizing Diameters of Dynamic Trees. - Stephen Alstrup; Jacob Holm; Kristian de Lichtenberg; Mikkel Thorup (ICALP, 1997)

Finding Cores of Limited Length. - Stephen Alstrup; Peter W. Lauridsen; Peer Sommerlund; Mikkel Thorup (WADS, 1997)

Optimal On-Line Decremental Connectivity in Trees. - Stephen Alstrup; Jens P. Secher; Maz Spork (Inf. Process. Lett., 1997)

Marked Ancestor Problems. - Stephen Alstrup; Thore Husfeldt; Theis Rauhe (FOCS, 1998)

Direct Routing on Trees (Extended Abstract). - Stephen Alstrup; Jacob Holm; Kristian de Lichtenberg; Mikkel Thorup (SODA, 1998)

Worst-Case and Amortised Optimality in Union-Find (Extended Abstract). - Stephen Alstrup; Amir M. Ben-Amram; Theis Rauhe (STOC, 1999)

Dominators in Linear Time. - Stephen Alstrup; Dov Harel; Peter W. Lauridsen; Mikkel Thorup (SIAM J. Comput., 1999)

New Data Structures for Orthogonal Range Searching. - Stephen Alstrup; Gerth Stølting Brodal; Theis Rauhe (FOCS, 2000)

Improved Algorithms for Finding Level Ancestors in Dynamic Trees. - Stephen Alstrup; Jacob Holm (ICALP, 2000)

Pattern matching in dynamic texts. - Stephen Alstrup; Gerth Stølting Brodal; Theis Rauhe (SODA, 2000)

Word encoding tree connectivity works. - Stephen Alstrup; Jens P. Secher; Mikkel Thorup (SODA, 2000)

Maintaining Center and Median in Dynamic Trees. - Stephen Alstrup; Jacob Holm; Mikkel Thorup (SWAT, 2000)

Generalized Dominators for Structured Programs. - Stephen Alstrup; Peter W. Lauridsen; Mikkel Thorup (Algorithmica, 2000)

Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. - Stephen Alstrup; Mikkel Thorup (J. Algorithms, 2000)

A cell probe lower bound for dynamic nearest-neighbor searching. - Stephen Alstrup; Thore Husfeldt; Theis Rauhe (SODA, 2001)

Optimal static range reporting in one dimension. - Stephen Alstrup; Gerth Stølting Brodal; Theis Rauhe (STOC, 2001)

Small Induced-Universal Graphs and Compact Implicit Graph Representations. - Stephen Alstrup; Theis Rauhe (FOCS, 2002)

Improved labeling scheme for ancestor queries. - Stephen Alstrup; Theis Rauhe (SODA, 2002)

Nearest common ancestors: a survey and a new distributed algorithm. - Stephen Alstrup; Cyril Gavoille; Haim Kaplan; Theis Rauhe (SPAA, 2002)

Time and Space Efficient Multi-method Dispatching. - Stephen Alstrup; Gerth Stølting Brodal; Inge Li Gørtz; Theis Rauhe (SWAT, 2002)

Efficient Tree Layout in a Multilevel Memory Hierarchy - Stephen Alstrup; Michael A. Bender; Erik D. Demaine; Martin Farach-Colton; J. Ian Munro; Theis Rauhe; Mikkel Thorup (CoRR, 2002)

Dynamic nested brackets. - Stephen Alstrup; Thore Husfeldt; Theis Rauhe (Inf. Comput., 2004)

Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment. - Stephen Alstrup; Cyril Gavoille; Haim Kaplan; Theis Rauhe (Theory Comput. Syst., 2004)

Labeling Schemes for Small Distances in Trees. - Stephen Alstrup; Philip Bille; Theis Rauhe (SIAM J. Discret. Math., 2005)

Maintaining information in fully dynamic trees with top trees. - Stephen Alstrup; Jacob Holm; Kristian de Lichtenberg; Mikkel Thorup (ACM Trans. Algorithms, 2005)

Black box for constant-time insertion in priority queues (note). - Stephen Alstrup; Thore Husfeldt; Theis Rauhe; Mikkel Thorup (ACM Trans. Algorithms, 2005)

Compact Labeling Scheme for Ancestor Queries. - Serge Abiteboul; Stephen Alstrup; Haim Kaplan; Tova Milo; Theis Rauhe (SIAM J. Comput., 2006)

Temporal Context for Authorship Attribution - A Study of Danish Secondary Schools. - Niels Dalum Hansen; Christina Lioma; Birger Larsen; Stephen Alstrup (IRFC, 2014)

Near-optimal labeling schemes for nearest common ancestors. - Stephen Alstrup; Esben Bistrup Halvorsen; Kasper Green Larsen (SODA, 2014)

Union-Find with Constant Time Deletions. - Stephen Alstrup; Mikkel Thorup; Inge Li Gørtz; Theis Rauhe; Uri Zwick (ACM Trans. Algorithms, 2014)

High-School Dropout Prediction Using Machine Learning: A Danish Large-scale Study. - Nicolae-Bogdan Sara; Rasmus Halland; Christian Igel; Stephen Alstrup (ESANN, 2015)

Sublinear distance labeling for sparse graphs. - Stephen Alstrup; Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Ely Porat (CoRR, 2015)

Sublinear Distance Labeling. - Stephen Alstrup; Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Ely Porat (ESA, 2016)

Distance Labeling Schemes for Trees. - Stephen Alstrup; Inge Li Gørtz; Esben Bistrup Halvorsen; Ely Porat (ICALP, 2016)

Simpler, faster and shorter labels for distances in graphs. - Stephen Alstrup; Cyril Gavoille; Esben Bistrup Halvorsen; Holger Petersen 001 (SODA, 2016)

Smart City Analytics: Ensemble-Learned Prediction of Citizen Home Care. - Casper Hansen; Christian Hansen 004; Stephen Alstrup; Christina Lioma (CIKM, 2017)

Sequence Modelling For Analysing Student Interaction with Educational Systems. - Christian Hansen 004; Casper Hansen; Niklas Hjuler; Stephen Alstrup; Christina Lioma (EDM, 2017)

Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. - Mikkel Abrahamsen; Stephen Alstrup; Jacob Holm; Mathias Bæk Tejs Knudsen; Morten Stöckel (ICALP, 2017)

Optimal Induced Universal Graphs and Adjacency Labeling for Trees. - Stephen Alstrup; Søren Dahlgaard; Mathias Bæk Tejs Knudsen (J. ACM, 2017)

Tracking Behavioral Patterns among Students in an Online Educational System. - Stephan Lorenzen; Niklas Hjuler; Stephen Alstrup (EDM, 2018)

A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time. - Stephen Alstrup; Agelos Georgakopoulos; Eva Rotenberg; Carsten Thomassen (SODA, 2018)

Modelling End-of-Session Actions in Educational Systems. - Christian Hansen 004; Casper Hansen; Stephen Alstrup; Christina Lioma (EDM, 2019)

Investigating Writing Style Development in High School. - Stephan Lorenzen; Niklas Hjuler; Stephen Alstrup (EDM, 2019)

Detecting Ghostwriters in High Schools. - Magnus Stavngaard; August Sørensen; Stephan Lorenzen; Niklas Hjuler; Stephen Alstrup (ESANN, 2019)

Neural Speed Reading with Structural-Jump-LSTM. - Christian Hansen 004; Casper Hansen; Stephen Alstrup; Jakob Grue Simonsen; Christina Lioma (ICLR (Poster), 2019)

Contextually Propagated Term Weights for Document Representation. - Casper Hansen; Christian Hansen 004; Stephen Alstrup; Jakob Grue Simonsen; Christina Lioma (SIGIR, 2019)

Unsupervised Neural Generative Semantic Hashing. - Casper Hansen; Christian Hansen 004; Jakob Grue Simonsen; Stephen Alstrup; Christina Lioma (SIGIR, 2019)

Neural Check-Worthiness Ranking with Weak Supervision: Finding Sentences for Fact-Checking. - Casper Hansen; Christian Hansen 004; Stephen Alstrup; Jakob Grue Simonsen; Christina Lioma (WWW (Companion Volume), 2019)

Modelling Sequential Music Track Skips using a Multi-RNN Approach. - Christian Hansen 004; Casper Hansen; Stephen Alstrup; Jakob Grue Simonsen; Christina Lioma (CoRR, 2019)

Adjacency Labeling Schemes and Induced-Universal Graphs. - Stephen Alstrup; Haim Kaplan; Mikkel Thorup; Uri Zwick (SIAM J. Discret. Math., 2019)

Factuality Checking in News Headlines with Eye Tracking. - Christian Hansen 004; Casper Hansen; Jakob Grue Simonsen; Birger Larsen; Stephen Alstrup; Christina Lioma (SIGIR, 2020)

Content-aware Neural Hashing for Cold-start Recommendation. - Casper Hansen; Christian Hansen 004; Jakob Grue Simonsen; Stephen Alstrup; Christina Lioma (SIGIR, 2020)

Unsupervised Semantic Hashing with Pairwise Reconstruction. - Casper Hansen; Christian Hansen 004; Jakob Grue Simonsen; Stephen Alstrup; Christina Lioma (SIGIR, 2020)

Near-optimal induced universal graphs for cycles and paths. - Mikkel Abrahamsen; Stephen Alstrup; Jacob Holm; Mathias Bæk Tejs Knudsen; Morten Stöckel (Discret. Appl. Math., 2020)

Unsupervised Multi-Index Semantic Hashing. - Christian Hansen 004; Casper Hansen; Jakob Grue Simonsen; Stephen Alstrup; Christina Lioma (WWW, 2021)

Constructing light spanners deterministically in near-linear time. - Stephen Alstrup; Søren Dahlgaard; Arnold Filtser; Morten Stöckel; Christian Wulff-Nilsen (Theor. Comput. Sci., 2022)