Morten Stöckel

According to our database1, Morten Stöckel authored at least 15 papers between 2012 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Constructing light spanners deterministically in near-linear time.
Theor. Comput. Sci., 2022

2020
Near-optimal induced universal graphs for cycles and paths.
Discret. Appl. Math., 2020

2018
Randomized Primitives for Big Data Processing.
Künstliche Intell., 2018

2017
New Subquadratic Approximation Algorithms for the Girth.
CoRR, 2017

I/O-Efficient Similarity Join.
Algorithmica, 2017

Finding even cycles faster via capped k-walks.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Near-Optimal Induced Universal Graphs for Bounded Degree Graphs.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Graph Reconstruction with a Betweenness Oracle.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015
Association Rule Mining using Maximum Entropy.
CoRR, 2015

Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence.
Proceedings of the Algorithms - ESA 2015, 2015

Fast Output-Sensitive Matrix Multiplication.
Proceedings of the Algorithms - ESA 2015, 2015

2014
Is min-wise hashing optimal for summarizing set intersection?
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

The Input/Output Complexity of Sparse Matrix Multiplication.
Proceedings of the Algorithms - ESA 2014, 2014

2013
The hardness of the functional orientation 2-color problem.
Australas. J Comb., 2013

2012
Fast and Cache-Oblivious Dynamic Programming with Local Dependencies.
Proceedings of the Language and Automata Theory and Applications, 2012


  Loading...