17: Algorithmen 2, Vorlesung, WS 2017/18, 18.12.2017 episode artwork

EPISODE · Dec 19, 2017 · 1H 27M

17: Algorithmen 2, Vorlesung, WS 2017/18, 18.12.2017

from Algorithmen 2, Vorlesung, WS17/18 · host Dr. rer. nat. Simon Gog

17 | 0:00:00 Starten 0:00:46 Aufgabenvarianten 0:01:16 Verteilte Eigenschaften 0:01:30 Theoretiker-Quicksort 0:06:08 Fortgeschrittene Datenstrukturen 0:10:27 Adressierbare Prioritätslisten 0:34:55 Adressierbare Prioritätslisten: Anwendungen 0:38:27 Grundlegende Datenstruktur 0:39:29 Wälder bearbeiten 0:40:59 Pairing Heaps (Paarungs-Haufen??) 0:46:39 Pairing Heaps - Repräsentationen 0:48:35 Pairing Heaps - Analyse 0:49:51 Fibonacci Heaps 0:53:27 Repräsentation 0:54:09 deleteMin mit Union-by-Rank 0:55:46 Schnelles Union-by-Rank 0:59:15 Amortisierte Analyse von deleteMin 1:03:06 Warum ist maxRank logarithmisch? - Binomialbäume 1:07:19 Kaskadierende Schnitte 1:13:30 Auftritt Herr Fibonacci 1:18:39 Beweis 1:23:23 Addressable Priority Queues: Mehr 1:25:24 Zusammenfassung: Datenstrukturen

Episode metadata supplied by the publisher feed · Published Dec 19, 2017

Embed this episode

NOW PLAYING

17: Algorithmen 2, Vorlesung, WS 2017/18, 18.12.2017

0:00 1:27:13

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

Frequently Asked Questions

How long is this episode of Algorithmen 2, Vorlesung, WS17/18?

This episode is 1 hour and 27 minutes long.

When was this Algorithmen 2, Vorlesung, WS17/18 episode published?

This episode was published on December 19, 2017.

Can I download this Algorithmen 2, Vorlesung, WS17/18 episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!