ENGLISH

STACS 2004: 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004. Proceedings

By Michel Habib (eds.) , Claire Kenyon (auth.) , Volker Diekert

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2004
ISBN
978-3-540-21236-2, 978-3-540-24749-4, 3-540-21236-1
DOI
10.1007/b96012
Language
english
Format
PDF
Filesize
6 MB (6631562 bytes)
Series
Lecture Notes in Computer Science 2996
Edition
1
Pages
660\674
Time added
2014-01-18 08:00:00
Computation by Abstract Devices; Data Structures;

Description

This book constitutes the refereed proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS 2004, held in Montpellier, France, in March 2004. The 54 revised full papers presented together with two invited contributions were carefully reviewed and selected from more than 200 submissions. The papers are organized in topical sections on structural complexity, graph algorithms, quantum computing, satisfiability - constraint satisfaction problems, scheduling, algorithms, networks, automata theory and words, path algorithms, cryptography, logic and formal languages, game theory and complexity, and algorithmic information.

Similar books