| 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 | 44 | 2014 |
| The input/output complexity of sparse matrix multiplication R Pagh, M Stöckel European Symposium on Algorithms, 750-761, 2014 | 31 | 2014 |
| 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 | 30 | 2022 |
| 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 | 28 | 2017 |
| 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 | 19 | 2016 |
| I/O-efficient similarity join R Pagh, N Pham, F Silvestri, M Stöckel Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 17 | 2015 |
| I/O-efficient similarity join R Pagh, N Pham, F Silvestri, M Stöckel Algorithmica 78 (4), 1263-1283, 2017 | 15 | 2017 |
| Fast output-sensitive matrix multiplication R Jacob, M Stöckel Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015 | 12 | 2015 |
| 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 | 10 | 2016 |
| 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 | 5 | 2020 |
| New subquadratic approximation algorithms for the girth S Dahlgaard, MBT Knudsen, M Stöckel arXiv preprint arXiv:1704.02178, 2017 | 5 | 2017 |
| 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 | 4 | 2015 |
| Fast and cache-oblivious dynamic programming with local dependencies P Bille, M Stöckel International Conference on Language and Automata Theory and Applications …, 2012 | 4 | 2012 |
| Randomized primitives for big data processing M Stöckel KI-Künstliche Intelligenz 32, 91-94, 2018 | 2 | 2018 |
| Association rule mining using maximum entropy R Pagh, M Stöckel arXiv preprint arXiv:1501.02143, 2015 | 1 | 2015 |
| Concurrent Data Structures M Stöckel, S Bøg | 1 | 2008 |
| 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 |
Rasmus PaghProfessor of computer science, University of Copenhagen在 di.ku.dk 的电子邮件经过验证
