


default search action
Theoretical Computer Science, Volume 125
Volume 125, Number 1, 14 March 1994
- Edward G. Coffman Jr., Leopold Flatto, Bjorn Poonen

, Paul E. Wright:
The Processor Minimization Problem with Independent Waiting-Time Constraints. 3-16 - M. B. Combé, Onno J. Boxma:

Optimization of Static Traffic Allocation Policies. 17-43 - Graham Louth, Michael Mitzenmacher, Frank Kelly:

Computational Complexity of Loss Networks. 45-59 - Micha Hofri, Yaakov Kogan:

Asymptotic Analysis of Product-Form Distributions Related to Large Interconnection Networks. 61-90 - Ram Chakka, Isi Mitrani:

Heterogeneous Multiprocessor Systems with Breakdowns: Performance and Optimal Repair Strategies. 91-109 - Ian F. Akyildiz, Horst von Brand:

Exact Solutions for Networks of Queues with Blocking-After-Service. 111-130 - Erol Gelenbe, Marisela Hernández:

Virus Tests to Maximize Availability of Software Systems. 131-147 - François Baccelli, William A. Massey, Paul E. Wright:

Determining the Exit Time Distribution for a Closed Cyclic Network. 149-165
Volume 125, Number 2, 28 March 1994
- Paul Gastin, Antoine Petit, Wieslaw Zielonka:

An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces. 167-204 - Martin Middendorf:

More on the Complexity of Common Superstring and Supersequence Problems. 205-228 - Mody Lempel, Azaria Paz:

An Algorithm for Finding a Shortest Vector in a Two-Dimensional Modular Lattice. 229-241 - Tao Jiang

, Oscar H. Ibarra, Hui Wang:
Some Results Concerning 2-D On-Line Tessellation Acceptors and 2-D Alternating Finite Automata. 243-257 - Andrzej Ehrenfeucht, Paulien ten Pas, Grzegorz Rozenberg:

Properties of Grammatical Codes of Trees. 259-293 - Marty J. Wolf:

Nondeterministic Circuits, Space Complexity and Quasigroups. 295-313 - Sheng Yu, Qingyu Zhuang, Kai Salomaa:

The State Complexities of Some Basic Operations on Regular Languages. 315-328 - Eric Goles Ch.:

Lyapunov Operators to Study the Convergence of Extremal Automata. 329-337 - Bruce E. Litow:

A Context-Free Language Decision Problem. 339-343 - Vineet Bafna, Bala Kalyanasundaram, Kirk Pruhs:

Not All Insertion Methods Yield Constant Approximate Tours in the Euclidean Plane. 345-360 - Robert E. Matthews:

An Inherently Iterative Algorithm for the Grzegorczyk Hierarchy. 355-360 - Alexandru Mateescu:

Scattered Deletion and Commutativity. 361-371 - Pengyuan Chen:

The Communication Complexity of Computing Differentiable Functions in a Multicomputer Network. 373-383

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














