Volume 250,
Number 1-2,
6 January 2001
- Maurice Nivat:
25 Years.
- Giorgio Ausiello, Donald Sannella, Michael W. Mislove:
25 Years.
- Ina Koch:
Enumerating all connected maximal common subgraphs in two graphs.
1-30
- Joanna Jedrzejowicz, Andrzej Szepietowski:
Shuffle languages are in P.
31-53
- Satoshi Okawa, Sadaki Hirose:
Homomorphic characterizations of recursively enumerable languages with very small language classes.
55-69
- Christophe Prieur:
How to decide continuity of rational functions on infinite words.
71-82
- Salvatore Caporaso, Michele Zito, Nicola Galesi:
A predicative and decidable characterization of the polynomial classes of languages.
83-99
- Wolfgang Merkle:
Structural properties of bounded relations with an application to NP optimization problems.
101-124
- Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle:
A practical algorithm for making filled graphs minimal.
125-141
- Giuseppe Ateniese, Carlo Blundo, Alfredo De Santis, Douglas R. Stinson:
Extended capabilities for visual cryptography.
143-161
- Valeria Mihalache, Arto Salomaa:
Language-theoretic aspects of DNA complematarity.
163-178
- Judit Bar-Ilan, Guy Kortsarz, David Peleg:
Generalized submodular cover problems and applications.
179-200
- Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio:
Semi-dynamic breadth-first search in digraphs.
201-217
- Zoltán Fülöp, Sándor Vágvölgyi:
Restricted ground tree transducers.
219-233
- Gerth Stølting Brodal, Maria Cristina Pinotti:
Comparator networks for binary heap construction.
235-245
- Changwook Kim:
Double Greibach operator grammars.
247-264
- Salah Labhalla, Henri Lombardi, E. Moutai:
Espaces métriques rationnellement présentés et complexité, le cas de l'espace des fonctions réelles uniformément continues sur un intervalle compact.
265-332
- Timo Knuutila:
Re-describing an algorithm by Hopcroft.
333-363
- Colin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas:
Automatic semigroups.
365-391
Copyright © Mon Nov 2 21:56:11 2009
by Michael Ley (ley@uni-trier.de)
