Campus Event Calendar: Kurt Mehlhorn (03/02/2016 in E1 4/024)

Campus Event Calendar

Campus Event Calendar:
- All Upcoming:
  - only for D1
  - only for D2
  - only for INET
  - only for D4
  - only for D5
  - only for D6
  - only for RG1
  - Mailing Lists
  - by Speaker
  - by Type
  - by Category
  - by Title
  - Calendar
  - RSS Feed
- History of Events:

Event Entry

What and Who

Hollow Heaps (Hansen, Kaplan, Tarjan, Zwick)

Kurt Mehlhorn

Max-Planck-Institut für Informatik - D1

AG1 Mittagsseminar (others' work)

AG 1, AG 2, AG 3, AG 4, AG 5, RG1, SWS, MMCI

AG Audience

English

Note: We use this to send email in the morning.

Date, Time and Location

Wednesday, 2 March 2016

16:00

60 Minutes

E1 4

024

Saarbrücken

Abstract

Quote from the paper: We introduce the hollow heap, a very simple data structure with the same amortized efficiency as Fibonacci heaps. Hollow heaps are by far the simplest data structure achieving this.

Contact

Kurt Mehlhorn

--email hidden

System used:

Meeting URL:

Meeting ID:

Passcode:

passcode not visible

Code Visible for:

logged in users only

Kurt Mehlhorn, 02/23/2016 12:03 -- Created document.

Imprint / Impressum | Data Protection / Datenschutzhinweis