|
|
Journals in DBLP
J. ACM
1975, volume: 22, number: 2
- Roy Lowrance, Robert A. Wagner
An Extension of the String-to-String Correction Problem. [Citation Graph (2, 0)][DBLP]
J. ACM, 1975, v:22, n:2, pp:177-183 [Journal]
- Jacques Morgenstern
The Linear Complexity of Computation. [Citation Graph (0, 0)][DBLP]
J. ACM, 1975, v:22, n:2, pp:184-194 [Journal]
- David E. Muller, Franco P. Preparata
Bounds to Complexities of Networks for Sorting and for Switching. [Citation Graph (2, 0)][DBLP]
J. ACM, 1975, v:22, n:2, pp:195-201 [Journal]
- Yehoshua Perl, M. R. Garey, Shimon Even
Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters. [Citation Graph (0, 0)][DBLP]
J. ACM, 1975, v:22, n:2, pp:202-214 [Journal]
- Robert Endre Tarjan
Efficiency of a Good But Not Linear Set Union Algorithm. [Citation Graph (4, 0)][DBLP]
J. ACM, 1975, v:22, n:2, pp:215-225 [Journal]
- Bernd Knauer
A Simple Planarity Criterion. [Citation Graph (0, 0)][DBLP]
J. ACM, 1975, v:22, n:2, pp:226-230 [Journal]
- Jair M. Babad
A Generalized Multi-Entrance Time-Sharing Priority Queue. [Citation Graph (0, 0)][DBLP]
J. ACM, 1975, v:22, n:2, pp:231-247 [Journal]
- Forest Baskett, K. Mani Chandy, Richard R. Muntz, Fernando G. Palacios
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers. [Citation Graph (6, 0)][DBLP]
J. ACM, 1975, v:22, n:2, pp:248-260 [Journal]
- Erol Gelenbe
On Approximate Computer System Models. [Citation Graph (1, 0)][DBLP]
J. ACM, 1975, v:22, n:2, pp:261-269 [Journal]
- Micha Hofri, Micha Yadin
A Processor in Series with Demand-Interrupting Devices - A Stochastic Model. [Citation Graph (0, 0)][DBLP]
J. ACM, 1975, v:22, n:2, pp:270-290 [Journal]
- David R. Musser
Multivariate Polynomial Factorization. [Citation Graph (0, 0)][DBLP]
J. ACM, 1975, v:22, n:2, pp:291-308 [Journal]
- Arnold L. Rosenberg
Corrigendum: ``Allocating Storage for Extendible Arrays''. [Citation Graph (0, 0)][DBLP]
J. ACM, 1975, v:22, n:2, pp:308- [Journal]
|
