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: Tuesday, November 07, 2006, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Riko Jacob

Optimal Randomized Comparison Based Algorithms for Collision

We consider the problem of finding two identical elements in a list of length $n$ by randomized comparison based algorithms. We find a trade-off between the success probability $p$ and the running time $t$, and show that this trade-off is optimal up to a constant factor. For worst-case running time $t$, the optimal success probability is $p=\Theta\left(\min\{\frac{t}{n},1\}\frac{t}{n\log t}\right)$. For expected running time $t$, the success probability is $p=\Theta\left(t/(n\log(n))\right)$.

As part of this, but of independent interest, we determine the complexity of finding collisions in randomly chosen input according to three natural (uniform) distributions. Again, we determine the optimal (up to a constant factor) trade-off between success probability (relying on the input distribution) and running time, both worst-case and expected.

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