Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, March 26, 2015, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Karl Bringmann

Quadratic-Time Hardness for Similarity Measures on Strings and Curves

We study similarity measures on strings, such as longest common subsequence and edit distance, and on curves, such as Fréchet distance and dynamic time warping. All of these measures have simple quadratic time dynamic programs. Recently quadratic-time lower bounds based on the Strong Exponential Time Hypothesis have been shown for Fréchet distance and edit distance. We extend these lower bounds by building a framework for proving quadratic-time hardness of similarity measures. We use this framework to obtain quadratic-time lower bounds for longest common subsequence (on binary strings) and dynamic time warping (on time-series). Moreover, we improve the hardness of edit distance by proving it on binary strings and for any non-trivial costs of the edit distance operations.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login