Volume 33,
Number 1,
January 1986
- Zohar Manna, Richard J. Waldinger:
Special relations in automated deduction.
1-59
- Kurt Mehlhorn, Franco P. Preparata:
Routing through a rectangle.
60-85
- Benny Chor, Charles E. Leiserson, Ronald L. Rivest, James B. Shearer:
An application of number theory to the organization of raster-graphics memory.
86-104
- Marc H. Graham, Alberto O. Mendelzon, Moshe Y. Vardi:
Notions of dependency satisfaction.
105-129
- Boris D. Lubachevsky, Debasis Mitra:
A chaotic asynchronous algorithm for computing the fixed point of a nonnegative matrix of unit spectral radius.
130-150
- E. Allen Emerson, Joseph Y. Halpern:
``Sometimes'' and ``Not Never'' revisited: on branching versus linear time temporal logic.
151-178
- Derek L. Eager, Kenneth C. Sevcik:
Bound hierarchies for multiple-class queuing networks.
179-206
- Appie van de Liefvoort, Lester Lipsky:
A matrix-algebraic solution to two Km servers in a loop.
207-223
- David Harel:
Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness.
224-248
Volume 33,
Number 2,
April 1986
Volume 33,
Number 3,
July 1986
- Serge Abiteboul, Seymour Ginsburg:
Tuple sequences and lexicographic indexes.
409-422
- Catriel Beeri, Michael Kifer:
Elimination of intersection anomalies from database schemes.
423-450
- Francis Y. L. Chin:
Security problems on inference control for SUM, MAX, and MIN queries.
451-464
- Seymour Ginsburg, Richard Hull:
Sort sets in the relational model.
465-488
- Luc Devroye:
A note on the height of binary search trees.
489-498
- Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, William E. Weihl:
Reaching approximate agreement in the presence of faults.
499-516
- Thomas F. Coleman, Anders Edenbrandt, John R. Gilbert:
Predicting fill for sparse orthogonal factorization.
517-532
- Dorit S. Hochbaum, David B. Shmoys:
A unified approach to approximation algorithms for bottleneck problems.
533-550
- Samar Singh:
Improved methods for storing and updating information in the out-of-kilter algorithm.
551-567
- Debasis Mitra, James McKenna:
Asymptotic expansions for closed Markovian networks with state-dependent service rates.
568-592
- John N. Tsitsiklis, Christos H. Papadimitriou, Pierre A. Humblet:
The performance of a precedence-based queuing discipline.
593-602
- José L. Balcázar, Ronald V. Book, Uwe Schöning:
The polynomial-time hierarchy and sparse oracles.
603-617
- Timothy J. Long, Alan L. Selman:
Relativizing complexity classes with sparse oracles.
618-627
Volume 33,
Number 4,
October 1986
- Dennis de Champeaux:
Subproblem finder and instance checker, two cooperating modules for theorem provers.
633-657
- W. Eric L. Grimson:
The combinatorics of local constraints in model-based recognition and localization from sparse data.
658-686
- Vijaya Ramachandran:
On driving many long wires in a VLSI layout.
687-701
- R. Chaudhuri, A. N. V. Rao:
Approximating grammar probabilities: solution of a conjecture.
702-705
- Bruce Jay Collings, G. Barry Hembree:
Initializing generalized feedback shift register pseudorandom number generators.
706-711
- Michel Cosnard, Yves Robert:
Complexity of parallel QR factorization.
712-723
- Krzysztof R. Apt, Gordon D. Plotkin:
Countable nondeterminism and random assignment.
724-767
- Adrian E. Conway, Nicolas D. Georganas:
RECAL - a new efficient algorithm for the exact analysis of multiple-chain closed queuing networks.
768-791
- Oded Goldreich, Shafi Goldwasser, Silvio Micali:
How to construct random functions.
792-807
- Ravindran Kannan, Richard J. Lipton:
Polynomial-time algorithm for the orbit problem.
808-821
- John H. Rowland, John R. Cowles:
Small Sample Algorithms for the Identification of Polynomials.
822-829
Copyright © Tue Nov 10 00:50:23 2009
by Michael Ley (ley@uni-trier.de)
