Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=250
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Enumerating all connected maximal common subgraphs in two graphs
Ina Koch
Theoretical Computer Science
250
(1-2), 2001, pp. 1-30
Schuffle languages are in
P
Joanna Jȩdrzjowicz
,
Andrzej Szepietowski
Theoretical Computer Science
250
(1-2), 2001, pp. 31-53
Homomorphic characterizations of recursively enumberable languages with very small language classes
Satoshi Okawa
,
Sadaki Hirose
Theoretical Computer Science
250
(1-2), 2001, pp. 55-69
How to decide continuity of rational functions on infinite words
Christophe Prieur
Theoretical Computer Science
250
(1-2), 2001, pp. 71-82
A predicative and decidable characterization of the polynomial classes of languages
S. Caporaso
,
M. Zito
,
N. Galesi
Theoretical Computer Science
250
(1-2), 2001, pp. 83-99
Structural properties of bounded relations with an application to
NP
optimization problems
Wolfgang Merkle
Theoretical Computer Science
250
(1-2), 2001, pp. 101-124
A practical algorithm for making filled graphs minimal
Jean R.S. Blair
,
Pinar Heggernes
,
Jan Arne Telle
Theoretical Computer Science
250
(1-2), 2001, pp. 125-141
Extended capabilities for visual cryptography
Giuseppe Ateniese
,
Carlo Blundo
,
Alfredo de Santis
Theoretical Computer Science
250
(1-2), 2001, pp. 143-161
Language-theoretic aspects of DNA complematarity
Valeria Mihalache
,
Arto Salomaa
Theoretical Computer Science
250
(1-2), 2001, pp. 163-178
Generalized submodular cover problems and applications
Judit Bar-Ilan
,
Guy Kortsarz
,
David Peleg
Theoretical Computer Science
250
(1-2), 2001, pp. 179-200
Semi-dynamic breadth-first search in digraphs
Paolo Giulio Franciosa
,
Daniele Frigioni
,
Roberto Giaccio
Theoretical Computer Science
250
(1-2), 2001, pp. 201-217
Restricted ground tree transducers
Z. Fülöp
,
S. Vágvölgyi
Theoretical Computer Science
250
(1-2), 2001, pp. 219-233
Comparator networks for binary heap construction
Gerth Stlting Brodal
,
M. Cristina Pinotti
Theoretical Computer Science
250
(1-2), 2001, pp. 235-245
Double Greibach operator grammars
Changwook Kim
Theoretical Computer Science
250
(1-2), 2001, pp. 247-264
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
S. Labhalla
,
H. Lombardi
,
E. Moutai
Theoretical Computer Science
250
(1-2), 2001, pp. 265-332
Re-describing an algorithm by Hopcroft
Timo Knuutila
Theoretical Computer Science
250
(1-2), 2001, pp. 333-363
Automatic semigroups
Colin M. Campbell
,
Edmund F. Robertson
,
Nikola Rus̑kuc
,
Richard M. Thomas
Theoretical Computer Science
250
(1-2), 2001, pp. 365-391