14. STACS 1997: Lübeck, Germany
Rüdiger Reischuk, Michel Morvan (Eds.):
STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings.
Lecture Notes in Computer Science 1200 Springer 1997, ISBN 3-540-62616-6
Automata Theory I
Structural Complexity I
Specification and Verification
- Martin Dietzfelbinger:
Gossiping and Broadcasting versus Computing Functions in Networks.
- Stephan Waack:
On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams.
- Christoph Meinel, Anna Slobodová:
A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams.
Logic and Learning
Automata Theory II
Structural Complexity II
Complexity Theory I
Parallel and Distributed Systems I
Complexity Theory II
Parallel and Distributed Systems II
Complexity Theory III
- Eric Ruppert:
Finding the k Shortest Paths in Parallel.
- Elias Dahlhaus:
Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal Graphs.
Structural Complexity III
Automata Theory III
Last update Wed May 22 16:41:44 2013
CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page