Michael Brand

According to our database1, Michael Brand
  • authored at least 25 papers between 2010 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Small polyomino packing.
Inf. Process. Lett., 2017

A Modular Approach for Non-Distributed Crash Recovery for Streaming Systems.
Proceedings of the Datenbanksysteme für Business, 2017

2016
The IMP game: Learnability, approximability and adversarial learning beyond $Σ^0_1$.
CoRR, 2016

MML is not consistent for Neyman-Scott.
CoRR, 2016

2015
No easy puzzles: Hardness results for jigsaw puzzles.
Theor. Comput. Sci., 2015

Arbitrary sequence RAMs.
Inf. Process. Lett., 2015

Modulares Verteilungskonzept für Datenstrommanagementsysteme.
Datenbank-Spektrum, 2015

Herakles: real-time sport analysis using a distributed data stream management system.
Proceedings of the 9th ACM International Conference on Distributed Event-Based Systems, 2015

Using odysseus for real-time analysis over high volume geospatial data streams.
Proceedings of the 9th ACM International Conference on Distributed Event-Based Systems, 2015

Modulares Verteilungskonzept für Datenstrommanagementsysteme.
Proceedings of the Datenbanksysteme für Business, Technologie und Web (BTW 2015), 2015

Herakles: A system for sensor-based live sport analysis using private peer-to-peer networks.
Proceedings of the Datenbanksysteme für Business, Technologie und Web (BTW 2015), 2015

2014
Constant-time sorting.
Inf. Comput., 2014

Lower bounds on the Münchhausen problem.
Australasian J. Combinatorics, 2014

No Easy Puzzles: A Hardness Result for Jigsaw Puzzles.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013
Friedman numbers have density 1.
Discrete Applied Mathematics, 2013

Computing with and without arbitrary large numbers
CoRR, 2013

Lower bounds on the Münchhausen problem
CoRR, 2013

Arbitrary Sequence RAMs.
CoRR, 2013

The RAM equivalent of P vs. RP.
CoRR, 2013

Computing with and without Arbitrary Large Numbers.
Proceedings of the Theory and Applications of Models of Computation, 2013

Autonomous robot path optimization using firefly algorithm.
Proceedings of the International Conference on Machine Learning and Cybernetics, 2013

2012
Tightening the bounds on the Baron's Omni-sequence.
Discrete Mathematics, 2012

Münchhausen Matrices.
Electr. J. Comb., 2012

Does indirect addressing matter? - A note.
Acta Inf., 2012

2010
Compressed genotyping.
IEEE Trans. Information Theory, 2010


  Loading...