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 A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, December 03, 2019, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Shoham Letzter

Finding monotone patterns

We investigate sublinear algorithms for detecting monotone patterns in a sequence. For fixed k, given a sequence of length n, we would like to find (with high probability) an increasing subsequence of length k, provided that the sequence is far from free of such subsequences. We determine the optimal running time of an algorithm that performs this task, for both the non-adaptive and adaptive cases, thus extending well-known results regarding monotonicity testing, and improving on results of Newman, Rabinovich, Rubinfeld and Sohler (2017). This is joint work with Omri Ben-Eliezer, Clément Canonne and Erik Waingarten.

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

Previous talks by year:   2024  2023  2022  2021  2020  2019  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