## Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

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

 Mittagsseminar Talk Information

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

Duration: 30 minutes

Location: CAB G51

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.

Information for students and suggested topics for student talks