Volume 22,
Number 1,
January 1975
Volume 22,
Number 2,
April 1975
- Roy Lowrance, Robert A. Wagner:
An Extension of the String-to-String Correction Problem.
177-183
Electronic Edition BibTeX
- Jacques Morgenstern:
The Linear Complexity of Computation.
184-194
Electronic Edition (ACM DL) BibTeX
- David E. Muller, Franco P. Preparata:
Bounds to Complexities of Networks for Sorting and for Switching.
195-201
Electronic Edition BibTeX
- Yehoshua Perl, M. R. Garey, Shimon Even:
Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters.
202-214
Electronic Edition (ACM DL) BibTeX
- Robert Endre Tarjan:
Efficiency of a Good But Not Linear Set Union Algorithm.
215-225
Electronic Edition BibTeX
- Bernd Knauer:
A Simple Planarity Criterion.
226-230
Electronic Edition (ACM DL) BibTeX
- Jair M. Babad:
A Generalized Multi-Entrance Time-Sharing Priority Queue.
231-247
Electronic Edition (ACM DL) BibTeX
- Forest Baskett, K. Mani Chandy, Richard R. Muntz, Fernando G. Palacios:
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers.
248-260
Electronic Edition BibTeX
- Erol Gelenbe:
On Approximate Computer System Models.
261-269
Electronic Edition BibTeX
- Micha Hofri, Micha Yadin:
A Processor in Series with Demand-Interrupting Devices - A Stochastic Model.
270-290
Electronic Edition (ACM DL) BibTeX
- David R. Musser:
Multivariate Polynomial Factorization.
291-308
Electronic Edition (ACM DL) BibTeX
- Arnold L. Rosenberg:
Corrigendum: ``Allocating Storage for Extendible Arrays''.
308
Electronic Edition (ACM DL) BibTeX
Volume 22,
Number 3,
July 1975
- Roger C. Schank, Neil M. Goldman, Charles J. Rieger III, Christopher Riesbeck:
Inference and Paraphrase by Computer.
309-328
Electronic Edition (ACM DL) BibTeX
- Gregory J. Chaitin:
A Theory of Program Size Formally Identical to Information Theory.
329-340
Electronic Edition (ACM DL) BibTeX
- Nancy A. Lynch:
On Reducibility to Complex or Sparse Sets.
341-345
Electronic Edition (ACM DL) BibTeX
- Glenn K. Manacher:
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String.
346-351
Electronic Edition (ACM DL) BibTeX
- S. E. Goodman, Stephen T. Hedetniemi, Peter J. Slater:
Advances on the Hamiltonian Completion Problem.
352-360
Electronic Edition (ACM DL) BibTeX
- John L. Pfaltz:
Representing Graphs by Knuth Trees.
361-366
Electronic Edition (ACM DL) BibTeX
- Peter Elias, Richard A. Flower:
The Complexity of Some Simple Retrieval Problems.
367-379
Electronic Edition (ACM DL) BibTeX
- Robert E. Dressler, S. Thomas Parker:
Primes with a Prime Subscript.
380-381
Electronic Edition (ACM DL) BibTeX
- John L. Bruno, T. Lassagne:
The Generation of Optimal Code for Stack Machines.
382-396
Electronic Edition (ACM DL) BibTeX
- Walter C. Oney:
Queueing Analysis of the Scan Policy for Moving-Head Disks.
397-412
Electronic Edition (ACM DL) BibTeX
- G. Terry Ross, Darwin Klingman, H. Albert Napier:
A Computational Study of the Effects of Problem Dimensions on Solution Times for Transportation Problems.
413-424
Electronic Edition (ACM DL) BibTeX
- Ravi Sethi:
Errata: ``Testing for the Church-Rosser Property''.
424
Electronic Edition (ACM DL) BibTeX
- Antonin Svoboda:
The Concept of Term Exclusiveness and Its Effect on the Theory of Boolean Functions.
425-440
Electronic Edition (ACM DL) BibTeX
Volume 22,
Number 4,
October 1975
Copyright © Sun May 17 00:05:23 2009
by Michael Ley (ley@uni-trier.de)