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=301
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On primitive recursive algorithms and the greatest common divisor function
Yiannis N. Moschovakis
Theoretical Computer Science
301
(1-3), 2003, pp. 1-30
On congruences of automata defined by directed graphs
A.V. Kelarev
,
O.V. Sokratova
Theoretical Computer Science
301
(1-3), 2003, pp. 31-43
Approximation of Boolean functions by combinatorial rectangles
Martin Sauerhoff
Theoretical Computer Science
301
(1-3), 2003, pp. 45-78
Undecidable properties of monoids with word problem solvable in linear time. Part II - Cross sections and homological and homotopical finiteness conditions
Masashi Katsura
,
Yuji Kobayashi
,
Friedrich Otto
Theoretical Computer Science
301
(1-3), 2003, pp. 79-101
Optimal insertion in deterministic DAWGs
Kyriakos N. Sgarbas
,
Nikos D. Fakotakis
,
George K. Kokkinakis
Theoretical Computer Science
301
(1-3), 2003, pp. 103-117
Architecture independent parallel selection with applications to parallel priority queues
Alexandros V. Gerbessiotis
,
Constantinos J. Siniolakis
Theoretical Computer Science
301
(1-3), 2003, pp. 119-142
Complexity in the case against accuracy estimation
Richard Nock
Theoretical Computer Science
301
(1-3), 2003, pp. 143-165
Two-dimensional cellular automata and deterministic on-line tessalation automata
Véronique Terrier
Theoretical Computer Science
301
(1-3), 2003, pp. 167-186
Watson-Crick D0L systems: The power of one transition
Arto Salomaa
,
Petr Sosík
Theoretical Computer Science
301
(1-3), 2003, pp. 187-200
On three variants of rewriting
P
systems
Claudio Ferretti
,
Giancarlo Mauri
,
Gheorghe Păun
,
Claudio Zandron
Theoretical Computer Science
301
(1-3), 2003, pp. 201-215
Ambiguity in omega context free languages
Olivier Finkel
Theoretical Computer Science
301
(1-3), 2003, pp. 217-270
Independent domination in finitely defined classes of graphs
R. Boliac
,
V. Lozin
Theoretical Computer Science
301
(1-3), 2003, pp. 271-284
The asymptotic distribution of elements in automatic sequences
Manfred Peter
Theoretical Computer Science
301
(1-3), 2003, pp. 285-312
A property of random context picture grammars
Andries van der Walt
,
Sigrid Ewert
Theoretical Computer Science
301
(1-3), 2003, pp. 313-320
Euclidean strings
John Ellis
,
Frank Ruskey
,
Joe Sawada
,
Jamie Simpson
Theoretical Computer Science
301
(1-3), 2003, pp. 321-340
On the sensitivity of additive cellular automata in Besicovitch topologies
Enrico Formenti
Theoretical Computer Science
301
(1-3), 2003, pp. 341-354
Computing on anonymous networks with sense of direction
Paola Flocchini
,
Alessandro Roncato
,
Nicola Santoro
Theoretical Computer Science
301
(1-3), 2003, pp. 355-379
Efficient minus and signed domination in graphs
Chin Lung Lu
,
Sheng-Lung Peng
,
Chuan Yi Tang
Theoretical Computer Science
301
(1-3), 2003, pp. 381-397
Completing comma-free codes
Nguyen Huong Lam
Theoretical Computer Science
301
(1-3), 2003, pp. 399-415
The multiplicative fragment of the Yanov equational theory
Igor Dolinka
Theoretical Computer Science
301
(1-3), 2003, pp. 417-425
Arborescence optimization problems solvable by Edmonds' algorithm
Leonidas Georgiadis
Theoretical Computer Science
301
(1-3), 2003, pp. 427-437
Asymptotic orbits of primitive substitutions
Marcy Barge
,
Beverly Diamond
,
Charles Holton
Theoretical Computer Science
301
(1-3), 2003, pp. 439-450
A family of NFAs which need
2^n - \alpha
deterministic states
Kazuo Iwama
,
Akihiro Matsuura
,
Mike Paterson
Theoretical Computer Science
301
(1-3), 2003, pp. 451-462
On stable cutsets in line graphs
Van Bang Le
,
Bert Randerath
Theoretical Computer Science
301
(1-3), 2003, pp. 463-475
A fast algorithm to generate necklaces with fixed content
Joe Sawada
Theoretical Computer Science
301
(1-3), 2003, pp. 477-489
Seiten 1
2
>