Ebook: STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006. Proceedings
- Genre: Computers
- Tags: Computation by Abstract Devices, Algorithm Analysis and Problem Complexity, Logics and Meanings of Programs, Mathematical Logic and Formal Languages, Data Structures, Discrete Mathematics in Computer Science
- Series: Lecture Notes in Computer Science 3884 : Theoretical Computer Science and General Issues
- Year: 2006
- Publisher: Springer-Verlag Berlin Heidelberg
- Edition: 1
- Language: English
- pdf
This book constitutes the refereed proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2006, held in Marseille, France, in February 2006.
The 54 revised full papers presented together with three invited papers were carefully reviewed and selected from 283 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, semantics, logic in computer science, as well as current challenges like biological computing, quantum computing, and mobile and net computing.
This book constitutes the refereed proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science, STACS 2006, held in Marseille, France, in February 2006.
The 54 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 283 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, semantics, logic in computer science, as well as current challenges like biological computing, quantum computing, and mobile and net computing.