Christian Ortolf

According to our database1, Christian Ortolf authored at least 10 papers between 2009 and 2016.

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

2016
Collaborative graph exploration
PhD thesis, 2016

2015
Strategies for parallel unaware cleaners.
Theor. Comput. Sci., 2015

The wake up dominating set problem.
Theor. Comput. Sci., 2015

2014
A Recursive Approach to Multi-robot Exploration of Trees.
Proceedings of the Structural Information and Communication Complexity, 2014

2013
Maximum Distance Separable Codes Based on Circulant Cauchy Matrices.
Proceedings of the Structural Information and Communication Complexity, 2013

Optimal data distribution for heterogeneous parallel storage servers streaming media files.
Proceedings of the IEEE 4th International Conference on Cognitive Infocommunications, 2013

2012
Online multi-robot exploration of grid graphs with rectangular obstacles.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

2010
Tree network coding for peer-to-peer networks.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

2009
Classifying peer-to-peer network coding schemes.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Paircoding: Improving File Sharing Using Sparse Network Codes.
Proceedings of the Fourth International Conference on Internet and Web Applications and Services, 2009


  Loading...