Campus Event Calendar
Event Entry
New for: D3
What and Who
Time = Space: From Searching and Sorting to Edge Clique Covering,fast algorithms which yield fast and small data structures.
Jeremy Barbay
Max-Planck-Institut für Informatik - D1
AG1 Mittagsseminar (own work)
AG 1, AG 3, AG 5, SWS, AG 4, RG1, MMCI
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 27 July 2010
13:00
30 Minutes
E1 4
024
Saarbrücken
Abstract
The talk will have two parts:
1. In the first part, more formal I will show some known results about
the relation between time and space, such as
- between searching in an ordered space and encoding integers, and
- between sorting permutations and compressing them.
2. In the second part, more informal, I will hilight the search for
the same kind of relationship between some Parameterized Complexity
results and the compression of graphs, such as
- Edge Clique Cover
- Cluster Partitioning.
This is a work in collaboration with Serge Gaspers.
Contact
Amr Elmasry
--email hidden
passcode not visible
logged in users only
Amr Elmasry, 06/28/2010 15:14 -- Created document.