44 citations · 115 across the 13 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015★ 7 cited
Subquadratic Algorithms for Succinct Stable Matching
Marvin Künnemann, Daniel Moeller, Ramamohan Paturi +1
We consider the stable matching problem when the preference lists are not given explicitly but are represented in a succinct way and ask whether the problem becomes computationally…
cs.CC2015★ 28 cited
Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping
Karl Bringmann, Marvin Künnemann
Classic similarity measures of strings are longest common subsequence and Levenshtein distance (i.e., the classic edit distance). A classic similarity measure of curves is dynamic…