Saarland University
Department of Computer Science
Computational Complexity
Computational Complexity

Publications

Teaching

Workshops

Computational Complexity - Research Seminar

Markus Bläser: Median Find, Part 2 - Upper Bounds

Dec. 11, 2008, 10:15 a.m.
E 1 3, Room 415

We present lower bounds for the number of comparisons needed to find the median of n numbers and pose some open problems.