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 Volume=34
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On recognizing a string on an anonymous ring
E. Kranakis
,
D. Krizanc
,
F.L. Luccio
Theory of Computing Systems
34
(1), 2001, pp. 3-12
Sharing resources at nonuniform access rates
V.C. Barbosa
,
M.R.F. Benevides
,
F.M.G. França
Theory of Computing Systems
34
(1), 2001, pp. 13-26
Numeration systems on a regular language
P.B.A. Lecomte
,
M. Rigo
Theory of Computing Systems
34
(1), 2001, pp. 27-44
The universality of higher-order attributed tree transducers
T. Noll
,
H. Vogler
Theory of Computing Systems
34
(1), 2001, pp. 45-75
Analyses of load stealing models based on families of differential equations
M. Mitzenmacher
Theory of Computing Systems
34
(1), 2001, pp. 77-98
A framework for simple sorting algorithms on parallel disk systems
S. Rajasekaran
Theory of Computing Systems
34
(2), 2001, pp. 101-114
Thread scheduling for multiprogrammed multiprocessors
N.S. Arora
,
R.D. Blumofe
,
C.G. Plaxton
Theory of Computing Systems
34
(2), 2001, pp. 115-144
Blocking in parallel multisearch problems
W. Dittrich
,
D.A. Hutchinson
,
A. Maheshwari
Theory of Computing Systems
34
(2), 2001, pp. 145-189
Decidability equivalence between the star problem and the finite power problem in trace monoids
D. Kirsten
,
G. Richomme
Theory of Computing Systems
34
(3), 2001, pp. 193-227
An improved stability bound for binary exponential backoff
H. Al-Ammal
,
L.A. Goldberg
,
P. MacKenzie
Theory of Computing Systems
34
(3), 2001, pp. 229-244
Distributionally hard languages
L. Fortnow
,
A. Pavan
,
A.L. Selman
Theory of Computing Systems
34
(3), 2001, pp. 245-261
A polynomial bound for certain cases of the D0L sequence equivalence problem
J. Honkala
Theory of Computing Systems
34
(3), 2001, pp. 263-272
Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search
P. de la Torre
,
C.P. Kruskal
Theory of Computing Systems
34
(4), 2001, pp. 275-298
An internal presentation of regular graphs by prefix-recognizable graphs
D. Caucal
,
T. Knapik
Theory of Computing Systems
34
(4), 2001, pp. 299-336
Computing the optimal bridge between two polygons
Sung Kwon Kim
,
Chan-Su Shin
Theory of Computing Systems
34
(4), 2001, pp. 337-352
A polynomial-time algorithm for max-min partitioning of ladders
R. Becker
,
I. Lari
,
M. Lucertini
,
B. Simeone
Theory of Computing Systems
34
(4), 2001, pp. 353-374
Special factors and uniqueness conditions in rational trees
A. Carpi
,
A. de Luca
,
S. Varricchio
Theory of Computing Systems
34
(4), 2001, pp. 375-395
One-to-many embeddings of hypercubes into Cayley graphs generated by reversals
L. Gardner
,
Z. Miller
,
D. Pritikin
,
I.H. Sudborough
Theory of Computing Systems
34
(5), 2001, pp. 399-431
Decision problems and round-off machines
F. Cucker
,
J.-P. Dedieu
Theory of Computing Systems
34
(5), 2001, pp. 433-452
Deterministic and randomized algorithms for distributed on-line task assignment and load balancing without load status information
K. Li
Theory of Computing Systems
34
(5), 2001, pp. 453-469
The satisfiability problem for probabilistic ordered branching programs
M. Agrawal
,
T. Thierauf
Theory of Computing Systems
34
(5), 2001, pp. 471-487
On the bisection width and expansion of butterfly networks
C.F. Bornstein
,
A. Litman
,
B.M. Maggs
,
R.K. Sitaraman
,
T. Yatzkar
Theory of Computing Systems
34
(6), 2001, pp. 491-518
A wait-free sorting algorithm
N. Shavit
,
E. Upfal
,
A. Zemach
Theory of Computing Systems
34
(6), 2001, pp. 519-544
Directed graphs and substitutions
C. Holton
,
L.Q. Zamboni
Theory of Computing Systems
34
(6), 2001, pp. 545-564
Pursuit and evasion on a ring: An infinite hierarchy for parallel real-time systems
S.D. Bruda
,
S.G. Akl
Theory of Computing Systems
34
(6), 2001, pp. 565-576