21. STACS 2004:
Montpellier,
France
Volker Diekert, Michel Habib (Eds.):
STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings.
Lecture Notes in Computer Science 2996 Springer 2004, ISBN 3-540-21236-1 BibTeX
@proceedings{DBLP:conf/stacs/2004,
editor = {Volker Diekert and
Michel Habib},
title = {STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer
Science, Montpellier, France, March 25-27, 2004, Proceedings},
booktitle = {STACS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2996},
year = {2004},
isbn = {3-540-21236-1},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Lectures
Structural Complexity (I)
Graph Algorithms (I)
Quantum Computations
- Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien:
Algebraic Results on Quantum Automata.
93-104
Electronic Edition (link) BibTeX
- Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra, Shigeru Yamashita:
Quantum Identification of Boolean Oracles.
105-116
Electronic Edition (link) BibTeX
Pattern Inference and Statistics
Satisfiability - Constraint Satisfaction Problem
Scheduling (I)
Algorithms
Networks (I)
Automata Theory and Words
Structural Complexity (II)
Path Algorithms
Cryptography
Networks (II)
Logic and Formal Languages
Graphs Algorithms (II)
Game Theory and Complexity
Networks (III)
Structural Complexity (III)
Scheduling (II)
Algorithmic Information
Errata
Copyright © Sat May 16 23:43:06 2009
by Michael Ley (ley@uni-trier.de)