Search the Dagstuhl Website
Looking for information on the websites of the individual seminars? - Then please:
Not found what you are looking for? - Some of our services have separate websites, each with its own search option. Please check the following list:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Within this website:
External resources:
  • DOOR (for registering your stay at Dagstuhl)
  • DOSA (for proposing future Dagstuhl Seminars or Dagstuhl Perspectives Workshops)
Within this website:
External resources:
Within this website:
External resources:
  • the dblp Computer Science Bibliography

Dagstuhl Seminar 06091

Data Structures

( Feb 26 – Mar 03, 2006 )

(Click in the middle of the image to enlarge)

Please use the following short url to reference this page:



The design and analysis of algorithms is a fundamental area in computer science. This also involves the development of suitable methods for structuring the data to be manipulated by these algorithms. Hence, algorithms and data structures form a unit, and the right choice of algorithms and data structures is a crucial step in the solution of many problems. For this reason, the design, analysis and implementation of data structures form a classical field of computer science that continues to spawn exciting new research problems.

The Dagstuhl Seminar on Data Structures in 2006 reported on ongoing research on classical data structuring problems as well as application areas such as text retreival and computational geometry. Persistent themes include randomized, cache-oblivious, and succinct data structures. Dagstuhl meetings have played an important role in developing these themes over the past decade.

As in previous meetings, there was some shift of interest away from purely theoretical issues (asymptotic analysis) towards scientific studies that are directly relevant to the use of data structures in practical applications. This shift is motivated by the desire of increasing numbers of researchers in the field to make their results available in form of programs or software packages.

Interest in the topic remains high: another attendance record was set, and several invitees who could not attend expressed their sincere regrets and their strong desire to be invited to future meetings.

A last-minute call from the organizers asked participants to think about the following questions:
- What research problems are you working on lately?
- What critical roadblocks are you facing in addressing them?
- What is the most exciting outcome you could envision if successful?
- Why should anyone be interested in your results?
- What applications do you think are most in need of new research in data structures and algorithms?
- What problems do you think other people need to be working on?

Several of the presentations were provocative responses to these questions. Beyond the scientific talks, there was a particularly fruitful (and sometimes contentious!) session that centered on whether it might be fruitful to step back and gain consensus on significant open problems in the field whose solution would have important longterm impact. As the field has matured over the past 50 (!) years, careful examination of these sorts of issues is an important part of the research landscape.

We thank the team of Schloss Dagstuhl for their hospitality and support making this successful workshop possible.

  • Pankaj Kumar Agarwal (Duke University - Durham, US) [dblp]
  • Luca Allulli (Sapienza University of Rome, IT)
  • Lars Arge (Aarhus University, DK) [dblp]
  • Michael A. Bender (SUNY - Stony Brook, US) [dblp]
  • Norbert Blum (Universität Bonn, DE)
  • Ulrik Brandes (Universität Konstanz, DE) [dblp]
  • Gerth Stølting Brodal (Aarhus University, DK) [dblp]
  • Andrej Brodnik (University of Primorska, SI) [dblp]
  • Adam L. Buchsbaum (AT&T Labs Research - Florham Park, US)
  • Fabrizio d'Amore (Sapienza University of Rome, IT)
  • Mark de Berg (TU Eindhoven, NL) [dblp]
  • Frank Dehne (Carleton University - Ottawa, CA) [dblp]
  • Martin Dietzfelbinger (TU Ilmenau, DE) [dblp]
  • Faith Ellen (University of Toronto, CA) [dblp]
  • Jeff Erickson (University of Illinois - Urbana-Champaign, US) [dblp]
  • Thomas Erlebach (University of Leicester, GB) [dblp]
  • Rolf Fagerberg (University of Southern Denmark - Odense, DK) [dblp]
  • Rudolf Fleischer (Fudan University - Shanghai, CN) [dblp]
  • Paolo Franciosa (Sapienza University of Rome, IT)
  • Gudmund S. Frandsen (Aarhus University, DK)
  • Martin Fürer (Pennsylvania State University - University Park, US) [dblp]
  • Loukas Georgiadis (Aarhus University, DK) [dblp]
  • Torben Hagerup (Universität Augsburg, DE) [dblp]
  • Herman J. Haverkort (TU Eindhoven, NL) [dblp]
  • Riko Jacob (ETH Zürich, CH) [dblp]
  • Rolf Klein (Universität Bonn, DE) [dblp]
  • Moshe Lewenstein (Bar-Ilan University - Ramat Gan, IL) [dblp]
  • Alejandro Lopez-Ortiz (University of Waterloo, CA) [dblp]
  • Conrado Martinez (UPC - Barcelona, ES) [dblp]
  • Kurt Mehlhorn (MPI für Informatik - Saarbrücken, DE) [dblp]
  • Ulrich Carsten Meyer (MPI für Informatik - Saarbrücken, DE) [dblp]
  • Ian Munro (University of Waterloo, CA) [dblp]
  • Hartmut Noltemeier (Universität Würzburg, DE)
  • Anna Pagh (IT University of Copenhagen, DK)
  • Rasmus Pagh (IT University of Copenhagen, DK) [dblp]
  • Daniel Panario (Carleton University - Ottawa, CA) [dblp]
  • Seth Pettie (MPI für Informatik - Saarbrücken, DE) [dblp]
  • Rajeev Raman (University of Leicester, GB) [dblp]
  • Jörg-Rüdiger Sack (Carleton University - Ottawa, CA) [dblp]
  • Peter Sanders (KIT - Karlsruher Institut für Technologie, DE) [dblp]
  • Robert Sedgewick (Princeton University, US) [dblp]
  • Raimund Seidel (Universität des Saarlandes, DE) [dblp]
  • Michiel Smid (Carleton University - Ottawa, CA)
  • Kokichi Sugihara (University of Tokyo, JP)
  • Ralf Thöle (Universität Kiel, DE)
  • Laura I. Toma (Bowdoin College - Brunswick, US) [dblp]
  • Athanasios Tsakalidis (CTI & University of Patras, GR)
  • Jan Vahrenhold (Universität Münster, DE) [dblp]
  • Dorothea Wagner (KIT - Karlsruher Institut für Technologie, DE) [dblp]
  • Ingo Wegener (TU Dortmund, DE)
  • Norbert Zeh (Dalhousie University, CA) [dblp]

Related Seminars
  • Dagstuhl Seminar 9145: Data Structures (1991-11-04 - 1991-11-08) (Details)
  • Dagstuhl Seminar 9409: Data Structures (1994-02-28 - 1994-03-04) (Details)
  • Dagstuhl Seminar 9609: Data Structures (1996-02-26 - 1996-03-01) (Details)
  • Dagstuhl Seminar 98091: Data Structures (1998-03-02 - 1998-03-06) (Details)
  • Dagstuhl Seminar 00091: Data Structures (2000-02-27 - 2000-03-03) (Details)
  • Dagstuhl Seminar 02091: Data Structures (2002-02-24 - 2002-03-01) (Details)
  • Dagstuhl Seminar 04091: Data Structures (2004-02-22 - 2004-02-27) (Details)
  • Dagstuhl Seminar 08081: Data Structures (2008-02-17 - 2008-02-22) (Details)
  • Dagstuhl Seminar 10091: Data Structures (2010-02-28 - 2010-03-05) (Details)
  • Dagstuhl Seminar 14091: Data Structures and Advanced Models of Computation on Big Data (2014-02-23 - 2014-02-28) (Details)
  • Dagstuhl Seminar 16101: Data Structures and Advanced Models of Computation on Big Data (2016-03-06 - 2016-03-11) (Details)
  • Dagstuhl Seminar 19051: Data Structures for the Cloud and External Memory Data (2019-01-27 - 2019-02-01) (Details)
  • Dagstuhl Seminar 21071: Scalable Data Structures (2021-02-14 - 2021-02-19) (Details)
  • Dagstuhl Seminar 23211: Scalable Data Structures (2023-05-21 - 2023-05-26) (Details)

  • data bases / information retrieval
  • data structures / algorithms / complexity
  • web
  • networks

  • data structures
  • algorithms
  • large data sets
  • external memory algorithms
  • streaming model