23. MFCS 1998: Brno, Czech Republic

Refine list

showing all ?? records

Invited Papers

Complexity of Hard Problems

Logic - Semantics - Automata


Automata and Transducers


Concurrency - Semantics - Logic

Circuit Complexity


Structural Complexity

Formal Languages

Graphs and Hypergraphs

Turing Complexity and Logic

Binary Decision Diagrams

Combinatorics on Words

Trees and Embeddings

Picture Languages - Function Systems/Complexity

Communication - Computable Real Numbers

Cellular Automata

a service of  Schloss Dagstuhl - Leibniz Center for Informatics