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=132
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A calculus for the random generation of labelled combinatorial structures
Philippe Flajolet
,
Paul Zimmerman
,
Bernard van Cutsem
Theoretical Computer Science
132
(1-2), 1994, pp. 1-35
Computational depth and reducibility
David W. Juedes
,
James I. Lathrop
,
Jack H. Lutz
Theoretical Computer Science
132
(1-2), 1994, pp. 37-70
Unrestricted complementation in language equations over a one-letter alphabet
E.L. Leiss
Theoretical Computer Science
132
(1-2), 1994, pp. 71-84
Retreat bounded picture languages
Changwook Kim
Theoretical Computer Science
132
(1-2), 1994, pp. 85-112
Computability with low-dimensional dynamical systems
Pascal Koiran
,
Michel Cosnard
,
Max Garzon
Theoretical Computer Science
132
(1-2), 1994, pp. 113-128
On language equations with invertible operations
Lila Kari
Theoretical Computer Science
132
(1-2), 1994, pp. 129-150
Primitive 2-structures with the
(n-2)
-property
Paola Bonizzoni
Theoretical Computer Science
132
(1-2), 1994, pp. 151-178
Asynchronous automata versus asynchronous cellular automata
Giovanni Pighizzini
Theoretical Computer Science
132
(1-2), 1994, pp. 179-207
A
k
-structure generalization of the theory of 2-structures
A. Ehrenfeucht
,
R. McConnell
Theoretical Computer Science
132
(1-2), 1994, pp. 209-227
Minimal pairs and complete problems
Klaus Ambos-Spies
,
Steven Homer
,
Robert I. Soare
Theoretical Computer Science
132
(1-2), 1994, pp. 229-241
Formal languages defined by uniform substitutions
Jean-Camille Birget
,
Joseph B. Stephen
Theoretical Computer Science
132
(1-2), 1994, pp. 243-258
One-way cellular automata on Cayley graphs
Zsuzsanna Róka
Theoretical Computer Science
132
(1-2), 1994, pp. 259-290
The knowledge complexity of quadratic residuosity languages
Alfredo de Santis
,
Giovanni di Crescenzo
,
Guiseppe Persiano
Theoretical Computer Science
132
(1-2), 1994, pp. 291-317
Deterministic versus nondeterministic space in terms of synchronized alternating machines
Juraj Hromkovic̑
,
Branislav Rovan
,
Anna Slobodova
Theoretical Computer Science
132
(1-2), 1994, pp. 319-336
Domination games on infinite graphs
R. Diestel
,
I. Leader
Theoretical Computer Science
132
(1-2), 1994, pp. 337-345
Generating Hamiltonian circuits without backtracking from errors
Jefferey A. Shufelt
,
Hans J. Berliner
Theoretical Computer Science
132
(1-2), 1994, pp. 347-375
Unit-cost pointers versus logarithmic-cost addresses
Amir M. Ben-Amram
Theoretical Computer Science
132
(1-2), 1994, pp. 377-385
On recursive bounds for the exceptional values in speed-up
Douglas Bridges
,
Cristian Calude
Theoretical Computer Science
132
(1-2), 1994, pp. 387-394
On termination of one rule rewrite systems
Pierre Lescanne
Theoretical Computer Science
132
(1-2), 1994, pp. 395-401
On two-dimensional pattern matching by optimal parallel algorithms
Maxime Crochemore
,
Wojciech Rytter
Theoretical Computer Science
132
(1-2), 1994, pp. 403-414
Average cost of Duval's algorithm for generating Lyndon words
J. Berstel
,
M. Pocchiola
Theoretical Computer Science
132
(1-2), 1994, pp. 415-425
On a conjecture about slender context-free languages
Lucian Ilie
Theoretical Computer Science
132
(1-2), 1994, pp. 427-434
A note on the density of oracle decreasing time-space complexity
Pavol Dúris̑
,
José D.P. Rolim
Theoretical Computer Science
132
(1-2), 1994, pp. 435-444