Carsten Grimm

activity

20132016

most citedA Note on the Unsolvability of the Weighted Region Shortest Path Problem

2 citations · 4 across the 4 of their papers we have counts for

collaborators

Showing 2015 · cs.DSShow all

2 papers · 2 filters

cs.DS2015

A Lower Bound on Supporting Predecessor Search in $k$ sorted Arrays

Carsten Grimm

We seek to perform efficient queries for the predecessor among $n$ values stored in $k$ sorted arrays. Evading the $Ω (n lo g k)$ lower bound from merging $k$ arrays, we support pre…

cs.DS2015★ 1 cited

Efficient Farthest-Point Queries in Two-Terminal Series-Parallel Networks

Carsten Grimm

Consider the continuum of points along the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms…

A Lower Bound on Supporting Predecessor Search in k sorted Arrays

Efficient Farthest-Point Queries in Two-Terminal Series-Parallel Networks

A Lower Bound on Supporting Predecessor Search in $k$ sorted Arrays