Marcel Birn

Learn More
We present a simple randomized data structure for two-dimensional point sets that allows fast nearest neighbor queries in many cases. An implementation outperforms several previous implementations for commonly used benchmarks.)} of n points in two-dimensional Euclidean space, we want to build a linear space data structure that can answer nearest neighbor(More)
We show that a simple algorithm for computing a matching on a graph runs in a logarithmic number of phases incurring work linear in the input size. The algorithm can be adapted to provide efficient algorithms in several models of computation, such as PRAM, External Memory, MapReduce and distributed memory models. Our CREW PRAM algorithm is the first O log 2(More)
Acknowledgement I would like to thank my supervisors Cristian Schulz and Peter Sanders for their support and the constructive discussion about problems that occurred during this work. Furthermore I would like to thank Cory Niu and Michael Morante for proofreading this thesis. In particular I would like thank my parents, whose support made it possible for me(More)
  • 1