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=Theory of Computing Systems AND YEAR=1997
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Practical constructive schemes for deterministic shared-memory access
A. Pietracaprina
,
F.P. Preparata
Theory of Computing Systems
30
(1), 1997, pp. 3-37
New graph decompositions with applications to emulations
C. Kaklamanis
,
D. Krizanc
,
S. Rao
Theory of Computing Systems
30
(1), 1997, pp. 39-49
Graph embeddings and simplicial maps
L.S. Heath
Theory of Computing Systems
30
(1), 1997, pp. 51-65
Approximation algorithms for the bandwidth minimization problem for a large class of trees
J. Haralambides
,
F. Makedon
Theory of Computing Systems
30
(1), 1997, pp. 67-90
Multihead two-way probabilistic finite automata
I.I. Macarie
Theory of Computing Systems
30
(1), 1997, pp. 91-109
On covering problems of codes
M. Frances
,
A. Litman
Theory of Computing Systems
30
(2), 1997, pp. 113-119
Regular languages and Stone duality
N. Pippenger
Theory of Computing Systems
30
(2), 1997, pp. 121-134
On sets Turing reducible to
p
-selective sets
H.-J. Burtschick
,
W. Lindner
Theory of Computing Systems
30
(2), 1997, pp. 135-143
Wang tilings and distributed verification on anonymous torus networks
V.R. Syrotiuk
,
C.J. Colbourn
,
J. Pachl
Theory of Computing Systems
30
(2), 1997, pp. 145-163
Helping by unambiguous computation and probabilistic computation
P. Cintioli
,
R. Silvestri
Theory of Computing Systems
30
(2), 1997, pp. 165-180
Approximation algorithms for DNF under distributions with limited independence
Kazuyuki Amano
,
Akira Maruoka
Theory of Computing Systems
30
(2), 1997, pp. 181-196
On the Cobham-Semenov theorem
F. Point
,
V. Bruyère
Theory of Computing Systems
30
(2), 1997, pp. 197-220
Reaction-diffusion automata: Three states implies universality
E. Goles
,
M. Matamala
Theory of Computing Systems
30
(3), 1997, pp. 223-229
The complexity of deterministic PRAM simulation on distributed memory machines
A. Pietracaprina
,
G. Pucci
Theory of Computing Systems
30
(3), 1997, pp. 231-247
A characterization and nearly linear-time equivalence test for
\mu
-branching programs
V. Raghavan
,
D. Wilkins
Theory of Computing Systems
30
(3), 1997, pp. 249-283
Automatic maps in exotic numeration systems
J.-P. Allouche
,
E. Cateland
,
W.J. Gilbert
,
H.-O. Peitgen
,
J.O. Shallit
,
G. Skordev
Theory of Computing Systems
30
(3), 1997, pp. 285-331
Monadic second-order definable text languages
H.J. Hoogeboom
,
P. ten Pas
Theory of Computing Systems
30
(4), 1997, pp. 335-354
Expressing uniformity via oracles
C. Damm
,
M. Holzer
,
P. Rossmanith
Theory of Computing Systems
30
(4), 1997, pp. 355-366
Diagonal polynomials and diagonal orders on multidimensional lattices
L.B. Morales
Theory of Computing Systems
30
(4), 1997, pp. 367-382
Polynomial closure and unambiguous product
J.-E. Pin
,
P. Weil
Theory of Computing Systems
30
(4), 1997, pp. 383-422
Complexity of Presburger arithmetic with fixed quantifier dimension
U. Schöning
Theory of Computing Systems
30
(4), 1997, pp. 423-428
Observations on measure and lowness for
\Delta^P_2
J.H. Lutz
Theory of Computing Systems
30
(4), 1997, pp. 429-442
The use of a synchronizer yields the maximm computation rate in distributed networks
S. Even
,
S. Rajsbaum
Theory of Computing Systems
30
(5), 1997, pp. 447-474
Deciding a class of path formulas for conflict-free Petri nets
Yen Hsu-Chun
,
Bow-Yaw Wang
,
Ming-Sheng Yang
Theory of Computing Systems
30
(5), 1997, pp. 475-494
A reducibility concept for problems defined in terms of ordered binary decision diagrams
Ch. Meinel
,
A. Slobodová
Theory of Computing Systems
30
(5), 1997, pp. 495-518
Seiten 1
2
>