default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Stephen Alstrup
@article{DBLP:journals/tcs/AlstrupDFSW22,
author = {Stephen Alstrup and
S{\o}ren Dahlgaard and
Arnold Filtser and
Morten St{\"{o}}ckel and
Christian Wulff{-}Nilsen},
title = {Constructing light spanners deterministically in near-linear time},
journal = {Theor. Comput. Sci.},
volume = {907},
pages = {82--112},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.01.021},
doi = {10.1016/J.TCS.2022.01.021},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlstrupDFSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/Hansen0SAL21,
author = {Christian Hansen and
Casper Hansen and
Jakob Grue Simonsen and
Stephen Alstrup and
Christina Lioma},
editor = {Jure Leskovec and
Marko Grobelnik and
Marc Najork and
Jie Tang and
Leila Zia},
title = {Unsupervised Multi-Index Semantic Hashing},
booktitle = {{WWW} '21: The Web Conference 2021, Virtual Event / Ljubljana, Slovenia,
April 19-23, 2021},
pages = {2879--2889},
publisher = {{ACM} / {IW3C2}},
year = {2021},
url = {https://doi.org/10.1145/3442381.3450014},
doi = {10.1145/3442381.3450014},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/Hansen0SAL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-14460,
author = {Christian Hansen and
Casper Hansen and
Jakob Grue Simonsen and
Stephen Alstrup and
Christina Lioma},
title = {Unsupervised Multi-Index Semantic Hashing},
journal = {CoRR},
volume = {abs/2103.14460},
year = {2021},
url = {https://arxiv.org/abs/2103.14460},
eprinttype = {arXiv},
eprint = {2103.14460},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-14460.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AbrahamsenAHKS20,
author = {Mikkel Abrahamsen and
Stephen Alstrup and
Jacob Holm and
Mathias B{\ae}k Tejs Knudsen and
Morten St{\"{o}}ckel},
title = {Near-optimal induced universal graphs for cycles and paths},
journal = {Discret. Appl. Math.},
volume = {282},
pages = {1--13},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2019.10.030},
doi = {10.1016/J.DAM.2019.10.030},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AbrahamsenAHKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigir/Hansen0SAL20,
author = {Casper Hansen and
Christian Hansen and
Jakob Grue Simonsen and
Stephen Alstrup and
Christina Lioma},
editor = {Jimmy X. Huang and
Yi Chang and
Xueqi Cheng and
Jaap Kamps and
Vanessa Murdock and
Ji{-}Rong Wen and
Yiqun Liu},
title = {Content-aware Neural Hashing for Cold-start Recommendation},
booktitle = {Proceedings of the 43rd International {ACM} {SIGIR} conference on
research and development in Information Retrieval, {SIGIR} 2020, Virtual
Event, China, July 25-30, 2020},
pages = {971--980},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3397271.3401060},
doi = {10.1145/3397271.3401060},
timestamp = {Sun, 02 Oct 2022 16:15:14 +0200},
biburl = {https://dblp.org/rec/conf/sigir/Hansen0SAL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigir/Hansen0SAL20a,
author = {Casper Hansen and
Christian Hansen and
Jakob Grue Simonsen and
Stephen Alstrup and
Christina Lioma},
editor = {Jimmy X. Huang and
Yi Chang and
Xueqi Cheng and
Jaap Kamps and
Vanessa Murdock and
Ji{-}Rong Wen and
Yiqun Liu},
title = {Unsupervised Semantic Hashing with Pairwise Reconstruction},
booktitle = {Proceedings of the 43rd International {ACM} {SIGIR} conference on
research and development in Information Retrieval, {SIGIR} 2020, Virtual
Event, China, July 25-30, 2020},
pages = {2009--2012},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3397271.3401220},
doi = {10.1145/3397271.3401220},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigir/Hansen0SAL20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigir/0004HSLAL20,
author = {Christian Hansen and
Casper Hansen and
Jakob Grue Simonsen and
Birger Larsen and
Stephen Alstrup and
Christina Lioma},
editor = {Jimmy X. Huang and
Yi Chang and
Xueqi Cheng and
Jaap Kamps and
Vanessa Murdock and
Ji{-}Rong Wen and
Yiqun Liu},
title = {Factuality Checking in News Headlines with Eye Tracking},
booktitle = {Proceedings of the 43rd International {ACM} {SIGIR} conference on
research and development in Information Retrieval, {SIGIR} 2020, Virtual
Event, China, July 25-30, 2020},
pages = {2013--2016},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3397271.3401221},
doi = {10.1145/3397271.3401221},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigir/0004HSLAL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-00617,
author = {Casper Hansen and
Christian Hansen and
Jakob Grue Simonsen and
Stephen Alstrup and
Christina Lioma},
title = {Content-aware Neural Hashing for Cold-start Recommendation},
journal = {CoRR},
volume = {abs/2006.00617},
year = {2020},
url = {https://arxiv.org/abs/2006.00617},
eprinttype = {arXiv},
eprint = {2006.00617},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-00617.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-09736,
author = {Christian Hansen and
Casper Hansen and
Jakob Grue Simonsen and
Birger Larsen and
Stephen Alstrup and
Christina Lioma},
title = {Factuality Checking in News Headlines with Eye Tracking},
journal = {CoRR},
volume = {abs/2006.09736},
year = {2020},
url = {https://arxiv.org/abs/2006.09736},
eprinttype = {arXiv},
eprint = {2006.09736},
timestamp = {Tue, 23 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-09736.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-00380,
author = {Casper Hansen and
Christian Hansen and
Jakob Grue Simonsen and
Stephen Alstrup and
Christina Lioma},
title = {Unsupervised Semantic Hashing with Pairwise Reconstruction},
journal = {CoRR},
volume = {abs/2007.00380},
year = {2020},
url = {https://arxiv.org/abs/2007.00380},
eprinttype = {arXiv},
eprint = {2007.00380},
timestamp = {Tue, 07 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-00380.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AlstrupKTZ19,
author = {Stephen Alstrup and
Haim Kaplan and
Mikkel Thorup and
Uri Zwick},
title = {Adjacency Labeling Schemes and Induced-Universal Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {33},
number = {1},
pages = {116--137},
year = {2019},
url = {https://doi.org/10.1137/16M1105967},
doi = {10.1137/16M1105967},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AlstrupKTZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/edm/HansenHAL19,
author = {Christian Hansen and
Casper Hansen and
Stephen Alstrup and
Christina Lioma},
editor = {Michel C. Desmarais and
Collin F. Lynch and
Agathe Merceron and
Roger Nkambou},
title = {Modelling End-of-Session Actions in Educational Systems},
booktitle = {Proceedings of the 12th International Conference on Educational Data
Mining, {EDM} 2019, Montr{\'{e}}al, Canada, July 2-5, 2019},
publisher = {International Educational Data Mining Society {(IEDMS)}},
year = {2019},
url = {https://drive.google.com/file/d/1m6bHH4zJYnyC2EGr2dioFeSlEnhust5v},
timestamp = {Fri, 05 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/edm/HansenHAL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/edm/LorenzenHA19,
author = {Stephan Lorenzen and
Niklas Hjuler and
Stephen Alstrup},
editor = {Michel C. Desmarais and
Collin F. Lynch and
Agathe Merceron and
Roger Nkambou},
title = {Investigating Writing Style Development in High School},
booktitle = {Proceedings of the 12th International Conference on Educational Data
Mining, {EDM} 2019, Montr{\'{e}}al, Canada, July 2-5, 2019},
publisher = {International Educational Data Mining Society {(IEDMS)}},
year = {2019},
url = {https://drive.google.com/file/d/18y57dL9Mb7I72GXo7pbbO5-YwHCCPenp},
timestamp = {Fri, 05 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/edm/LorenzenHA19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AlstrupDFSW19,
author = {Stephen Alstrup and
S{\o}ren Dahlgaard and
Arnold Filtser and
Morten St{\"{o}}ckel and
Christian Wulff{-}Nilsen},
editor = {Michael A. Bender and
Ola Svensson and
Grzegorz Herman},
title = {Constructing Light Spanners Deterministically in Near-Linear Time},
booktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
9-11, 2019, Munich/Garching, Germany},
series = {LIPIcs},
volume = {144},
pages = {4:1--4:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ESA.2019.4},
doi = {10.4230/LIPICS.ESA.2019.4},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/AlstrupDFSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esann/StavngaardSLHA19,
author = {Magnus Stavngaard and
August S{\o}rensen and
Stephan Lorenzen and
Niklas Hjuler and
Stephen Alstrup},
title = {Detecting Ghostwriters in High Schools},
booktitle = {27th European Symposium on Artificial Neural Networks, {ESANN} 2019,
Bruges, Belgium, April 24-26, 2019},
year = {2019},
url = {https://www.esann.org/sites/default/files/proceedings/legacy/es2019-121.pdf},
timestamp = {Tue, 02 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esann/StavngaardSLHA19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iclr/HansenHASL19,
author = {Christian Hansen and
Casper Hansen and
Stephen Alstrup and
Jakob Grue Simonsen and
Christina Lioma},
title = {Neural Speed Reading with Structural-Jump-LSTM},
booktitle = {7th International Conference on Learning Representations, {ICLR} 2019,
New Orleans, LA, USA, May 6-9, 2019},
publisher = {OpenReview.net},
year = {2019},
url = {https://openreview.net/forum?id=B1xf9jAqFQ},
timestamp = {Thu, 25 Jul 2019 13:03:15 +0200},
biburl = {https://dblp.org/rec/conf/iclr/HansenHASL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigir/Hansen0SAL19,
author = {Casper Hansen and
Christian Hansen and
Jakob Grue Simonsen and
Stephen Alstrup and
Christina Lioma},
editor = {Benjamin Piwowarski and
Max Chevalier and
{\'{E}}ric Gaussier and
Yoelle Maarek and
Jian{-}Yun Nie and
Falk Scholer},
title = {Unsupervised Neural Generative Semantic Hashing},
booktitle = {Proceedings of the 42nd International {ACM} {SIGIR} Conference on
Research and Development in Information Retrieval, {SIGIR} 2019, Paris,
France, July 21-25, 2019},
pages = {735--744},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3331184.3331255},
doi = {10.1145/3331184.3331255},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigir/Hansen0SAL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigir/Hansen0ASL19,
author = {Casper Hansen and
Christian Hansen and
Stephen Alstrup and
Jakob Grue Simonsen and
Christina Lioma},
editor = {Benjamin Piwowarski and
Max Chevalier and
{\'{E}}ric Gaussier and
Yoelle Maarek and
Jian{-}Yun Nie and
Falk Scholer},
title = {Contextually Propagated Term Weights for Document Representation},
booktitle = {Proceedings of the 42nd International {ACM} {SIGIR} Conference on
Research and Development in Information Retrieval, {SIGIR} 2019, Paris,
France, July 21-25, 2019},
pages = {897--900},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3331184.3331307},
doi = {10.1145/3331184.3331307},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sigir/Hansen0ASL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/HansenHASL19,
author = {Casper Hansen and
Christian Hansen and
Stephen Alstrup and
Jakob Grue Simonsen and
Christina Lioma},
editor = {Sihem Amer{-}Yahia and
Mohammad Mahdian and
Ashish Goel and
Geert{-}Jan Houben and
Kristina Lerman and
Julian J. McAuley and
Ricardo Baeza{-}Yates and
Leila Zia},
title = {Neural Check-Worthiness Ranking with Weak Supervision: Finding Sentences
for Fact-Checking},
booktitle = {Companion of The 2019 World Wide Web Conference, {WWW} 2019, San Francisco,
CA, USA, May 13-17, 2019},
pages = {994--1000},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3308560.3316736},
doi = {10.1145/3308560.3316736},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/HansenHASL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-08404,
author = {Casper Hansen and
Christian Hansen and
Stephen Alstrup and
Jakob Grue Simonsen and
Christina Lioma},
title = {Neural Check-Worthiness Ranking with Weak Supervision: Finding Sentences
for Fact-Checking},
journal = {CoRR},
volume = {abs/1903.08404},
year = {2019},
url = {http://arxiv.org/abs/1903.08404},
eprinttype = {arXiv},
eprint = {1903.08404},
timestamp = {Tue, 09 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-08404.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-08408,
author = {Christian Hansen and
Casper Hansen and
Stephen Alstrup and
Jakob Grue Simonsen and
Christina Lioma},
title = {Modelling Sequential Music Track Skips using a Multi-RNN Approach},
journal = {CoRR},
volume = {abs/1903.08408},
year = {2019},
url = {http://arxiv.org/abs/1903.08408},
eprinttype = {arXiv},
eprint = {1903.08408},
timestamp = {Tue, 09 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-08408.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-00761,
author = {Christian Hansen and
Casper Hansen and
Stephen Alstrup and
Jakob Grue Simonsen and
Christina Lioma},
title = {Neural Speed Reading with Structural-Jump-LSTM},
journal = {CoRR},
volume = {abs/1904.00761},
year = {2019},
url = {http://arxiv.org/abs/1904.00761},
eprinttype = {arXiv},
eprint = {1904.00761},
timestamp = {Tue, 09 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-00761.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-00671,
author = {Casper Hansen and
Christian Hansen and
Jakob Grue Simonsen and
Stephen Alstrup and
Christina Lioma},
title = {Unsupervised Neural Generative Semantic Hashing},
journal = {CoRR},
volume = {abs/1906.00671},
year = {2019},
url = {http://arxiv.org/abs/1906.00671},
eprinttype = {arXiv},
eprint = {1906.00671},
timestamp = {Tue, 09 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-00671.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-00674,
author = {Casper Hansen and
Christian Hansen and
Stephen Alstrup and
Jakob Grue Simonsen and
Christina Lioma},
title = {Contextually Propagated Term Weights for Document Representation},
journal = {CoRR},
volume = {abs/1906.00674},
year = {2019},
url = {http://arxiv.org/abs/1906.00674},
eprinttype = {arXiv},
eprint = {1906.00674},
timestamp = {Tue, 09 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-00674.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-01635,
author = {Magnus Stavngaard and
August S{\o}rensen and
Stephan Lorenzen and
Niklas Hjuler and
Stephen Alstrup},
title = {Detecting Ghostwriters in High Schools},
journal = {CoRR},
volume = {abs/1906.01635},
year = {2019},
url = {http://arxiv.org/abs/1906.01635},
eprinttype = {arXiv},
eprint = {1906.01635},
timestamp = {Thu, 13 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-01635.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-03072,
author = {Stephan Lorenzen and
Niklas Hjuler and
Stephen Alstrup},
title = {Investigating Writing Style Development in High School},
journal = {CoRR},
volume = {abs/1906.03072},
year = {2019},
url = {http://arxiv.org/abs/1906.03072},
eprinttype = {arXiv},
eprint = {1906.03072},
timestamp = {Fri, 14 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-03072.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-08937,
author = {Stephan Lorenzen and
Niklas Hjuler and
Stephen Alstrup},
title = {Tracking Behavioral Patterns among Students in an Online Educational
System},
journal = {CoRR},
volume = {abs/1908.08937},
year = {2019},
url = {http://arxiv.org/abs/1908.08937},
eprinttype = {arXiv},
eprint = {1908.08937},
timestamp = {Mon, 26 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-08937.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-06856,
author = {Christian Hansen and
Casper Hansen and
Stephen Alstrup and
Christina Lioma},
title = {Modelling End-of-Session Actions in Educational Systems},
journal = {CoRR},
volume = {abs/1909.06856},
year = {2019},
url = {http://arxiv.org/abs/1909.06856},
eprinttype = {arXiv},
eprint = {1909.06856},
timestamp = {Mon, 23 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-06856.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/edm/LorenzenHA18,
author = {Stephan Lorenzen and
Niklas Hjuler and
Stephen Alstrup},
editor = {Kristy Elizabeth Boyer and
Michael Yudelson},
title = {Tracking Behavioral Patterns among Students in an Online Educational
System},
booktitle = {Proceedings of the 11th International Conference on Educational Data
Mining, {EDM} 2018, Buffalo, NY, USA, July 15-18, 2018},
publisher = {International Educational Data Mining Society {(IEDMS)}},
year = {2018},
url = {http://educationaldatamining.org/files/conferences/EDM2018/papers/EDM2018\_paper\_52.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/edm/LorenzenHA18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlstrupGRT18,
author = {Stephen Alstrup and
Agelos Georgakopoulos and
Eva Rotenberg and
Carsten Thomassen},
editor = {Artur Czumaj},
title = {A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear
Time},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1645--1649},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.107},
doi = {10.1137/1.9781611975031.107},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/AlstrupGRT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AlstrupDK17,
author = {Stephen Alstrup and
S{\o}ren Dahlgaard and
Mathias B{\ae}k Tejs Knudsen},
title = {Optimal Induced Universal Graphs and Adjacency Labeling for Trees},
journal = {J. {ACM}},
volume = {64},
number = {4},
pages = {27:1--27:22},
year = {2017},
url = {https://doi.org/10.1145/3088513},
doi = {10.1145/3088513},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AlstrupDK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cikm/HansenHAL17,
author = {Casper Hansen and
Christian Hansen and
Stephen Alstrup and
Christina Lioma},
editor = {Ee{-}Peng Lim and
Marianne Winslett and
Mark Sanderson and
Ada Wai{-}Chee Fu and
Jimeng Sun and
J. Shane Culpepper and
Eric Lo and
Joyce C. Ho and
Debora Donato and
Rakesh Agrawal and
Yu Zheng and
Carlos Castillo and
Aixin Sun and
Vincent S. Tseng and
Chenliang Li},
title = {Smart City Analytics: Ensemble-Learned Prediction of Citizen Home
Care},
booktitle = {Proceedings of the 2017 {ACM} on Conference on Information and Knowledge
Management, {CIKM} 2017, Singapore, November 06 - 10, 2017},
pages = {2095--2098},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3132847.3133101},
doi = {10.1145/3132847.3133101},
timestamp = {Tue, 29 Aug 2023 16:24:43 +0200},
biburl = {https://dblp.org/rec/conf/cikm/HansenHAL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/edm/HansenHHAL17,
author = {Christian Hansen and
Casper Hansen and
Niklas Hjuler and
Stephen Alstrup and
Christina Lioma},
editor = {Xiangen Hu and
Tiffany Barnes and
Arnon Hershkovitz and
Luc Paquette},
title = {Sequence Modelling For Analysing Student Interaction with Educational
Systems},
booktitle = {Proceedings of the 10th International Conference on Educational Data
Mining, {EDM} 2017, Wuhan, Hubei, China, June 25-28, 2017},
publisher = {International Educational Data Mining Society {(IEDMS)}},
year = {2017},
url = {http://educationaldatamining.org/EDM2017/proc\_files/papers/paper\_72.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/edm/HansenHHAL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AbrahamsenAHKS17,
author = {Mikkel Abrahamsen and
Stephen Alstrup and
Jacob Holm and
Mathias B{\ae}k Tejs Knudsen and
Morten St{\"{o}}ckel},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Near-Optimal Induced Universal Graphs for Bounded Degree Graphs},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {128:1--128:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.128},
doi = {10.4230/LIPICS.ICALP.2017.128},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AbrahamsenAHKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-04164,
author = {Christian Hansen and
Casper Hansen and
Niklas Hjuler and
Stephen Alstrup and
Christina Lioma},
title = {Sequence Modelling For Analysing Student Interaction with Educational
Systems},
journal = {CoRR},
volume = {abs/1708.04164},
year = {2017},
url = {http://arxiv.org/abs/1708.04164},
eprinttype = {arXiv},
eprint = {1708.04164},
timestamp = {Tue, 09 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-04164.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-06403,
author = {Casper Hansen and
Christian Hansen and
Stephen Alstrup and
Christina Lioma},
title = {Smart City Analytics: Ensemble-Learned Prediction of Citizen Home
Care},
journal = {CoRR},
volume = {abs/1708.06403},
year = {2017},
url = {http://arxiv.org/abs/1708.06403},
eprinttype = {arXiv},
eprint = {1708.06403},
timestamp = {Tue, 09 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-06403.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-01960,
author = {Stephen Alstrup and
S{\o}ren Dahlgaard and
Arnold Filtser and
Morten St{\"{o}}ckel and
Christian Wulff{-}Nilsen},
title = {Constructing Light Spanners Deterministically in Near-Linear Time},
journal = {CoRR},
volume = {abs/1709.01960},
year = {2017},
url = {http://arxiv.org/abs/1709.01960},
eprinttype = {arXiv},
eprint = {1709.01960},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-01960.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AlstrupDKP16,
author = {Stephen Alstrup and
S{\o}ren Dahlgaard and
Mathias B{\ae}k Tejs Knudsen and
Ely Porat},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {Sublinear Distance Labeling},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {5:1--5:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.5},
doi = {10.4230/LIPICS.ESA.2016.5},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/AlstrupDKP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AlstrupGHP16,
author = {Stephen Alstrup and
Inge Li G{\o}rtz and
Esben Bistrup Halvorsen and
Ely Porat},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Distance Labeling Schemes for Trees},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {132:1--132:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.132},
doi = {10.4230/LIPICS.ICALP.2016.132},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AlstrupGHP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlstrupGHP16,
author = {Stephen Alstrup and
Cyril Gavoille and
Esben Bistrup Halvorsen and
Holger Petersen},
editor = {Robert Krauthgamer},
title = {Simpler, faster and shorter labels for distances in graphs},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {338--350},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch25},
doi = {10.1137/1.9781611974331.CH25},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/AlstrupGHP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AbrahamsenAHKS16,
author = {Mikkel Abrahamsen and
Stephen Alstrup and
Jacob Holm and
Mathias B{\ae}k Tejs Knudsen and
Morten St{\"{o}}ckel},
title = {Near-Optimal Induced Universal Graphs for Bounded Degree Graphs},
journal = {CoRR},
volume = {abs/1607.04911},
year = {2016},
url = {http://arxiv.org/abs/1607.04911},
eprinttype = {arXiv},
eprint = {1607.04911},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AbrahamsenAHKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esann/SaraHIA15,
author = {Nicolae{-}Bogdan Sara and
Rasmus Halland and
Christian Igel and
Stephen Alstrup},
title = {High-School Dropout Prediction Using Machine Learning: {A} Danish
Large-scale Study},
booktitle = {23rd European Symposium on Artificial Neural Networks, {ESANN} 2015,
Bruges, Belgium, April 22-24, 2015},
year = {2015},
url = {https://www.esann.org/sites/default/files/proceedings/legacy/es2015-86.pdf},
timestamp = {Tue, 02 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esann/SaraHIA15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlstrupDK15,
author = {Stephen Alstrup and
S{\o}ren Dahlgaard and
Mathias B{\ae}k Tejs Knudsen},
editor = {Venkatesan Guruswami},
title = {Optimal Induced Universal Graphs and Adjacency Labeling for Trees},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1311--1326},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.84},
doi = {10.1109/FOCS.2015.84},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlstrupDK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlstrupKTZ15,
author = {Stephen Alstrup and
Haim Kaplan and
Mikkel Thorup and
Uri Zwick},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {Adjacency Labeling Schemes and Induced-Universal Graphs},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {625--634},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746545},
doi = {10.1145/2746539.2746545},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlstrupKTZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlstrupDK15,
author = {Stephen Alstrup and
S{\o}ren Dahlgaard and
Mathias B{\ae}k Tejs Knudsen},
title = {Optimal induced universal graphs and adjacency labeling for trees},
journal = {CoRR},
volume = {abs/1504.02306},
year = {2015},
url = {http://arxiv.org/abs/1504.02306},
eprinttype = {arXiv},
eprint = {1504.02306},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlstrupDK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlstrupGHP15,
author = {Stephen Alstrup and
Cyril Gavoille and
Esben Bistrup Halvorsen and
Holger Petersen},
title = {Simpler, faster and shorter labels for distances in graphs},
journal = {CoRR},
volume = {abs/1504.04498},
year = {2015},
url = {http://arxiv.org/abs/1504.04498},
eprinttype = {arXiv},
eprint = {1504.04498},
timestamp = {Fri, 15 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/AlstrupGHP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlstrupDKP15,
author = {Stephen Alstrup and
S{\o}ren Dahlgaard and
Mathias B{\ae}k Tejs Knudsen and
Ely Porat},
title = {Sublinear distance labeling for sparse graphs},
journal = {CoRR},
volume = {abs/1507.02618},
year = {2015},
url = {http://arxiv.org/abs/1507.02618},
eprinttype = {arXiv},
eprint = {1507.02618},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlstrupDKP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlstrupGHP15a,
author = {Stephen Alstrup and
Inge Li G{\o}rtz and
Esben Bistrup Halvorsen and
Ely Porat},
title = {Distance labeling schemes for trees},
journal = {CoRR},
volume = {abs/1507.04046},
year = {2015},
url = {http://arxiv.org/abs/1507.04046},
eprinttype = {arXiv},
eprint = {1507.04046},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlstrupGHP15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlstrupTGRZ14,
author = {Stephen Alstrup and
Mikkel Thorup and
Inge Li G{\o}rtz and
Theis Rauhe and
Uri Zwick},
title = {Union-Find with Constant Time Deletions},
journal = {{ACM} Trans. Algorithms},
volume = {11},
number = {1},
pages = {6:1--6:28},
year = {2014},
url = {https://doi.org/10.1145/2636922},
doi = {10.1145/2636922},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/AlstrupTGRZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/irfc/HansenLLA14,
author = {Niels Dalum Hansen and
Christina Lioma and
Birger Larsen and
Stephen Alstrup},
editor = {David Lamas and
Paul Buitelaar},
title = {Temporal Context for Authorship Attribution - {A} Study of Danish
Secondary Schools},
booktitle = {Multidisciplinary Information Retrieval - 7th Information Retrieval
Facility Conference, {IRFC} 2014, Copenhagen, Denmark, November 10-12,
2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8849},
pages = {22--40},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12979-2\_3},
doi = {10.1007/978-3-319-12979-2\_3},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/irfc/HansenLLA14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlstrupHL14,
author = {Stephen Alstrup and
Esben Bistrup Halvorsen and
Kasper Green Larsen},
editor = {Chandra Chekuri},
title = {Near-optimal labeling schemes for nearest common ancestors},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {972--982},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.72},
doi = {10.1137/1.9781611973402.72},
timestamp = {Tue, 02 Feb 2021 17:07:40 +0100},
biburl = {https://dblp.org/rec/conf/soda/AlstrupHL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlstrupKTZ14,
author = {Stephen Alstrup and
Haim Kaplan and
Mikkel Thorup and
Uri Zwick},
title = {Adjacency labeling schemes and induced-universal graphs},
journal = {CoRR},
volume = {abs/1404.3391},
year = {2014},
url = {http://arxiv.org/abs/1404.3391},
eprinttype = {arXiv},
eprint = {1404.3391},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlstrupKTZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AlstrupHL13,
author = {Stephen Alstrup and
Esben Bistrup Halvorsen and
Kasper Green Larsen},
title = {Near-optimal labeling schemes for nearest common ancestors},
journal = {CoRR},
volume = {abs/1312.4413},
year = {2013},
url = {http://arxiv.org/abs/1312.4413},
eprinttype = {arXiv},
eprint = {1312.4413},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AlstrupHL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AbiteboulAKMR06,
author = {Serge Abiteboul and
Stephen Alstrup and
Haim Kaplan and
Tova Milo and
Theis Rauhe},
title = {Compact Labeling Scheme for Ancestor Queries},
journal = {{SIAM} J. Comput.},
volume = {35},
number = {6},
pages = {1295--1309},
year = {2006},
url = {https://doi.org/10.1137/S0097539703437211},
doi = {10.1137/S0097539703437211},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AbiteboulAKMR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AlstrupBR05,
author = {Stephen Alstrup and
Philip Bille and
Theis Rauhe},
title = {Labeling Schemes for Small Distances in Trees},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {2},
pages = {448--462},
year = {2005},
url = {https://doi.org/10.1137/S0895480103433409},
doi = {10.1137/S0895480103433409},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AlstrupBR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlstrupHRT05,
author = {Stephen Alstrup and
Thore Husfeldt and
Theis Rauhe and
Mikkel Thorup},
title = {Black box for constant-time insertion in priority queues (note)},
journal = {{ACM} Trans. Algorithms},
volume = {1},
number = {1},
pages = {102--106},
year = {2005},
url = {https://doi.org/10.1145/1077464.1077471},
doi = {10.1145/1077464.1077471},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/AlstrupHRT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlstrupHLT05,
author = {Stephen Alstrup and
Jacob Holm and
Kristian de Lichtenberg and
Mikkel Thorup},
title = {Maintaining information in fully dynamic trees with top trees},
journal = {{ACM} Trans. Algorithms},
volume = {1},
number = {2},
pages = {243--264},
year = {2005},
url = {https://doi.org/10.1145/1103963.1103966},
doi = {10.1145/1103963.1103966},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/AlstrupHLT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AlstrupGRTZ05,
author = {Stephen Alstrup and
Inge Li G{\o}rtz and
Theis Rauhe and
Mikkel Thorup and
Uri Zwick},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {Union-Find with Constant Time Deletions},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {78--89},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_7},
doi = {10.1007/11523468\_7},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AlstrupGRTZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/AlstrupHR04,
author = {Stephen Alstrup and
Thore Husfeldt and
Theis Rauhe},
title = {Dynamic nested brackets},
journal = {Inf. Comput.},
volume = {193},
number = {2},
pages = {75--83},
year = {2004},
url = {https://doi.org/10.1016/j.ic.2004.04.006},
doi = {10.1016/J.IC.2004.04.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/AlstrupHR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AlstrupGKR04,
author = {Stephen Alstrup and
Cyril Gavoille and
Haim Kaplan and
Theis Rauhe},
title = {Nearest Common Ancestors: {A} Survey and a New Algorithm for a Distributed
Environment},
journal = {Theory Comput. Syst.},
volume = {37},
number = {3},
pages = {441--456},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-1155-5},
doi = {10.1007/S00224-004-1155-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AlstrupGKR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlstrupBR03,
author = {Stephen Alstrup and
Philip Bille and
Theis Rauhe},
title = {Labeling schemes for small distances in trees},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {689--698},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644220},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/AlstrupBR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0310065,
author = {Stephen Alstrup and
Jacob Holm and
Kristian de Lichtenberg and
Mikkel Thorup},
title = {Maintaining Information in Fully-Dynamic Trees with Top Trees},
journal = {CoRR},
volume = {cs.DS/0310065},
year = {2003},
url = {http://arxiv.org/abs/cs/0310065},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0310065.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlstrupR02,
author = {Stephen Alstrup and
Theis Rauhe},
title = {Small Induced-Universal Graphs and Compact Implicit Graph Representations},
booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
November 2002, Vancouver, BC, Canada, Proceedings},
pages = {53--62},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/SFCS.2002.1181882},
doi = {10.1109/SFCS.2002.1181882},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlstrupR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlstrupR02,
author = {Stephen Alstrup and
Theis Rauhe},
editor = {David Eppstein},
title = {Improved labeling scheme for ancestor queries},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {947--953},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545504},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/AlstrupR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/AlstrupGKR02,
author = {Stephen Alstrup and
Cyril Gavoille and
Haim Kaplan and
Theis Rauhe},
editor = {Arnold L. Rosenberg and
Bruce M. Maggs},
title = {Nearest common ancestors: a survey and a new distributed algorithm},
booktitle = {Proceedings of the Fourteenth Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} 2002, Winnipeg, Manitoba, Canada, August
11-13, 2002},
pages = {258--264},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/564870.564914},
doi = {10.1145/564870.564914},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/AlstrupGKR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AlstrupBGR02,
author = {Stephen Alstrup and
Gerth St{\o}lting Brodal and
Inge Li G{\o}rtz and
Theis Rauhe},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Time and Space Efficient Multi-method Dispatching},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {20--29},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_3},
doi = {10.1007/3-540-45471-3\_3},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/AlstrupBGR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0211010,
author = {Stephen Alstrup and
Michael A. Bender and
Erik D. Demaine and
Martin Farach{-}Colton and
J. Ian Munro and
Theis Rauhe and
Mikkel Thorup},
title = {Efficient Tree Layout in a Multilevel Memory Hierarchy},
journal = {CoRR},
volume = {cs.DS/0211010},
year = {2002},
url = {http://arxiv.org/abs/cs/0211010},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0211010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlstrupHR01,
author = {Stephen Alstrup and
Thore Husfeldt and
Theis Rauhe},
editor = {S. Rao Kosaraju},
title = {A cell probe lower bound for dynamic nearest-neighbor searching},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {779--780},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365778},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/AlstrupHR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlstrupBR01,
author = {Stephen Alstrup and
Gerth St{\o}lting Brodal and
Theis Rauhe},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Optimal static range reporting in one dimension},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {476--482},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380842},
doi = {10.1145/380752.380842},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AlstrupBR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlstrupLT00,
author = {Stephen Alstrup and
Peter W. Lauridsen and
Mikkel Thorup},
title = {Generalized Dominators for Structured Programs},
journal = {Algorithmica},
volume = {27},
number = {3},
pages = {244--253},
year = {2000},
url = {https://doi.org/10.1007/s004530010018},
doi = {10.1007/S004530010018},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AlstrupLT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AlstrupT00,
author = {Stephen Alstrup and
Mikkel Thorup},
title = {Optimal Pointer Algorithms for Finding Nearest Common Ancestors in
Dynamic Trees},
journal = {J. Algorithms},
volume = {35},
number = {2},
pages = {169--188},
year = {2000},
url = {https://doi.org/10.1006/jagm.2000.1079},
doi = {10.1006/JAGM.2000.1079},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/AlstrupT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlstrupBR00,
author = {Stephen Alstrup and
Gerth St{\o}lting Brodal and
Theis Rauhe},
title = {New Data Structures for Orthogonal Range Searching},
booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
12-14 November 2000, Redondo Beach, California, {USA}},
pages = {198--207},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/SFCS.2000.892088},
doi = {10.1109/SFCS.2000.892088},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlstrupBR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AlstrupH00,
author = {Stephen Alstrup and
Jacob Holm},
editor = {Ugo Montanari and
Jos{\'{e}} D. P. Rolim and
Emo Welzl},
title = {Improved Algorithms for Finding Level Ancestors in Dynamic Trees},
booktitle = {Automata, Languages and Programming, 27th International Colloquium,
{ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1853},
pages = {73--84},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-45022-X\_8},
doi = {10.1007/3-540-45022-X\_8},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AlstrupH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlstrupST00,
author = {Stephen Alstrup and
Jens P. Secher and
Mikkel Thorup},
editor = {David B. Shmoys},
title = {Word encoding tree connectivity works},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {498--499},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338598},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/AlstrupST00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlstrupBR00,
author = {Stephen Alstrup and
Gerth St{\o}lting Brodal and
Theis Rauhe},
editor = {David B. Shmoys},
title = {Pattern matching in dynamic texts},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {819--828},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338645},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/AlstrupBR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AlstrupHT00,
author = {Stephen Alstrup and
Jacob Holm and
Mikkel Thorup},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Maintaining Center and Median in Dynamic Trees},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {46--56},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_6},
doi = {10.1007/3-540-44985-X\_6},
timestamp = {Fri, 27 Mar 2020 08:50:36 +0100},
biburl = {https://dblp.org/rec/conf/swat/AlstrupHT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlstrupHLT99,
author = {Stephen Alstrup and
Dov Harel and
Peter W. Lauridsen and
Mikkel Thorup},
title = {Dominators in Linear Time},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {6},
pages = {2117--2132},
year = {1999},
url = {https://doi.org/10.1137/S0097539797317263},
doi = {10.1137/S0097539797317263},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AlstrupHLT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlstrupBR99,
author = {Stephen Alstrup and
Amir M. Ben{-}Amram and
Theis Rauhe},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Worst-Case and Amortised Optimality in Union-Find (Extended Abstract)},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {499--506},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301383},
doi = {10.1145/301250.301383},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlstrupBR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlstrupHR98,
author = {Stephen Alstrup and
Thore Husfeldt and
Theis Rauhe},
title = {Marked Ancestor Problems},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {534--544},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743504},
doi = {10.1109/SFCS.1998.743504},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlstrupHR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlstrupHLT98,
author = {Stephen Alstrup and
Jacob Holm and
Kristian de Lichtenberg and
Mikkel Thorup},
editor = {Howard J. Karloff},
title = {Direct Routing on Trees (Extended Abstract)},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {342--349},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314726},
timestamp = {Thu, 05 Jul 2018 07:29:49 +0200},
biburl = {https://dblp.org/rec/conf/soda/AlstrupHLT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlstrupSS97,
author = {Stephen Alstrup and
Jens P. Secher and
Maz Spork},
title = {Optimal On-Line Decremental Connectivity in Trees},
journal = {Inf. Process. Lett.},
volume = {64},
number = {4},
pages = {161--164},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00170-1},
doi = {10.1016/S0020-0190(97)00170-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlstrupSS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AlstrupHLT97,
author = {Stephen Alstrup and
Jacob Holm and
Kristian de Lichtenberg and
Mikkel Thorup},
editor = {Pierpaolo Degano and
Roberto Gorrieri and
Alberto Marchetti{-}Spaccamela},
title = {Minimizing Diameters of Dynamic Trees},
booktitle = {Automata, Languages and Programming, 24th International Colloquium,
ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1256},
pages = {270--280},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63165-8\_184},
doi = {10.1007/3-540-63165-8\_184},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AlstrupHLT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/AlstrupLST97,
author = {Stephen Alstrup and
Peter W. Lauridsen and
Peer Sommerlund and
Mikkel Thorup},
editor = {Frank K. H. A. Dehne and
Andrew Rau{-}Chaplin and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {Finding Cores of Limited Length},
booktitle = {Algorithms and Data Structures, 5th International Workshop, {WADS}
'97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1272},
pages = {45--54},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63307-3\_47},
doi = {10.1007/3-540-63307-3\_47},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/AlstrupLST97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AlstrupCJ96,
author = {Stephen Alstrup and
Jens Clausen and
Kristian J{\o}rgensen},
title = {An O({\(\vert\)}V{\(\vert\)}*{\(\vert\)}E{\(\vert\)}) Algorithm for
Finding Immediate Multiple-Vertex Dominators},
journal = {Inf. Process. Lett.},
volume = {59},
number = {1},
pages = {9--11},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00085-3},
doi = {10.1016/0020-0190(96)00085-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/AlstrupCJ96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sas/AlstrupLT96,
author = {Stephen Alstrup and
Peter W. Lauridsen and
Mikkel Thorup},
editor = {Radhia Cousot and
David A. Schmidt},
title = {Generalized Dominators for Structured Programs},
booktitle = {Static Analysis, Third International Symposium, SAS'96, Aachen, Germany,
September 24-26, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1145},
pages = {42--51},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61739-6\_32},
doi = {10.1007/3-540-61739-6\_32},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/sas/AlstrupLT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AlstrupT96,
author = {Stephen Alstrup and
Mikkel Thorup},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Optimal Pointer Algorithms for Finding Nearest Common Ancestors in
Dynamic Trees},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {212--222},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_133},
doi = {10.1007/3-540-61422-2\_133},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/AlstrupT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-04-24 23:05 CEST 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:
