Campus Event Calendar: Piotr Berman (09/27/2001 in MPII/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

New for: D3

What and Who

Calculating probabilistic properties of trees without Jensen inequality

Piotr Berman

Pennsylvania State University

AG1 Mittagsseminar (own work)

AG 1, AG 2, AG 3, AG 4

AG Audience

English

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

Date, Time and Location

Thursday, 27 September 2001

13:30

-- Not specified --

MPII

024

Saarbrücken

Abstract

A simple probabilistic technique is presented that allows for much

more succint proofs of probabilistic properties of trees. One application
is of interest for didactic reasons:
the average depth of binary search tree is shown
to be below 3 ln n, and the proof is both twice shorter than shortest
published proof, and more elementary.

Contact

Piotr Krysta

--email hidden

System used:

Meeting URL:

Meeting ID:

Passcode:

passcode not visible

Code Visible for:

logged in users only

Imprint / Impressum | Data Protection / Datenschutzhinweis