|
|
Journals in DBLP
J. ACM
1980, volume: 27, number: 1
- Andrzej Proskurowski
On the Generation of Binary Trees. [Citation Graph (0, 0)][DBLP]
J. ACM, 1980, v:27, n:1, pp:1-2 [Journal]
- Marvin H. Solomon, Raphael A. Finkel
A Note on Enumerating Binary Trees. [Citation Graph (0, 0)][DBLP]
J. ACM, 1980, v:27, n:1, pp:3-5 [Journal]
- David Nassimi, Sartaj Sahni
An optimal routing algorithm for mesh-connected Parallel computers. [Citation Graph (0, 0)][DBLP]
J. ACM, 1980, v:27, n:1, pp:6-29 [Journal]
- Krzysztof Pawlikowski
Message Waiting Time in a Packet Switching System. [Citation Graph (0, 0)][DBLP]
J. ACM, 1980, v:27, n:1, pp:30-41 [Journal]
- G. Boyd Swartz
Polling in a Loop System. [Citation Graph (0, 0)][DBLP]
J. ACM, 1980, v:27, n:1, pp:42-59 [Journal]
- Peter B. Henderson, Yechezkel Zalcstein
Synchronization Problems Solvable by Generalized PV Systems. [Citation Graph (0, 0)][DBLP]
J. ACM, 1980, v:27, n:1, pp:60-71 [Journal]
- Abraham Silberschatz, Zvi M. Kedem
Consistency in Hierarchical Database Systems. [Citation Graph (43, 0)][DBLP]
J. ACM, 1980, v:27, n:1, pp:72-80 [Journal]
- Richard J. Lipton, Arnold L. Rosenberg, Andrew Chi-Chih Yao
External Hashing Schemes for Collections of Data Structures. [Citation Graph (0, 0)][DBLP]
J. ACM, 1980, v:27, n:1, pp:81-95 [Journal]
- Joost Engelfriet, Erik Meineche Schmidt, Jan van Leeuwen
Stack Machines and Classes of Nonnested Macro Languages. [Citation Graph (0, 0)][DBLP]
J. ACM, 1980, v:27, n:1, pp:96-117 [Journal]
- Ravindran Kannan
A Polynomial Algorithm for the Two-Variable Integer Programming Problem. [Citation Graph (0, 0)][DBLP]
J. ACM, 1980, v:27, n:1, pp:118-122 [Journal]
- Richard A. DeMillo, Stanley C. Eisenstat, Richard J. Lipton
Space-Time Trade-Offs in Structured Programming: An Improved Combinatorial Embedding Theorem. [Citation Graph (0, 0)][DBLP]
J. ACM, 1980, v:27, n:1, pp:123-127 [Journal]
- Marc A. Kaplan, Jeffrey D. Ullman
A Scheme for the Automatic Inference of Variable Types. [Citation Graph (0, 0)][DBLP]
J. ACM, 1980, v:27, n:1, pp:128-145 [Journal]
- Bhaskaram Prabhala, Ravi Sethi
Efficient Computation of Expressions with Common Subexpressions. [Citation Graph (0, 0)][DBLP]
J. ACM, 1980, v:27, n:1, pp:146-163 [Journal]
- Mitchell Wand
Continuation-Based Program Transformation Strategies. [Citation Graph (0, 0)][DBLP]
J. ACM, 1980, v:27, n:1, pp:164-180 [Journal]
- Edward A. Bender
The Number of Fanout-Free Functions with Various Gates. [Citation Graph (0, 0)][DBLP]
J. ACM, 1980, v:27, n:1, pp:181-190 [Journal]
- Norihisa Suzuki, David Jefferson
Verification Decidability of Presburger Array Programs. [Citation Graph (0, 0)][DBLP]
J. ACM, 1980, v:27, n:1, pp:191-205 [Journal]
|
