default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephen Alstrup
Person information
SPARQL queries 
🛈 Please note that only 55% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j16]Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen:
Constructing light spanners deterministically in near-linear time. Theor. Comput. Sci. 907: 82-112 (2022)- 2021
- [c45]Christian Hansen, Casper Hansen, Jakob Grue Simonsen, Stephen Alstrup, Christina Lioma
:
Unsupervised Multi-Index Semantic Hashing. WWW 2021: 2879-2889 - [i25]Christian Hansen, Casper Hansen, Jakob Grue Simonsen, Stephen Alstrup, Christina Lioma:
Unsupervised Multi-Index Semantic Hashing. CoRR abs/2103.14460 (2021) - 2020
- [j15]Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Near-optimal induced universal graphs for cycles and paths. Discret. Appl. Math. 282: 1-13 (2020) - [c44]Casper Hansen, Christian Hansen, Jakob Grue Simonsen, Stephen Alstrup, Christina Lioma:
Content-aware Neural Hashing for Cold-start Recommendation. SIGIR 2020: 971-980 - [c43]Casper Hansen, Christian Hansen, Jakob Grue Simonsen, Stephen Alstrup, Christina Lioma:
Unsupervised Semantic Hashing with Pairwise Reconstruction. SIGIR 2020: 2009-2012 - [c42]Christian Hansen, Casper Hansen, Jakob Grue Simonsen, Birger Larsen, Stephen Alstrup, Christina Lioma:
Factuality Checking in News Headlines with Eye Tracking. SIGIR 2020: 2013-2016 - [i24]Casper Hansen, Christian Hansen, Jakob Grue Simonsen, Stephen Alstrup, Christina Lioma:
Content-aware Neural Hashing for Cold-start Recommendation. CoRR abs/2006.00617 (2020) - [i23]Christian Hansen, Casper Hansen, Jakob Grue Simonsen, Birger Larsen, Stephen Alstrup, Christina Lioma:
Factuality Checking in News Headlines with Eye Tracking. CoRR abs/2006.09736 (2020) - [i22]Casper Hansen, Christian Hansen, Jakob Grue Simonsen, Stephen Alstrup, Christina Lioma:
Unsupervised Semantic Hashing with Pairwise Reconstruction. CoRR abs/2007.00380 (2020)
2010 – 2019
- 2019
- [j14]Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick:
Adjacency Labeling Schemes and Induced-Universal Graphs. SIAM J. Discret. Math. 33(1): 116-137 (2019) - [c41]Christian Hansen, Casper Hansen, Stephen Alstrup, Christina Lioma:
Modelling End-of-Session Actions in Educational Systems. EDM 2019 - [c40]Stephan Lorenzen, Niklas Hjuler, Stephen Alstrup:
Investigating Writing Style Development in High School. EDM 2019 - [c39]Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen:
Constructing Light Spanners Deterministically in Near-Linear Time. ESA 2019: 4:1-4:15 - [c38]Magnus Stavngaard, August Sørensen, Stephan Lorenzen, Niklas Hjuler, Stephen Alstrup:
Detecting Ghostwriters in High Schools. ESANN 2019 - [c37]Christian Hansen, Casper Hansen, Stephen Alstrup, Jakob Grue Simonsen, Christina Lioma:
Neural Speed Reading with Structural-Jump-LSTM. ICLR (Poster) 2019 - [c36]Casper Hansen, Christian Hansen, Jakob Grue Simonsen, Stephen Alstrup, Christina Lioma:
Unsupervised Neural Generative Semantic Hashing. SIGIR 2019: 735-744 - [c35]Casper Hansen, Christian Hansen, Stephen Alstrup, Jakob Grue Simonsen, Christina Lioma:
Contextually Propagated Term Weights for Document Representation. SIGIR 2019: 897-900 - [c34]Casper Hansen, Christian Hansen, Stephen Alstrup, Jakob Grue Simonsen, Christina Lioma:
Neural Check-Worthiness Ranking with Weak Supervision: Finding Sentences for Fact-Checking. WWW (Companion Volume) 2019: 994-1000 - [i21]Casper Hansen, Christian Hansen, Stephen Alstrup, Jakob Grue Simonsen, Christina Lioma:
Neural Check-Worthiness Ranking with Weak Supervision: Finding Sentences for Fact-Checking. CoRR abs/1903.08404 (2019) - [i20]Christian Hansen, Casper Hansen, Stephen Alstrup, Jakob Grue Simonsen, Christina Lioma:
Modelling Sequential Music Track Skips using a Multi-RNN Approach. CoRR abs/1903.08408 (2019) - [i19]Christian Hansen, Casper Hansen, Stephen Alstrup, Jakob Grue Simonsen, Christina Lioma:
Neural Speed Reading with Structural-Jump-LSTM. CoRR abs/1904.00761 (2019) - [i18]Casper Hansen, Christian Hansen, Jakob Grue Simonsen, Stephen Alstrup, Christina Lioma:
Unsupervised Neural Generative Semantic Hashing. CoRR abs/1906.00671 (2019) - [i17]Casper Hansen, Christian Hansen, Stephen Alstrup, Jakob Grue Simonsen, Christina Lioma:
Contextually Propagated Term Weights for Document Representation. CoRR abs/1906.00674 (2019) - [i16]Magnus Stavngaard, August Sørensen, Stephan Lorenzen, Niklas Hjuler, Stephen Alstrup:
Detecting Ghostwriters in High Schools. CoRR abs/1906.01635 (2019) - [i15]Stephan Lorenzen, Niklas Hjuler, Stephen Alstrup:
Investigating Writing Style Development in High School. CoRR abs/1906.03072 (2019) - [i14]Stephan Lorenzen, Niklas Hjuler, Stephen Alstrup:
Tracking Behavioral Patterns among Students in an Online Educational System. CoRR abs/1908.08937 (2019) - [i13]Christian Hansen, Casper Hansen, Stephen Alstrup, Christina Lioma:
Modelling End-of-Session Actions in Educational Systems. CoRR abs/1909.06856 (2019) - 2018
- [c33]Stephan Lorenzen, Niklas Hjuler, Stephen Alstrup:
Tracking Behavioral Patterns among Students in an Online Educational System. EDM 2018 - [c32]Stephen Alstrup, Agelos Georgakopoulos, Eva Rotenberg, Carsten Thomassen:
A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time. SODA 2018: 1645-1649 - 2017
- [j13]Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen:
Optimal Induced Universal Graphs and Adjacency Labeling for Trees. J. ACM 64(4): 27:1-27:22 (2017) - [c31]Casper Hansen, Christian Hansen, Stephen Alstrup, Christina Lioma:
Smart City Analytics: Ensemble-Learned Prediction of Citizen Home Care. CIKM 2017: 2095-2098 - [c30]Christian Hansen, Casper Hansen, Niklas Hjuler, Stephen Alstrup, Christina Lioma:
Sequence Modelling For Analysing Student Interaction with Educational Systems. EDM 2017 - [c29]Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. ICALP 2017: 128:1-128:14 - [i12]Christian Hansen, Casper Hansen, Niklas Hjuler, Stephen Alstrup, Christina Lioma:
Sequence Modelling For Analysing Student Interaction with Educational Systems. CoRR abs/1708.04164 (2017) - [i11]Casper Hansen, Christian Hansen, Stephen Alstrup, Christina Lioma:
Smart City Analytics: Ensemble-Learned Prediction of Citizen Home Care. CoRR abs/1708.06403 (2017) - [i10]Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel, Christian Wulff-Nilsen:
Constructing Light Spanners Deterministically in Near-Linear Time. CoRR abs/1709.01960 (2017) - 2016
- [c28]Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Ely Porat:
Sublinear Distance Labeling. ESA 2016: 5:1-5:15 - [c27]Stephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen, Ely Porat:
Distance Labeling Schemes for Trees. ICALP 2016: 132:1-132:16 - [c26]Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen, Holger Petersen:
Simpler, faster and shorter labels for distances in graphs. SODA 2016: 338-350 - [i9]Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel:
Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. CoRR abs/1607.04911 (2016) - 2015
- [c25]Nicolae-Bogdan Sara, Rasmus Halland, Christian Igel, Stephen Alstrup:
High-School Dropout Prediction Using Machine Learning: A Danish Large-scale Study. ESANN 2015 - [c24]Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen:
Optimal Induced Universal Graphs and Adjacency Labeling for Trees. FOCS 2015: 1311-1326 - [c23]Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick:
Adjacency Labeling Schemes and Induced-Universal Graphs. STOC 2015: 625-634 - [i8]Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen:
Optimal induced universal graphs and adjacency labeling for trees. CoRR abs/1504.02306 (2015) - [i7]Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen, Holger Petersen:
Simpler, faster and shorter labels for distances in graphs. CoRR abs/1504.04498 (2015) - [i6]Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Ely Porat:
Sublinear distance labeling for sparse graphs. CoRR abs/1507.02618 (2015) - [i5]Stephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen, Ely Porat:
Distance labeling schemes for trees. CoRR abs/1507.04046 (2015) - 2014
- [j12]Stephen Alstrup, Mikkel Thorup, Inge Li Gørtz, Theis Rauhe, Uri Zwick:
Union-Find with Constant Time Deletions. ACM Trans. Algorithms 11(1): 6:1-6:28 (2014) - [c22]Niels Dalum Hansen, Christina Lioma, Birger Larsen, Stephen Alstrup:
Temporal Context for Authorship Attribution - A Study of Danish Secondary Schools. IRFC 2014: 22-40 - [c21]Stephen Alstrup, Esben Bistrup Halvorsen, Kasper Green Larsen:
Near-optimal labeling schemes for nearest common ancestors. SODA 2014: 972-982 - [i4]Stephen Alstrup, Haim Kaplan, Mikkel Thorup, Uri Zwick:
Adjacency labeling schemes and induced-universal graphs. CoRR abs/1404.3391 (2014) - 2013
- [i3]Stephen Alstrup, Esben Bistrup Halvorsen, Kasper Green Larsen:
Near-optimal labeling schemes for nearest common ancestors. CoRR abs/1312.4413 (2013)
2000 – 2009
- 2006
- [j11]Serge Abiteboul, Stephen Alstrup, Haim Kaplan, Tova Milo, Theis Rauhe:
Compact Labeling Scheme for Ancestor Queries. SIAM J. Comput. 35(6): 1295-1309 (2006) - 2005
- [j10]Stephen Alstrup, Philip Bille, Theis Rauhe:
Labeling Schemes for Small Distances in Trees. SIAM J. Discret. Math. 19(2): 448-462 (2005) - [j9]Stephen Alstrup, Thore Husfeldt, Theis Rauhe, Mikkel Thorup:
Black box for constant-time insertion in priority queues (note). ACM Trans. Algorithms 1(1): 102-106 (2005) - [j8]Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Maintaining information in fully dynamic trees with top trees. ACM Trans. Algorithms 1(2): 243-264 (2005) - [c20]Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, Uri Zwick:
Union-Find with Constant Time Deletions. ICALP 2005: 78-89 - 2004
- [j7]Stephen Alstrup, Thore Husfeldt, Theis Rauhe:
Dynamic nested brackets. Inf. Comput. 193(2): 75-83 (2004) - [j6]Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe:
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment. Theory Comput. Syst. 37(3): 441-456 (2004) - 2003
- [c19]Stephen Alstrup, Philip Bille, Theis Rauhe:
Labeling schemes for small distances in trees. SODA 2003: 689-698 - [i2]Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Maintaining Information in Fully-Dynamic Trees with Top Trees. CoRR cs.DS/0310065 (2003) - 2002
- [c18]Stephen Alstrup, Theis Rauhe:
Small Induced-Universal Graphs and Compact Implicit Graph Representations. FOCS 2002: 53-62 - [c17]Stephen Alstrup, Theis Rauhe:
Improved labeling scheme for ancestor queries. SODA 2002: 947-953 - [c16]Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe:
Nearest common ancestors: a survey and a new distributed algorithm. SPAA 2002: 258-264 - [c15]Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, Theis Rauhe:
Time and Space Efficient Multi-method Dispatching. SWAT 2002: 20-29 - [i1]Stephen Alstrup, Michael A. Bender, Erik D. Demaine, Martin Farach-Colton, J. Ian Munro, Theis Rauhe, Mikkel Thorup:
Efficient Tree Layout in a Multilevel Memory Hierarchy. CoRR cs.DS/0211010 (2002) - 2001
- [c14]Stephen Alstrup, Thore Husfeldt, Theis Rauhe:
A cell probe lower bound for dynamic nearest-neighbor searching. SODA 2001: 779-780 - [c13]Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe:
Optimal static range reporting in one dimension. STOC 2001: 476-482 - 2000
- [j5]Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup:
Generalized Dominators for Structured Programs. Algorithmica 27(3): 244-253 (2000) - [j4]Stephen Alstrup, Mikkel Thorup:
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. J. Algorithms 35(2): 169-188 (2000) - [c12]Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe:
New Data Structures for Orthogonal Range Searching. FOCS 2000: 198-207 - [c11]Stephen Alstrup, Jacob Holm:
Improved Algorithms for Finding Level Ancestors in Dynamic Trees. ICALP 2000: 73-84 - [c10]Stephen Alstrup, Jens P. Secher, Mikkel Thorup:
Word encoding tree connectivity works. SODA 2000: 498-499 - [c9]Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe:
Pattern matching in dynamic texts. SODA 2000: 819-828 - [c8]Stephen Alstrup, Jacob Holm, Mikkel Thorup:
Maintaining Center and Median in Dynamic Trees. SWAT 2000: 46-56
1990 – 1999
- 1999
- [j3]Stephen Alstrup, Dov Harel, Peter W. Lauridsen, Mikkel Thorup:
Dominators in Linear Time. SIAM J. Comput. 28(6): 2117-2132 (1999) - [c7]Stephen Alstrup, Amir M. Ben-Amram, Theis Rauhe:
Worst-Case and Amortised Optimality in Union-Find (Extended Abstract). STOC 1999: 499-506 - 1998
- [c6]Stephen Alstrup, Thore Husfeldt, Theis Rauhe:
Marked Ancestor Problems. FOCS 1998: 534-544 - [c5]Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Direct Routing on Trees (Extended Abstract). SODA 1998: 342-349 - 1997
- [j2]Stephen Alstrup, Jens P. Secher, Maz Spork:
Optimal On-Line Decremental Connectivity in Trees. Inf. Process. Lett. 64(4): 161-164 (1997) - [c4]Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup:
Minimizing Diameters of Dynamic Trees. ICALP 1997: 270-280 - [c3]Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlund, Mikkel Thorup:
Finding Cores of Limited Length. WADS 1997: 45-54 - 1996
- [j1]Stephen Alstrup, Jens Clausen, Kristian Jørgensen:
An O(|V|*|E|) Algorithm for Finding Immediate Multiple-Vertex Dominators. Inf. Process. Lett. 59(1): 9-11 (1996) - [c2]Stephen Alstrup, Peter W. Lauridsen, Mikkel Thorup:
Generalized Dominators for Structured Programs. SAS 1996: 42-51 - [c1]Stephen Alstrup, Mikkel Thorup:
Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees. SWAT 1996: 212-222
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
