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=148
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the fragmentary complexity of symbolic sequences
P. Diamond
,
P. Kloeden
,
V. Kozyakin
,
A. Pokrovskii
Theoretical Computer Science
148
(1), 1995, pp. 1-17
A random
NP
-complete problem for inversion of 2D cellular automata
Bruno Durand
Theoretical Computer Science
148
(1), 1995, pp. 19-32
On input read-modes of alternating Turing machines
Liming Cai
,
Jianer Chen
Theoretical Computer Science
148
(1), 1995, pp. 33-55
Using maximal independent sets to solve problems in parallel
Takayoshi Shoudai
,
Satoru Miyano
Theoretical Computer Science
148
(1), 1995, pp. 57-65
Extremal solutions of inequations over lattices with applications to supervisory control
Ratnesh Kumar
,
Vijay K. Garg
Theoretical Computer Science
148
(1), 1995, pp. 67-92
Restrictions of graph partition problems: Part I
Hans L. Bodlaender
,
Klaus Jansen
Theoretical Computer Science
148
(1), 1995, pp. 93-109
Superlinear period lengths in some subtraction games
Ingo Althöfer
,
Jörg Bültermann
Theoretical Computer Science
148
(1), 1995, pp. 111-119
An initial semantics for the
\mu
-calculus on trees and Rabin's complementation lemma
André Arnold
Theoretical Computer Science
148
(1), 1995, pp. 121-132
The fourth moment in Luby's distribution
Devdatt P. Dubhashi
,
Grammati E. Pantziou
,
Paul G. Spirakis
,
Christos D. Zaroliagis
Theoretical Computer Science
148
(1), 1995, pp. 133-140
On-line learning of smooth functions of a single variable
Don Kimber
,
Philip M. Long
Theoretical Computer Science
148
(1), 1995, pp. 141-156
Reversible simulation of one-dimensional irreversible cellular automata
Kenichi Morita
Theoretical Computer Science
148
(1), 1995, pp. 157-163
The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate
Uri Zwick
Theoretical Computer Science
148
(1), 1995, pp. 165-170
Parallel algorithms for priority queue operations
Maria Cristina Pinotti
,
Geppino Pucci
Theoretical Computer Science
148
(1), 1995, pp. 171-180
On adaptive DLOGTIME and POLYLOGTIME reductions
Carme Àlvarez
,
Birgit Jenner
Theoretical Computer Science
148
(2), 1995, pp. 183-205
On the acceptance power of regular languages
Bernd Borchert
Theoretical Computer Science
148
(2), 1995, pp. 207-225
On some decision problems for trace codings
Véronique Bruyère
,
Clelia de Felice
,
Giovanna Guaiana
Theoretical Computer Science
148
(2), 1995, pp. 227-260
Reachability and the power of local ordering
Kousha Etessami
,
Neil Immerman
Theoretical Computer Science
148
(2), 1995, pp. 261-279
Undecidability of bisimilarity for Petri nets and some related problems
Petr Janc̆ar
Theoretical Computer Science
148
(2), 1995, pp. 281-301
A hierarchy of temporal logics with past
F. Laroussinie
,
Ph. Schnoebelen
Theoretical Computer Science
148
(2), 1995, pp. 303-324
On quasilinear-time complexity theory
Ashish V. Naik
,
Kenneth W. Regan
,
D. Sivakumar
Theoretical Computer Science
148
(2), 1995, pp. 325-349