License: Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2008.1378
URN: urn:nbn:de:0030-drops-13780
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1378/
Go to the corresponding LIPIcs Volume Portal

Albers, Susanne ; Weil, Pascal

Abstracts Collection -- 25th International Symposium on Theoretical Aspects of Computer Science

pdf-format:
foo_1378.pdf (0.3 MB)

Abstract

The Symposium on Theoretical Aspects of Computer Science (STACS) is held alternately
in France and in Germany. The conference of February 21-23, 2008, held in Bordeaux,
is the 25th in this series. Previous meetings took place in Paris (1984), Saarbr\"{u}cken (1985),
Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg
(1991), Cachan (1992), W\"{u}rzburg 1993), Caen (1994), M\"{u}nchen (1995), Grenoble (1996),
L\"{u}beck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002),
Berlin (2003), Montpellier (2004), Stuttgart (2005), Marseille (2006) and Aachen (2007).

BibTeX - Entry

@InProceedings{albers_et_al:LIPIcs:2008:1378,
  author =	{Susanne Albers and Pascal Weil},
  title =	{{Abstracts Collection -- 25th International Symposium on Theoretical Aspects of Computer Science}},
  booktitle =	{25th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{1--28},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-06-4},
  ISSN =	{1868-8969},
  year =	{2008},
  volume =	{1},
  editor =	{Susanne Albers and Pascal Weil},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2008/1378},
  URN =		{urn:nbn:de:0030-drops-13780},
  doi =		{10.4230/LIPIcs.STACS.2008.1378},
  annote =	{Keywords: Symposium, theoretical computer science, algorithms and data structures, automata and formal languages, computational and structural complexity, }
}

Keywords: Symposium, theoretical computer science, algorithms and data structures, automata and formal languages, computational and structural complexity,
Freie Schlagwörter (englisch): logic in computer science, applications
Collection: 25th International Symposium on Theoretical Aspects of Computer Science
Issue Date: 2008
Date of publication: 11.02.2008

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI