Suivre
Morten Stöckel
Morten Stöckel
Affiliation inconnue
Adresse e-mail validée de di.ku.dk - Page d'accueil
Titre
Citée par
Citée par
Année
Is min-wise hashing optimal for summarizing set intersection?
R Pagh, M Stöckel, DP Woodruff
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of …, 2014
472014
Finding even cycles faster via capped k-walks
S Dahlgaard, MBT Knudsen, M Stöckel
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
342017
The input/output complexity of sparse matrix multiplication
R Pagh, M Stöckel
European Symposium on Algorithms, 750-761, 2014
322014
Constructing light spanners deterministically in near-linear time
S Alstrup, S Dahlgaard, A Filtser, M Stöckel, C Wulff-Nilsen
Theoretical Computer Science 907, 82-112, 2022
312022
Graph reconstruction with a betweenness oracle
M Abrahamsen, G Bodwin, E Rotenberg, M Stöckel
33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, 5, 2016
212016
I/O-efficient similarity join
R Pagh, N Pham, F Silvestri, M Stöckel
Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015
172015
I/O-efficient similarity join
R Pagh, N Pham, F Silvestri, M Stöckel
Algorithmica 78 (4), 1263-1283, 2017
162017
Fast output-sensitive matrix multiplication
R Jacob, M Stöckel
Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015
122015
Near-optimal induced universal graphs for bounded degree graphs
M Abrahamsen, S Alstrup, J Holm, MBT Knudsen, M Stöckel
arXiv preprint arXiv:1607.04911, 2016
102016
New subquadratic approximation algorithms for the girth
S Dahlgaard, MBT Knudsen, M Stöckel
arXiv preprint arXiv:1704.02178, 2017
62017
Near-optimal induced universal graphs for cycles and paths
M Abrahamsen, S Alstrup, J Holm, MBT Knudsen, M Stöckel
Discrete Applied Mathematics 282, 1-13, 2020
52020
Quicksort, largest bucket, and min-wise hashing with limited independence
MBT Knudsen, M Stöckel
Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015
42015
Fast and cache-oblivious dynamic programming with local dependencies
P Bille, M Stöckel
International Conference on Language and Automata Theory and Applications …, 2012
42012
Randomized primitives for big data processing
M Stöckel
KI-Künstliche Intelligenz 32, 91-94, 2018
22018
Association rule mining using maximum entropy
R Pagh, M Stöckel
arXiv preprint arXiv:1501.02143, 2015
12015
Concurrent Data Structures
M Stöckel, S Bøg
12008
Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence
M Bæk Tejs Knudsen, M Stöckel
arXiv e-prints, arXiv: 1502.05729, 2015
2015
The hardness of the functional orientation 2-color problem
S Bøg, M Stöckel, HW Vildhøj
arXiv preprint arXiv:1210.2544, 2012
2012
Fast and Cache-Oblivious Dynamic Programming with Local Dependencies
M Stöckel, P Bille
LATA'12 Proceedings of the 6th international conference on Language and …, 2012
2012
Efficient Dynamic Programming for Large Scale Biological Sequence Comparison
M Stöckel, P Bille
Technical University of Denmark, 2011
2011
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20