Volume 4,
Number 1,
March 1975
Volume 4,
Number 2,
June 1975
Volume 4,
Number 3,
September 1975
- Dennis E. White, S. G. Williamson:
Computational Algorithms for the Enumeration of Group Invariant Partitions.
209-213 BibTeX
- Vaughan R. Pratt:
Every Prime has a Succinct Certificate.
214-220 BibTeX
- F. Hadlock:
Finding a Maximum Cut of a Planar Graph in Polynomial Time.
221-225 BibTeX
- Ravi Sethi:
Complete Register Allocation Problems.
226-248 BibTeX
- Ashok K. Chandra, C. K. Wong:
Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation.
249-263 BibTeX
- Robert L. (Scot) Drysdale III, Frank H. Young:
Improved Divide/Sort/Merge Sorting Networks.
264-270 BibTeX
- Richard M. Karp, A. C. McKellar, C. K. Wong:
Near-Optimal Solutions to a 2-Dimensional Placement Problem.
271-286 BibTeX
- Arnold L. Rosenberg:
Managing Storage for Extendible Arrays.
287-306 BibTeX
- H. R. Strong Jr., Andrea Maggiolo-Schettini:
Recursion Structure Simplification.
307-320 BibTeX
- R. Bumby, E. Cooper, D. Latch:
Interactive Computation of Homology of Finite Partially Ordered Sets.
321-325 BibTeX
- Vaughan R. Pratt:
The Power of Negative Thinking in Multiplying Boolean Matrices.
326-330 BibTeX
- S. Rao Kosaraju:
Speed of Recognition of Context-Free Languages by Array Automata.
331-340 BibTeX
- W. H. Hosken:
Optimum Partitions of Tree Addressing Structures.
341-347 BibTeX
- Leslie G. Valiant:
Parallelism in Comparison Problems.
348-355 BibTeX
- Holger Opderbeck, Wesley W. Chu:
The Renewal Model for Program Behavior.
356-374 BibTeX
- Philip M. Spira, A. Pan:
On Finding and Updating Spanning Trees and Shortest Paths.
375-380 BibTeX
- L. Revah:
On the Number of Multiplications/Divisions Evaluating a Polynomial with Auxiliary Functions.
381-392 BibTeX
- Shimon Even:
An Algorithm for Determining Whether the Connectivity of a Graph is at Least k.
393-396 BibTeX
Volume 4,
Number 4,
December 1975
- M. R. Garey, David S. Johnson:
Complexity Results for Multiprocessor Scheduling under Resource Constraints.
397-411 BibTeX
- Daniel Brand:
Proving Theorems with the Modification Method.
412-430 BibTeX
- Theodore P. Baker, John Gill, Robert Solovay:
Relativizatons of the P =? NP Question.
431-442 BibTeX
- Arnold L. Rosenberg:
Preserving Proximity in Arrays.
443-460 BibTeX
- Erol Gelenbe, Jacques Lenfant, Dominique Potier:
Response Time of a Fixed-Head Disk to Transfers of Variable Length.
461-473 BibTeX
- D. M. Jackson, G. H. John van Rees:
The Enumeration of Generalized Double Stochastic Nonnegative Integer Square Matrices.
474-477 BibTeX
- John L. Bruno, Micha Hofri:
On Scheduling Chains of Jobs on One Processor with Limited Preemption.
478-490 BibTeX
- Michael D. Alder:
A Convergence Theorem for Hierarchies of Model Neurones.
491-506 BibTeX
- Shimon Even, Robert Endre Tarjan:
Network Flow and Testing Graph Connectivity.
507-518 BibTeX
- Matthew S. Hecht, Jeffrey D. Ullman:
A Simple Algorithm for Global Data Flow Analysis Problems.
519-532 BibTeX
- Alfred V. Aho, Kenneth Steiglitz, Jeffrey D. Ullman:
Evaluating Polynomials at Fixed Sets of Points.
533-539 BibTeX
- Alan G. Konheim:
An Elementary Solution of the Queuing System G/G/1.
540-545 BibTeX
Copyright © Sun May 17 00:18:49 2009
by Michael Ley (ley@uni-trier.de)
