Volume 16, Number 1, February 1987
- Christos H. Papadimitriou, John N. Tsitsiklis:
On Stochastic Scheduling with In-Tree Precedence Constraints.
1-6
- Ravindran Kannan, Gary L. Miller, Larry Rudolph:
Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers.
7-16
- Oded Shmueli, Alon Itai:
Complexity of Views: Tree and Cyclic Schemas.
17-37
- Russ Miller, Quentin F. Stout:
Data Movement Techniques for the Pyramid Computer.
38-60
- Richard Cole, Micha Sharir, Chee-Keng Yap:
On k-Hulls and Related Problems.
61-77
- Franz Aurenhammer:
Power Diagrams: Properties, Algorithms and Applications.
78-96
- Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson:
A Time-Space Tradeoff for Element Distinctness.
97-99
- Friedhelm Meyer auf der Heide, Avi Wigderson:
The Complexity of Parallel Sorting.
100-107
- Douglas W. Jones:
A Note on Bottom-Up Skew Heaps.
108-110
- Dan Gusfield:
Three Fast Algorithms for Four Problems in Stable Marriage.
111-128
- Harry B. Hunt III, Daniel J. Rosenkrantz, Peter A. Bloniarz:
On the Computational Complexity of Algebra on Lattices.
129-148
- Frank D. Murgolo:
An Efficient Approximation Scheme for Variable-Sized Bin Packing.
149-161
- Hyeong-Ah Choi, S. Louis Hakimi:
Scheduling File Transfers for Trees and Odd Cycles.
162-168
- Costas Courcoubetis, Martin I. Reiman, Burton Simon:
Stability of a Queueing System with Concurrent Service and Locking.
169-178
- Peter D. Mosses, Gordon D. Plotkin:
On Proving Limiting Completeness.
179-194
- Wolfgang Maass, Amir Schorr:
Speed-Up of Turing Machines with One Work Tape and a Two-Way Input Tape.
195-202
- Françoise Fogelman-Soulié, Gérard Weisbuch:
Random Iterations of Threshold Networks and Associative Memory.
203-220
Volume 16, Number 2, April 1987
- Karel Culik II, Juhani Karhumäki:
The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDT0L Languages) is Decidable.
221-230
- Ephraim Korach, Shlomo Moran, Shmuel Zaks:
The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors.
231-236
- Dan Gusfield, Charles U. Martel, David Fernández-Baca:
Fast Algorithms for Bipartite Network Flow.
237-251
- Dario Bini, Milvio Capovani:
Tensor Rank and Border Rank of Band Toeplitz Matrices.
252-258
- Jin-yi Cai, Gabriele E. Meyer:
Graph Minimal Uncolorability is D^P-Complete.
259-277
- Thomas Lickteig:
The Computational Complexity of Division in Quadratic Extension Fields.
278-311
- Takao Asano:
An Application of Duality to Edge-Deletion Problems.
312-331
- Irène Guessarian, José Meseguer:
On the Axiomatization of ``If-Then-Else''.
332-357
- Joseph Douglas Horton:
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph.
358-366
- Oscar H. Ibarra, Michael A. Palis:
On Efficient Simulations of Systolic Arrays of Random-Access Machines.
367-377
- Charles Knessl, B. J. Matkowsky, Z. Schuss, Charles Tier:
Asymptotic Expansions for a Closed Multiple Access System.
378-398
- Micha Hofri, Keith W. Ross:
On the Optimal Control of Two Queues with Server Setup Times and its Analysis.
399-420
Volume 16, Number 3, June 1987
Volume 16, Number 4, August 1987
Volume 16, Number 5, October 1987
- Louis E. Rosier, Hsu-Chun Yen:
Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning Omega-Machines.
779-807
- Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata:
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones.
808-835
- Wenqui Huang, Xiangdong Yu:
A DNF without Regular Shortest Consensus Path.
836-840
- Edward P. F. Chan, Alberto O. Mendelzon:
Independent and Separable Database Schemes.
841-851
- Stuart A. Kurtz:
A Note on Randomized Polynomial Time.
852-853
- Anna Lubiw:
Doubly Lexical Orderings of Matrices.
854-879
- Pierre McKenzie, Stephen A. Cook:
The Parallel Complexity of Abelian Permutation Group Problems.
880-909
- Harry B. Hunt III, Richard Edwin Stearns:
Nonlinear Algebra and Optimization on Rings are ``Hard''.
910-929
- Joachim von zur Gathen:
Computing Powers in Parallel.
930-945
- Bernd Becker, Günter Hotz:
On the Optimal Layout of Planar Graphs with Fixed Boundary.
946-972
Volume 16, Number 6, December 1987
Copyright © Fri Mar 12 17:32:09 2010
by Michael Ley (ley@uni-trier.de)
