Volume 13, Number 1, February 1984
- Arie de Bruin:
On the Existence of Cook Semantics.
1-13 BibTeX
- Greg N. Frederickson, Donald B. Johnson:
Generalized Selection and Ranking: Sorted Matrices.
14-30 BibTeX
,
Erratum: SIAM J. Comput. 19(1): 164-181(1990) BibTeX
- Martin E. Dyer:
Linear Time Algorithms for Two- and Three-Variable Linear Programs.
31-45 BibTeX
- John H. Reif:
On Synchronous Parallel Computations with Independent Probabilistic Choice.
46-56 BibTeX
- Norman J. Pullman:
Clique Covering of Graphs IV. Algorithms.
57-75 BibTeX
- Catriel Beeri, Moshe Y. Vardi:
Formal Systems for Tuple and Equality Generating Dependencies.
76-98 BibTeX
- Stavros S. Cosmadakis, Christos H. Papadimitriou:
The Traveling Salesman Problem with Many Visits to Few Cities.
99-108 BibTeX
- Udi Manber, Martin Tompa:
The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem.
109-115 BibTeX
- Dah-Ming W. Chiu, Philip A. Bernstein, Yu-Chi Ho:
Optimizing Chain Queries in a Distributed Database System.
116-134 BibTeX
- Richard E. Ladner, Richard J. Lipton, Larry J. Stockmeyer:
Alternating Pushdown and Stack Automata.
135-155 BibTeX
- Maria M. Klawe:
Limitations on Explicit Constructions of Expanding Graphs.
156-166 BibTeX
- Prakash V. Ramanan:
Pushdown Permuter Characterization Theorem.
167-169 BibTeX
- Donald K. Friesen:
Tighter Bounds for the Multifit Processor Scheduling Algorithm.
170-181 BibTeX
- Nimrod Megiddo, Kenneth J. Supowit:
On the Complexity of Some Common Geometric Location Problems.
182-196 BibTeX
- Thomas Ottmann, Douglas Stott Parker Jr., Arnold L. Rosenberg, Hans-Werner Six, Derick Wood:
Minimal-Cost Brother Trees.
197-217 BibTeX
Volume 13, Number 2, May 1984
- Pavol Duris, Zvi Galil:
Two Tapes are Better than One for Nondeterministic Machines.
219-227 BibTeX
- T. C. Hu, M. T. Shing:
Computation of Matrix Chain Products. Part II.
228-251 BibTeX
- J. M. Robson:
N by N Checkers is Exptime Complete.
252-267 BibTeX
- Dario Bini:
Parallel Solution of Certain Toeplitz Linear Systems.
268-276 BibTeX
- Greg N. Frederickson:
Self-Organizing Heuristics for Implicit Data Structures.
277-291 BibTeX
- Micha Sharir, Amir Pnueli, Sergiu Hart:
Verification of Probabilistic Programs.
292-314 BibTeX
- Sunita Agarwal, A. K. Mittal, P. Sharma:
Constrained Optimum Communication Trees and Sensitivity Analysis.
315-328 BibTeX
- Uwe Schöning, Ronald V. Book:
Immunity, Relativizations, and Nondeterminism.
329-337 BibTeX
- Dov Harel, Robert Endre Tarjan:
Fast Algorithms for Finding Nearest Common Ancestors.
338-355 BibTeX
- Etienne Grandjean:
The Spectra of First-Order Sentences and Computational Complexity.
356-373 BibTeX
- Robert Cartwright:
Recursive Programs as Definitions in First Order Logic.
374-408 BibTeX
- Larry J. Stockmeyer, Uzi Vishkin:
Simulation of Parallel Random Access Machines by Circuits.
409-422 BibTeX
- Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin:
Constant Depth Reducibility.
423-439 BibTeX
Volume 13, Number 3, August 1984
- Ernst W. Mayr:
An Algorithm for the General Petri Net Reachability Problem.
441-460 BibTeX
- Ronald V. Book, Timothy J. Long, Alan L. Selman:
Quantitative Relativizations of Complexity Classes.
461-487 BibTeX
- Bernard Chazelle:
Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm.
488-507 BibTeX
- Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II:
Consistency and Serializability in Concurrent Database Systems.
508-530 BibTeX
- M. Keane, Alan G. Konheim, I. Meilijson:
The Organ Pipe Permutation.
531-540 BibTeX
- Rami G. Melhem, Werner C. Rheinboldt:
A Mathematical Model for the Verification of Systolic Networks.
541-565 BibTeX
- Robert Endre Tarjan, Mihalis Yannakakis:
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs.
566-579 BibTeX
- Yung H. Tsin, Francis Y. L. Chin:
Efficient Parallel Algorithms for a Class of Graph Theoretic Problems.
580-599 BibTeX
- Brenda S. Baker, Edward G. Coffman Jr.:
Insertion and Compaction Algorithms in Sequentially Allocated Storage.
600-609 BibTeX
- John E. Hopcroft, Deborah Joseph, Sue Whitesides:
Movement Problems for 2-Dimensional Linkages.
610-629 BibTeX
- Sam Toueg, Özalp Babaoglu:
On the Optimum Checkpoint Selection Problem.
630-649 BibTeX
- Joseph Y.-T. Leung, Oliver Vornberger, James D. Witthoff:
On Some Variants of the Bandwidth Minimization Problem.
650-667 BibTeX
Volume 13, Number 4, November 1984
- Daniel P. Heyman, Shalom Tsur:
Disk Performance in a Transaction-Oriented System.
669-681 BibTeX
- Andreas Blass, Yuri Gurevich:
Equivalence Relations, Invariants, and Normal Forms.
682-689 BibTeX
- Ten-Hwang Lai, Sartaj Sahni:
Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness.
690-704 BibTeX
- Gregory Dobson:
Scheduling Independent Tasks on Uniform Processors.
705-716 BibTeX
- Hans Heller:
On Relativized Polynomial and Exponential Computations.
717-725 BibTeX
- Hans W. Barz:
The Power of Synchronization Mechanisms.
726-749 BibTeX
- Jean H. Gallier:
n-Rational Algebras I. Basic Properties and Free Algebras.
750-775 BibTeX
- Jean H. Gallier:
n-Rational Algebras II. Varieties and Logic of Inequalities.
776-794 BibTeX
- Nathan Linial:
The Information-Theoretic Bound is Good for Merging.
795-801 BibTeX
- Joachim von zur Gathen:
Parallel Algorithms for Algebraic Problems.
802-824 BibTeX
- Rivi Sherman, Amir Pnueli, David Harel:
Is the Interesting Part of Process Logic Uninteresting? A Translation from PL to PDL.
825-839 BibTeX
- Joseph JáJá, Viktor K. Prasanna, Janos Simon:
Information Transfer under Different Sets of Protocols.
840-849 BibTeX
- Manuel Blum, Silvio Micali:
How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits.
850-864 BibTeX
- Dennis S. Arnon, George E. Collins, Scott McCallum:
Cylindrical Algebraic Decomposition I: The Basic Algorithm.
865-877 BibTeX
- Dennis S. Arnon, George E. Collins, Scott McCallum:
Cylindrical Algebraic Decomposition II: An Adjacency Algorithm for the Plane.
878-889 BibTeX
Copyright © Sun May 17 00:18:51 2009
by Michael Ley (ley@uni-trier.de)
