|
|
Journals in DBLP
J. ACM
1984, volume: 31, number: 1
- Robert E. Shostak
Deciding Combinations of Theories. [Citation Graph (0, 0)][DBLP]
J. ACM, 1984, v:31, n:1, pp:1-12 [Journal]
- H. James Hoover, Maria M. Klawe, Nicholas Pippenger
Bounding Fan-out in Logical Networks. [Citation Graph (0, 0)][DBLP]
J. ACM, 1984, v:31, n:1, pp:13-18 [Journal]
- Peter Eades, Michael Hickey, Ronald C. Read
Some Hamilton Paths and a Minimal Change Algorithm. [Citation Graph (0, 0)][DBLP]
J. ACM, 1984, v:31, n:1, pp:19-29 [Journal]
- Catriel Beeri, Martin Dowd, Ronald Fagin, Richard Statman
On the Structure of Armstrong Relations for Functional Dependencies. [Citation Graph (10, 0)][DBLP]
J. ACM, 1984, v:31, n:1, pp:30-46 [Journal]
- Lawrence J. Henschen, Shamim A. Naqvi
On compiling queries in recursive first-order databases. [Citation Graph (92, 0)][DBLP]
J. ACM, 1984, v:31, n:1, pp:47-85 [Journal]
- Aurel A. Lazar
Optimal Flow Control of an M/M/m Queue. [Citation Graph (0, 0)][DBLP]
J. ACM, 1984, v:31, n:1, pp:86-98 [Journal]
- Sidnie Dresher Feit
A Fast Algorithm for the Two-Variable Integer Programming Problem. [Citation Graph (0, 0)][DBLP]
J. ACM, 1984, v:31, n:1, pp:99-113 [Journal]
- Nimrod Megiddo
Linear Programming in Linear Time When the Dimension Is Fixed. [Citation Graph (0, 0)][DBLP]
J. ACM, 1984, v:31, n:1, pp:114-127 [Journal]
- Onno J. Boxma, Frank P. Kelly, Alan G. Konheim
The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues. [Citation Graph (0, 0)][DBLP]
J. ACM, 1984, v:31, n:1, pp:128-133 [Journal]
- Burton Simon
Priority Queues with Feedback. [Citation Graph (0, 0)][DBLP]
J. ACM, 1984, v:31, n:1, pp:134-149 [Journal]
- Joseph JáJá, Viktor K. Prasanna
Information Transfer in Distributed Computing with Applications to VLSI. [Citation Graph (0, 0)][DBLP]
J. ACM, 1984, v:31, n:1, pp:150-162 [Journal]
- Douglas R. Smith
Random Trees and the Analysis of Branch and Bound Procedures. [Citation Graph (0, 0)][DBLP]
J. ACM, 1984, v:31, n:1, pp:163-188 [Journal]
|
