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=163
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Basic notions of universal algebra for language theory and graph grammars
Bruno Courcelle
Theoretical Computer Science
163
(1-2), 1996, pp. 1-54
Free shuffle algebras in language varieties
Stephen L. Bloom
,
Zoltán Ésik
Theoretical Computer Science
163
(1-2), 1996, pp. 55-98
Games for the
\mu
-calculus
Damian Niwiński
,
Igor Walukiewicz
Theoretical Computer Science
163
(1-2), 1996, pp. 99-116
How the character comparison order shapes the shift function of on-line pattern matching algorithms
Livio Colussi
,
Laura Toniolo
Theoretical Computer Science
163
(1-2), 1996, pp. 117-144
A three-word code which is not prefix-suffix composed
Denis Derencourt
Theoretical Computer Science
163
(1-2), 1996, pp. 145-160
A framework for a theory of automated learning
E. Hausen-Tropper
Theoretical Computer Science
163
(1-2), 1996, pp. 161-176
Frequency computation and bounded queries
Richard Beigel
,
William Gasarch
,
Efim Kinber
Theoretical Computer Science
163
(1-2), 1996, pp. 177-192
On the vector space of the automatic reals
Siegfried Lehr
,
Jeffrey Shallit
,
John Tromp
Theoretical Computer Science
163
(1-2), 1996, pp. 193-210
Exploiting few inversions when sorting: Sequential and parallel algorithms
Christos Levcopoulos
,
Ola Petersson
Theoretical Computer Science
163
(1-2), 1996, pp. 211-238
Optimal Heapsort algorithm
Xunrang Gu
,
Yuzhang Zhu
Theoretical Computer Science
163
(1-2), 1996, pp. 239-243
Recursion theoretic characterizations of complexity classes of counting functions
Heribert Vollmer
,
Klaus W. Wagner
Theoretical Computer Science
163
(1-2), 1996, pp. 245-258
On group codes
Dongyang Long
Theoretical Computer Science
163
(1-2), 1996, pp. 259-267
Computing minimum with primitive recursion over lists
Daniel Fredholm
Theoretical Computer Science
163
(1-2), 1996, pp. 269-276
A shrinking lemma for indexed languages
Robert H. Gilman
Theoretical Computer Science
163
(1-2), 1996, pp. 277-281
On a small class of Boolean sums
Tatsuie Tsukiji
Theoretical Computer Science
163
(1-2), 1996, pp. 283-289
Dynamical behaviour of Coven's aperiodic cellular automata
F. Blanchard
,
A. Maass
Theoretical Computer Science
163
(1-2), 1996, pp. 291-302
There is no local characterization of separating and thin objects in
Z^3
Rémy Malgouyres
Theoretical Computer Science
163
(1-2), 1996, pp. 303-308
Regular expression for a language without empty word
Djelloul Ziadi
Theoretical Computer Science
163
(1-2), 1996, pp. 309-315