Jesper W. Mikkelsen

Orcid: 0000-0002-6905-5953

According to our database1, Jesper W. Mikkelsen authored at least 10 papers between 2014 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Weighted Online Problems with Advice.
Theory Comput. Syst., 2018

Online edge coloring of paths and trees with a fixed number of colors.
Acta Informatica, 2018

Set Similarity Search for Skewed Data.
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2018

2017
The Advice Complexity of a Class of Hard Online Problems.
Theory Comput. Syst., 2017

2016
Online Algorithms with Advice: A Survey.
SIGACT News, 2016

Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Advice Complexity for a Class of Online Problems.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Optimal Online Edge Coloring of Planar Graphs with Advice.
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014
Online Max-Edge-Coloring of Paths and Trees.
CoRR, 2014

Online Dual Edge Coloring of Paths and Trees.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014


  Loading...