MADALGO seminar, Jeremy T. Finemann, MIT

Titel: Cache-Oblivious Streaming B-Trees
Speaker: Jeremy T. Finemann, Massachusetts Institute of Technology

ABSTRACT

The B-tree is the classic external-memory-dictionary data structure.
The B-tree is typically analyzed in a two-level memory model (called the DAM or I/O model) in which internal memory of size M is organized into
size-B blocks, and there is an arbitrarily large external...

---

CAGT/COMA Seminar: Vladimir Gurvich

Title: Generating Vertices of a Polyhedron is Hard
Speaker: Vladimir Gurvich, University of Aarhus and RUTCOR, Rutgers University.
Time: Tue July 1st 2008, 14:15-16:00
Location: Turing-014
Abstract:

We show that generating all negative cycles of a weighted graph is hard in both directed and undirected cases. More precisely, all negative cycles cannot be generated in time polynomial in the number...

---

MADALGO seminar, Jeff M. Phillips, Duke University

Titel: Creating e-Samples for Terrains
Speaker: Jeff M. Phillips, Duke University

ABSTRACT

Consider a point set D with a measure function µ : D ? R. Let A be the set of subsets of D induced by containment in a shape from some geometric family (e.g. axis-aligned rectangles, half planes, balls, k- oriented polygons). We say a range space (D, A) has an e-sample (a.k.a. e-approximation) P if

...

---