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=1999
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Equational elements in additive algebras
S. Bozapalidis
Theory of Computing Systems
32
(1), 1999, pp. 1-33
Some bounds on the computational power of piecewise constant derivative systems
O. Bournez
Theory of Computing Systems
32
(1), 1999, pp. 35-67
DNA computing based on splicing: The existence of universal computers
R. Freund
,
L. Kari
,
Gh. Păun
Theory of Computing Systems
32
(1), 1999, pp. 69-112
On approximation properties of the independent set problem for low degree graphs
P. Berman
,
T. Fujito
Theory of Computing Systems
32
(2), 1999, pp. 115-132
Descendants of primitive substitutions
C. Holton
,
L.Q. Zamboni
Theory of Computing Systems
32
(2), 1999, pp. 133-157
A characterization of the sets of hypertrees generated by hyperedge-replacement graph grammars
F. Drewes
Theory of Computing Systems
32
(2), 1999, pp. 159-208
Pipelining with futures
G.E. Blelloch
,
M. Reid-Miller
Theory of Computing Systems
32
(3), 1999, pp. 213-239
Accessing nearby copies of replicated objects in a distributed environment
C.G. Plaxton
,
R. Rajaraman
,
A.W. Richa
Theory of Computing Systems
32
(3), 1999, pp. 241-280
Allocating weighted jobs in parallel
P. Berenbrink
,
F. Meyer auf der Heide
,
K. Schröder
Theory of Computing Systems
32
(3), 1999, pp. 281-300
Efficient detection of determinacy races in Cilk Programs
M. Feng
,
C.E. Leiserson
Theory of Computing Systems
32
(3), 1999, pp. 301-326
Can a shared-memory model serve as a bridging model for parallel computation?
P.B. Gibbons
,
Y. Matias
,
V. Ramachandran
Theory of Computing Systems
32
(3), 1999, pp. 327-359
On the analysis of randomized load balancing schemes
M. Mitzenmacher
Theory of Computing Systems
32
(3), 1999, pp. 361-386
Simple, efficient routing schemes for all-optical networks
M. Flammini
,
C. Scheideler
Theory of Computing Systems
32
, 1999, pp. 387-420
Zero-dimensional dynamical systems, formal languages, and universality
P. Ku̇rka
Theory of Computing Systems
32
(4), 1999, pp. 423-433
Bounding the expected length of longest common subsequences and forests
R.A. Baeza-Yates
,
R. Gavaldà
,
G. Navarro
,
R. Scheihing
Theory of Computing Systems
32
(4), 1999, pp. 435-452
Exponential sums and curcuits with a single threshold gate and mod-gates
F. Green
Theory of Computing Systems
32
(4), 1999, pp. 453-466
Integer linear programming and the analysis of some Petri net problems
H.-C. Yen
Theory of Computing Systems
32
(4), 1999, pp. 467-485
Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams
B. Bollig
,
I. Wegener
Theory of Computing Systems
32
(4), 1999, pp. 487-503
An isoperimetric problem in Cayley graphs
Y.O. Hamidoune
,
A.S. Lladó
,
O. Serra
Theory of Computing Systems
32
(5), 1999, pp. 507-516
Randomness, stochasticity, and approximations
Y. Wang
Theory of Computing Systems
32
(5), 1999, pp. 517-529
Processor-time tradeoffs under bounded-speed message propagation: Part II, lower bounds
G. Bilardi
,
F.P. Preparata
Theory of Computing Systems
32
(5), 1999, pp. 531-559
Flexible usage of redundancy in disk arrays
E.J. Schwabe
,
I.M. Sutherland
Theory of Computing Systems
32
(5), 1999, pp. 561-587
Optimal high-performance parallel text retrieval via fat-trees
B. Mamalis
,
P. Spirakis
,
B. Tampakas
Theory of Computing Systems
32
(6), 1999, pp. 591-623
Robust reductions
J.-Y. Cai
,
L.A. Hemaspaandra
,
G. Wechsung
Theory of Computing Systems
32
(6), 1999, pp. 625-647
A characterization of attributed tree transformations by a subclass of macro tree transducers
Z. Fülöp
,
H. Vogler
Theory of Computing Systems
32
(6), 1999, pp. 649-676