#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2015

2017

- This year (2)
- Last 5 years (4)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Niklas Baumstark, Guy E. Blelloch, Julian Shun
- ESA
- 2015

Motivated by the observation that FIFO-based push-relabel algorithms are able to outperform highest label-based variants on modern, large maximum flow problem instances, we introduce an efficient implementation of the algorithm that uses coarse-grained parallelism to avoid the problems of existing parallel approaches. We demonstrate good relative and… (More)

I declare that I have developed and written the enclosed thesis completely by myself, and have not used sources or means without declaration in the text.

- Niklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit
- SEA
- 2017

Finding the position of the minimal element in a subarray A[i..j] of an array A of size n is a fundamental operation in many applications. In 2011, Fischer and Heun presented the first index of size 2n+ o(n) bits which answers the operation in constant time for any subarray. The index can be computed in linear time and queries can be answered without… (More)

- Niklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit
- SEA
- 2017

One of the central problems in information retrieval is that of finding the k documents in a large text collection that best match a query given by a user. A recent result of Navarro & Nekrich (SODA 2012) showed that single term and phrase queries of length m can be solved in optimal O(m + k) time using a linear word sized index. While a verbatim… (More)

- ‹
- 1
- ›