Skip to content
02: Algorithmen 2, Vorlesung, WS 2017/18, 23.10.2017 episode artwork

Oct 24, 2017 1 hr 20 min

02: Algorithmen 2, Vorlesung, WS 2017/18, 23.10.2017

from Algorithmen 2, Vorlesung, WS17/18 Hosted by Dr. Thomas Worsch

02 | 0:00:00 Starten 0:01:08 Erinnerung an W-Theorie 0:02:22 Randomisierter Quicksort 0:04:34 randQS: Anzahl Vergleiche 0:11:40 randQS: Anzahl Vergleiche mit hoher Wkt. 0:28:25 Chernoff-Schranken 0:29:04 Einfache Schranken 0:32:19 Chernoff-Schranken 0:38:03 Chernoff-Schranken: Beweis von Teil 1 0:44:26 Chernoff-Schranken: Verienfachungen 0:45:47 Chernoff-Schranken: Korollare 0:47:14 Auswertung von Und-Oder-Bäume 0:51:13 Satz 0:53:50 Beweis 1:00:35 Zwischenüberlegung 1:04:58 Algorithmus: randomisierte UOB-Auswertung 1:07:20 Satz 1:09:19 Beweis 1:18:58 Satz

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

02: Algorithmen 2, Vorlesung, WS 2017/18, 23.10.2017

0:00 1:20:22

No transcript yet.

Requests help us decide what to transcribe next.

Frequently asked questions

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

This episode is 1 hour and 20 minutes long.

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

This episode was published on October 24, 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.