Dagstuhl

Last updated
Aerial view of Dagstuhl Castle. Luftbild Ensemble Schloss Dagstuhl.jpg
Aerial view of Dagstuhl Castle.
Schloss Dagstuhl's original buildings. Dagstuhl DSC02285.jpg
Schloss Dagstuhl's original buildings.
The new extension at Dagstuhl. Dagstuhl-20051211-03.jpg
The new extension at Dagstuhl.
The chapel at Schloss Dagstuhl. Dagstuhl chapel DSC02388.jpg
The chapel at Schloss Dagstuhl.

Dagstuhl is a computer science research center in Germany, located in and named after a district of the town of Wadern, Merzig-Wadern, Saarland.

Contents

Location

Following the model of the mathematical center at Oberwolfach, the center is installed in a very remote and relaxed location in the countryside. The Leibniz Center is located in a historic country house, Schloss Dagstuhl (Dagstuhl Castle), together with modern purpose-built buildings connected by an enclosed footbridge. [1]

The ruins of the 13th-century Dagstuhl Castle are nearby, a short walk up a hill from the Schloss.

History

The Leibniz-Zentrum für Informatik (LZI, Leibniz Center for Informatics) was established at Dagstuhl in 1990. In 1993, the over 200-year-old building received a modern extension with other guest rooms, conference rooms and a library. The center is managed as a non-profit organization, and financed by national funds. It receives scientific support by a variety of German and foreign research institutions. Until April 2008 the name of the center was: International Conference and Research Center for Computer Science (German: Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI)). The center was founded by Reinhard Wilhelm, who continued as its director until May 2014, when Raimund Seidel became the director. [2] The list of shareholders includes:

In 2012, another new building was opened with 7 guest rooms. Since 1 January 2005, the LZI is a member of the Leibniz Association.

Library

Dagstuhl's computer science library has over 50,000 books and other media, among them a full set of Springer-Verlag's Lecture Notes in Computer Science (LNCS) series and electronic access to many computer science journals. [3]

Seminar series

Dagstuhl supports computer science by organizing high ranked seminars on hot topics in informatics. Dagstuhl Seminars, which are established after review and approval by the Scientific Directorate, bring together personally invited scientists from academia and industry from all over the world to discuss their newest ideas and problems. [4] [5] Apart from the Dagstuhl seminars, the center also hosts summer schools, group retreats, and other scientific events, all discussing informatics. Every year about 3,500 scientists stay in Dagstuhl for about 100 seminars, workshops and other scientific events. The number of participants is limited to enable discussion and by the available housing capacity. The stay is full-board; participants are accommodated in the original house or in the modern annex, and have all their meals at the center. Seminars are usually held for a weekly period: participants arrive on Sunday evening and depart on Friday evening or Saturday morning. One or sometimes two seminars are held simultaneously with other small meetings.

The cryptographic technique DP5 (Dagstuhl Privacy Preserving Presence Protocol P) is named after Schloss Dagstuhl.

Publications

As well as publishing proceedings from its own seminars, the Leibniz Center publishes the Leibniz International Proceedings in Informatics (LIPIcs), [6] a series of open access conference proceedings from computer science conferences worldwide. Conferences published in this series include the Symposium on Theoretical Aspects of Computer Science (STACS), held annually in Germany and France, the conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), held annually in south Asia, the Computational Complexity Conference (CCC), held at a different international venue each year, the Symposium on Computational Geometry (SoCG), the International Colloquium on Automata, Languages and Programming (ICALP), the International Symposium on Mathematical Foundations of Computer Science (MFCS), the International Conference on Concurrency Theory (CONCUR), and the Conference on Database Theory. [7]

See also

Related Research Articles

<span class="mw-page-title-main">DBLP</span> Computer science bibliography website

DBLP is a computer science bibliography website. Starting in 1993 at Universität Trier in Germany, it grew from a small collection of HTML files and became an organization hosting a database and logic programming bibliography site. Since November 2018, DBLP is a branch of Schloss Dagstuhl – Leibniz-Zentrum für Informatik (LZI). DBLP listed more than 5.4 million journal articles, conference papers, and other publications on computer science in December 2020, up from about 14,000 in 1995 and 3.66 million in July 2016. All important journals on computer science are tracked. Proceedings papers of many conferences are also tracked. It is mirrored at three sites across the Internet.

The Max Planck Institute for Informatics is a research institute in computer science with a focus on algorithms and their applications in a broad sense. It hosts fundamental research as well a research for various application domains.

<span class="mw-page-title-main">Wadern</span> Town in Saarland, Germany

Wadern is a municipality in the federal state Saarland, which is situated in the southwest of Germany. It is part of the district Merzig-Wadern. Wadern consists of 13 urban districts with approximately 16.000 inhabitants. With 143 inhabitants per km2 it is sparsely populated, but, with an area of 111 km2, Wadern is the third largest municipality in Saarland after Saarbrücken and St. Wendel. The town is divided into 14 urban districts and altogether 24 villages belong to the commune. The town is part of the Moselle Franconian language area.

<span class="mw-page-title-main">Bitonic tour</span>

In computational geometry, a bitonic tour of a set of point sites in the Euclidean plane is a closed polygonal chain that has each site as one of its vertices, such that any vertical line crosses the chain at most twice.

The Symposium on Theoretical Aspects of Computer Science (STACS) is an academic conference in the field of computer science. It is held each year, alternately in Germany and France, since 1984. Typical themes of the conference include algorithms, computational and structural complexity, automata, formal languages and logic.

The European Symposium on Algorithms (ESA) is an international conference covering the field of algorithms. It has been held annually since 1993, typically in early Autumn in a different European location each year. Like most theoretical computer science conferences its contributions are strongly peer-reviewed; the articles appear in proceedings published in Springer Lecture Notes in Computer Science. Acceptance rate of ESA is 24% in 2012 in both Design and Analysis and Engineering and Applications tracks.

WADS, the Algorithms and Data Structures Symposium, is an international academic conference in the field of computer science, focusing on algorithms and data structures. WADS is held every second year, usually in Canada and always in North America. It is held in alternation with its sister conference, the Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), which is usually held in Scandinavia and always in Northern Europe. Historically, the proceedings of both conferences were published by Springer Verlag through their Lecture Notes in Computer Science series. Springer continues to publish WADS proceedings, but starting in 2016, SWAT proceedings are now published by Dagstuhl through their Leibniz International Proceedings in Informatics.

Susanne Boll is a Professor for Media Informatics and Multimedia Systems in the Department of Computing Science at the University of Oldenburg, Germany. and is a member of the board at the research institute OFFIS. She is a member of SIGMM and SIGCHI of the ACM as well as the German Informatics Society GI. She founded and directs the HCI Lab at the University of Oldenburg and OFFIS.

Raimund G. Seidel is a German and Austrian theoretical computer scientist and an expert in computational geometry.

<span class="mw-page-title-main">Reinhard Wilhelm</span> German computer scientist

Reinhard Wilhelm is a German computer scientist.

The German Informatics Society (GI) is a German professional society for computer science, with around 20,000 personal and 250 corporate members. It is the biggest organized representation of its kind in the German-speaking world.

Dorothea Wagner is a German computer scientist, known for her research in graph drawing, route planning, and social network analysis. She heads the Institute of Theoretical Informatics at the Karlsruhe Institute of Technology.

<span class="mw-page-title-main">Thomas Lengauer</span>

Thomas Lengauer is a German computer scientist and computational biologist.

The International Conference on Concurrency Theory (CONCUR) is an academic conference in the field of computer science, with focus on the theory of concurrency and its applications. It is the flagship conference for concurrency theory according to the International Federation for Information Processing Working Group on Concurrency Theory. The conference is organised annually since 1988. Since 2015, papers presented at CONCUR are published in the LIPIcs–Leibniz International Proceedings in Informatics, a "series of high-quality conference proceedings across all fields in informatics established in cooperation with Schloss Dagstuhl –Leibniz Center for Informatics". Before, CONCUR papers were published in the series Lecture Notes in Computer Science.

Multitier programming is a programming paradigm for distributed software, which typically follows a multitier architecture, physically separating different functional aspects of the software into different tiers. Multitier programming allows functionalities that span multiple of such tiers to be developed in a single compilation unit using a single programming language. Without multitier programming, tiers are developed using different languages, e.g., JavaScript for the Web client, PHP for the Web server and SQL for the database. Multitier programming is often integrated into general-purpose languages by extending them with support for distribution.

The International Symposium on Experimental Algorithms (SEA), previously known as Workshop on Experimental Algorithms (WEA), is a computer science conference in the area of algorithm engineering.

AofA, the International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms is an academic meeting that has been held regularly since 1993 in the field of computer science, focusing on mathematical methods from analytic combinatorics and probability for the study of properties of algorithms and large combinatorial structures. In early years, different formal names were used, but the meeting and associated community of researchers has always been known as AofA.

In computer science, choreographic programming is a programming paradigm where programs are compositions of interactions among multiple concurrent participants.

Antonio Lieto is an Italian cognitive scientist and computer scientist at the University of Turin and a Research Associate at the Institute of High Performance Computing of the Italian National Research Council focusing on cognitive architectures and computational models of cognition, commonsense reasoning and models of mental representation, and persuasive technologies. He teaches Artificial Intelligence and "Design and Evaluation of Cognitive Artificial Systems" at the Department of Computer Science of the University of Turin.

The twin-width of an undirected graph is a natural number associated with the graph, used to study the parameterized complexity of graph algorithms. Intuitively, it measures how similar the graph is to a cograph, a type of graph that can be reduced to a single vertex by repeatedly merging together twins, vertices that have the same neighbors. The twin-width is defined from a sequence of repeated mergers where the vertices are not required to be twins, but have nearly equal sets of neighbors.

References

  1. Schloss Dagstuhl, Sightseeing with Google Satellite Maps.
  2. Internationally renowned informatics center names new Scientific Director, Schloss Dagstuhl, March 30, 2014, retrieved 2014-05-06.
  3. Dagstuhl Library, Schloss Dagstuhl, Germany.
  4. Dagstuhl Seminar Proceedings, DBLP.
  5. "Dagstuhl Reports".
  6. LIPics: Leibniz International Proceedings in Informatics, retrieved 2011-09-11.
  7. "Portal - CONCUR 2018". drops.dagstuhl.de. Retrieved 2019-02-03.

49°31′49″N6°53′57″E / 49.53028°N 6.89917°E / 49.53028; 6.89917