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=125
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The processor minimization problem with independent waiting-time constraints
E.G., Jr. Coffman
,
Leopold Flatto
,
Bjorn Poonen
,
Paul E. Wright
Theoretical Computer Science
125
(1), 1994, pp. 3-16
Optimization of static traffic allocation policies
M.B. Combé
,
O.J. Boxma
Theoretical Computer Science
125
(1), 1994, pp. 17-43
Computational complexity of loss networks
Graham Louth
,
Michael Mitzenmacher
,
Frank Kelly
Theoretical Computer Science
125
(1), 1994, pp. 45-59
Asymptotic analysis of product-form distributions related to large interconnection networks
Micha Hofri
,
Yaakov Kogan
Theoretical Computer Science
125
(1), 1994, pp. 61-90
Heterogeneous multiprocessor systems with breakdowns: Performance and optimal repair strategies
Ram Chakka
,
Isi Mitrani
Theoretical Computer Science
125
(1), 1994, pp. 91-109
Exact solutions for networks of queues with blocking-after-service
Ian F. Akyildiz
,
Horst von Brand
Theoretical Computer Science
125
(1), 1994, pp. 111-130
Virus tests to maximize availability of software systems
Erol Gelenbe
,
Marisela Hernández
Theoretical Computer Science
125
(1), 1994, pp. 131-147
Determining the exit time distribution for a closed cyclic network
François Baccelli
,
William A. Massey
,
Paul E. Wright
Theoretical Computer Science
125
(1), 1994, pp. 149-165
An extension of Kleene's and Ochmański's theorems to infinite traces
Paul Gastin
,
Antoine Petit
,
Wiesƚaw Zielonka
Theoretical Computer Science
125
(2), 1994, pp. 167-204
More on the complexity of common superstring and supersequence problems
Martin Middendorf
Theoretical Computer Science
125
(2), 1994, pp. 205-228
An algorithm for finding a shortest vector in a two-dimensional modular lattice
Mody Lempel
,
Azaria Paz
Theoretical Computer Science
125
(2), 1994, pp. 229-241
Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata
Tao Jiang
,
Oscar H. Ibarra
,
Hui Wang
Theoretical Computer Science
125
(2), 1994, pp. 243-257
Properties of grammatical codes of trees
A. Ehrenfeucht
,
P. ten Pas
,
G. Rozenberg
Theoretical Computer Science
125
(2), 1994, pp. 259-293
Nondeterministic circuits, space complexity and quasigroups
Marty J. Wolf
Theoretical Computer Science
125
(2), 1994, pp. 295-313
The state complexities of some basic operations on regular languages
Sheng Yu
,
Qingyu Zhuang
,
Kai Salomaa
Theoretical Computer Science
125
(2), 1994, pp. 315-328
Lyapunov operators to study the convergence of extremal automata
Eric Goles
Theoretical Computer Science
125
(2), 1994, pp. 329-337
A context-free language decision problem
B. Litow
Theoretical Computer Science
125
(2), 1994, pp. 339-343
Not all insertion methods yield constant approximate tours in the Euclidean plane
Vineet Bafna
,
Bala Kalyanasundaram
,
Kirk Pruhs
Theoretical Computer Science
125
(2), 1994, pp. 345-353
An inherently iterative algorithm for the Grzegorczyk hierarchy
Robert E. Matthews
Theoretical Computer Science
125
(2), 1994, pp. 355-360
Scattered deletion and commutativity
Alexandru Mateescu
Theoretical Computer Science
125
(2), 1994, pp. 361-371
The communication complexity of computing differentiable functions in a multicomputer network
Pengyuan Chen
Theoretical Computer Science
125
(2), 1994, pp. 373-383