Obserwuj
Stephen Alstrup
Stephen Alstrup
University of Copenhagen (in start-ups on/off since 2003 )
Zweryfikowany adres z di.ku.dk - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Compact labeling scheme for ancestor queries
S Abiteboul, S Alstrup, H Kaplan, T Milo, T Rauhe
SIAM Journal on Computing 35 (6), 1295-1309, 2006
2482006
New data structures for orthogonal range searching
S Alstrup, G Stolting Brodal, T Rauhe
41st Annual Symposium on Foundations of Computer Science (FOCS), 198-207, 2000
2222000
Nearest common ancestors: a survey and a new distributed algorithm
S Alstrup, C Gavoille, H Kaplan, T Rauhe
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms …, 2002
2202002
Maintaining information in fully dynamic trees with top trees
S Alstrup, J Holm, KD Lichtenberg, M Thorup
Acm Transactions on Algorithms (talg) 1 (2), 243-264, 2005
1902005
Dominators in linear time
S Alstrup, D Harel, PW Lauridsen, M Thorup
SIAM Journal on Computing 28 (6), 2117-2132, 1999
1831999
Marked ancestor problems
S Alstrup, T Husfeldt, T Rauhe
39th Annual Symposium on Foundations of Computer Science (FOCS), 534-543, 1998
1681998
High-school dropout prediction using machine learning: A Danish large-scale study
NB Sara, R Halland, C Igel, S Alstrup
ESANN 2015 proceedings, European symposium on artificial neural networks …, 2015
1162015
Improved labeling scheme for ancestor queries
S Alstrup, T Rauhe
Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete …, 2002
1102002
Labeling schemes for small distances in trees
S Alstrup, P Bille, T Rauhe
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2003
982003
Pattern matching in dynamic texts
S Alstrup, GS Brodal, T Rauhe
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms …, 2000
92*2000
Improved algorithms for finding level ancestors in dynamic trees
S Alstrup, J Holm
Automata, Languages and Programming, 27th International Colloquium (ICALP …, 2000
842000
Small induced-universal graphs and compact implicit graph representations
S Alstrup, T Rauhe
43rd Symposium on Foundations of Computer Science (FOCS), 53-62, 2002
822002
Minimizing diameters of dynamic trees
S Alstrup, J Holm, K de Lichtenberg, M Thorup
Automata, Languages and Programming, 24th International Colloquium (ICALP …, 1997
731997
Optimal static range reporting in one dimension
S Alstrup, G Brodal, T Rauhe
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
702001
Adjacency labeling schemes and induced-universal graphs
S Alstrup, H Kaplan, M Thorup, U Zwick
SIAM Journal on Discrete Mathematics 33 (1), 116-137, 2019
65*2019
Optimal induced universal graphs and adjacency labeling for trees
S Alstrup, S Dahlgaard, MBT Knudsen
Journal of the ACM (JACM) 64 (4), 1-22, 2017
592017
Neural check-worthiness ranking with weak supervision: Finding sentences for fact-checking
C Hansen, C Hansen, S Alstrup, J Grue Simonsen, C Lioma
Companion proceedings of the 2019 world wide web conference, 994-1000, 2019
562019
Maintaining center and median in dynamic trees
S Alstrup, J Holm, M Thorup
7th Scandinavian Workshop on Algorithm Theory (SWAT), 46-56, 2000
54*2000
Content-aware neural hashing for cold-start recommendation
C Hansen, C Hansen, JG Simonsen, S Alstrup, C Lioma
Proceedings of the 43rd International ACM SIGIR Conference on Research and …, 2020
502020
Neural speed reading with structural-jump-lstm
C Hansen, C Hansen, S Alstrup, JG Simonsen, C Lioma
arXiv preprint arXiv:1904.00761, 2019
492019
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20