Publications

• Constructing Light Spanners Deterministically in Near-Linear Time

  • Stephen Alstrup, Søren Dahlgaard, Arnold Filtser, Morten Stöckel and Christian Wulff-Nilsen

  • Proceedings of European Symposium on Algorithms (ESA), 2019

• New Subquadratic Approximation Algorithms for the Girth

  • Søren Dahlgaard, Mathias Bæk Tejs Knudsen and Morten Stöckel

  • In Submission

• Finding Even Cycles Faster via Capped k-walks

  • Søren Dahlgaard, Mathias Bæk Tejs Knudsen and Morten Stöckel

  • Proceedings of 49th ACM Symposium on Theory of Computing (STOC), 2017

• Near-optimal Induced Universal Graphs for Bounded Degree Graphs

  • Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen and Morten Stöckel

  • Proceedings of 44th International Colloquium on Automata, Languages and Programming (ICALP), 2017

• Near-Optimal Induced Universal Graphs for Cycles and Paths

  • Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen and Morten Stöckel

  • J. Discrete Applied Mathematics, 2020                                      

• Graph Reconstruction with a Betweenness Oracle

• Mikkel Abrahamsen, Greg Bodwin, Eva Rotenberg and Morten Stöckel

• Proceedings of Symposium on Theoretical Aspects of Computer Science (STACS), 2016

• Randomized Primitives for Big Data Processing

  • Morten Stöckel

  • Thesis 2015, supervised by Rasmus Pagh

• Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence

  • Mathias Bæk Tejs Knudsen and Morten Stöckel

  • Proceedings of European Symposium on Algorithms (ESA), 2015

• Fast Output-sensitive Matrix Multiplication

  • Riko Jacob and Morten Stöckel

  • Proceedings of European Symposium on Algorithms (ESA), 2015

• I/O-efficient Similarity Join in High Dimensions

  • Rasmus Pagh, Ninh Pham, Francesco Silvestri and Morten Stöckel

  • Proceedings of European Symposium on Algorithms (ESA), 2015, and Algorithmica special issue, 2017 

• The Input/Output Complexity of Sparse Matrix Multiplication

  • Rasmus Pagh and Morten Stöckel

  • Proceedings of European Symposium on Algorithms (ESA), 2014

• Association Rule Disambiguation via Maximum Entropy

  • Rasmus Pagh and Morten Stöckel

  • In submission

• Is Min-Wise Hashing Optimal for Summarizing Set Intersection?

  • Rasmus Pagh, Morten Stöckel, and David P. Woodruff

  • Proceedings of Symposium on Principles of Database Systems (PODS), 2014

• The Hardness of the Functional Orientation 2-Color Problem

  • Søren Bøg, Morten Stöckel, and Hjalte Wedel Vildhøj

  • Australasian J. Combinatorics, 2013

• Fast and Cache-Oblivious Dynamic Programming with Local Dependencies

  • Philip Bille and Morten Stöckel

  • Proceedings of International Conference on Language and Automata Theory and Applications (LATA), 2012

• Efficient dynamic programming for large scale biological sequence comparison

  • Morten Stöckel

  • Master's thesis, Technical University of Denmark, supervised by Philip Bille

Teaching   

•            Topics in Algorithms and Data Structures, DIKU, Fall 2016 

•            Algorithm design II, ITU, Fall 2013 

•            Algorithm design II, ITU, Fall 2012 

•            Algorithm design I, ITU, Fall 2012 

•            Algorithms and data structures, ITU, Spring 2012