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=270
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Operations and language generating devices suggested by the genome evolution
Jürgen Dassow
,
Victor Mitrana
,
Arto Salomaa
Theoretical Computer Science
270
(1-2), 2002, pp. 701-738
Probabilistic rebound Turing machines
Lan Zhang
,
Katsushi Inoue
,
Akira Ito
,
Yue Wang
Theoretical Computer Science
270
(1-2), 2002, pp. 739-760
Computing LOGCFL certificates
Georg Gottlob
,
Nicola Leone
,
Francesco Scarcello
Theoretical Computer Science
270
(1-2), 2002, pp. 761-777
Membrane systems with carriers
Carlos Martín-Vide
,
Gheorghe Păun
,
Grzegorz Rozenberg
Theoretical Computer Science
270
(1-2), 2002, pp. 779-796
Constructible functions in cellular automata and their applications to hierarchy results
Chuzo Iwamoto
,
Tomonobu Hatsuyama
,
Kenichi Morita
,
Katsunobu Imai
Theoretical Computer Science
270
(1-2), 2002, pp. 797-809
Threshold counters with increments and decrements
Costas Busch
,
Neophytos Demetriou
,
Maurice Herlihy
,
Marios Mavronicolas
Theoretical Computer Science
270
(1-2), 2002, pp. 811-826
The structure of a linear chip firing game and related models
Eric Goles
,
Michel Morvan
,
Ha Duong Phan
Theoretical Computer Science
270
(1-2), 2002, pp. 827-841
Simple and flexible detection of contiguous repeats using a suffix tree
Jens Stoye
,
Dan Gusfield
Theoretical Computer Science
270
(1-2), 2002, pp. 843-856
The rectangle complexity of functions on two-dimensional lattices
J.W. Sander
,
R. Tijdeman
Theoretical Computer Science
270
(1-2), 2002, pp. 857-863
The accelerated
k
-in-a-row game
András Pluhár
Theoretical Computer Science
270
(1-2), 2002, pp. 865-875
Least adaptive optimal search with unreliable tests
Ferdinando Cicalese
,
Daniele Mundici
,
Ugo Vaccaro
Theoretical Computer Science
270
(1-2), 2002, pp. 877-893
Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants''
Gary William Flake
,
Eric B. Baum
Theoretical Computer Science
270
(1-2), 2002, pp. 895-911
The variance of the height of binary search trees
Michael Drmota
Theoretical Computer Science
270
(1-2), 2002, pp. 913-919
On canonical number systems
Shigeki Akiyama
,
Attila Pethŏ
Theoretical Computer Science
270
(1-2), 2002, pp. 921-933
Compact factors of countable state Markov shifts
Doris Fiebig
,
Ulf-Rainer Fiebig
Theoretical Computer Science
270
(1-2), 2002, pp. 935-946
An example of a computable absolutely normal number
Verónica Becher
,
Santiago Figueira
Theoretical Computer Science
270
(1-2), 2002, pp. 947-958
A pumping lemma for random permitting context languages
Sigrid Ewert
,
Andries van der Walt
Theoretical Computer Science
270
(1-2), 2002, pp. 959-967
Two undecidability results for chain code picture languages
Changwook Kim
Theoretical Computer Science
270
(1-2), 2002, pp. 969-976
Seiten
<
1
2