23. MFCS 1998:
Brno,
Czech Republic
Lubos Brim, Jozef Gruska, Jirí Zlatuska (Eds.):
Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings.
Lecture Notes in Computer Science 1450 Springer 1998, ISBN 3-540-64827-5 BibTeX
Invited Papers
Complexity of Hard Problems
Logic - Semantics - Automata
Rewriting
Automata and Transducers
Typing
Concurrency - Semantics - Logic
Circuit Complexity
Programming
Structural Complexity
Formal Languages
Graphs and Hypergraphs
Turing Complexity and Logic
Binary Decision Diagrams
Combinatorics on Words
Trees and Embeddings
- Sergei L. Bezrukov, Joe D. Chavez, L. H. Harper, Markus Röttger, Ulf-Peter Schroeder:
Embedding of Hypercubes into Grids.
693-701
Electronic Edition (Springer LINK) BibTeX
- Hans L. Bodlaender, Torben Hagerup:
Tree Decompositions of Small Diameter.
702-712
Electronic Edition (Springer LINK) BibTeX
- Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra:
Degree-Preserving Forests.
713-721
Electronic Edition (Springer LINK) BibTeX
- Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders:
A Parallelization of Dijkstra's Shortest Path Algorithm.
722-731
Electronic Edition (Springer LINK) BibTeX
Picture Languages - Function Systems/Complexity
Communication - Computable Real Numbers
Cellular Automata
Copyright © Sat May 16 23:29:34 2009
by Michael Ley (ley@uni-trier.de)