Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Selection from heaps, row-sorted matrices and X + Y using soft heaps
Speaker:Laszlo Kozma
coming from:TU Eindhoven
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
Visibility:D1, MMCI
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Thursday, 7 December 2017
Duration:30 Minutes
Building:E1 4
We use soft heaps to obtain simpler optimal algorithms for selecting the k-th smallest item and the set of k smallest items, from a heap-ordered tree, from a collection of sorted lists, and from X + Y, where X and Y are two unsorted sets. Our results match, and in some ways extend and improve, classical results of Frederickson (1993) and Frederickson and Johnson (1982).

Joint work with Haim Kaplan, Or Zamir, and Uri Zwick.

Name(s):Karl Bringmann
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):

Karl Bringmann, 11/21/2017 12:24 PM
Last modified:
Uwe Brahm/MPII/DE, 12/07/2017 07:01 AM
  • Karl Bringmann, 11/27/2017 10:19 AM
  • Karl Bringmann, 11/21/2017 12:24 PM -- Created document.