|
|
Journals in DBLP
J. ACM
1992, volume: 39, number: 3
- Joseph Y. Halpern, Lenore D. Zuck
A Little Knowledge Goes a Long Way: Knowledge-Based Derivations and Correctness Proofs for a Family of Protocols. [Citation Graph (0, 0)][DBLP]
J. ACM, 1992, v:39, n:3, pp:449-478 [Journal]
- Lenwood S. Heath, Sorin Istrail
The Pagenumber of Genus g Graphs is O(g). [Citation Graph (0, 0)][DBLP]
J. ACM, 1992, v:39, n:3, pp:479-501 [Journal]
- Alain Billionnet, Marie-Christine Costa, Alain Sutter
An Efficient Algorithm for a Task Allocation Problem. [Citation Graph (0, 0)][DBLP]
J. ACM, 1992, v:39, n:3, pp:502-518 [Journal]
- David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
Sparse Dynamic Programming I: Linear Cost Functions. [Citation Graph (0, 0)][DBLP]
J. ACM, 1992, v:39, n:3, pp:519-545 [Journal]
- David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano
Sparse Dynamic Programming II: Convex and Concave Cost Functions. [Citation Graph (0, 0)][DBLP]
J. ACM, 1992, v:39, n:3, pp:546-567 [Journal]
- Albert G. Greenberg, Neal Madras
How Fair is Fair Queuing? [Citation Graph (0, 0)][DBLP]
J. ACM, 1992, v:39, n:3, pp:568-598 [Journal]
- Martin Beaudry, Pierre McKenzie, Denis Thérien
The Membership Problem in Aperiodic Transformation Monoids. [Citation Graph (0, 0)][DBLP]
J. ACM, 1992, v:39, n:3, pp:599-616 [Journal]
- Amir M. Ben-Amram, Zvi Galil
On Pointers versus Addresses. [Citation Graph (0, 0)][DBLP]
J. ACM, 1992, v:39, n:3, pp:617-648 [Journal]
- William I. Gasarch, Carl H. Smith
Learning via Queries. [Citation Graph (0, 0)][DBLP]
J. ACM, 1992, v:39, n:3, pp:649-674 [Journal]
- Steven M. German, A. Prasad Sistla
Reasoning about Systems with Many Processes. [Citation Graph (0, 0)][DBLP]
J. ACM, 1992, v:39, n:3, pp:675-735 [Journal]
- Ran Raz, Avi Wigderson
Monotone Circuits for Matching Require Linear Depth. [Citation Graph (0, 0)][DBLP]
J. ACM, 1992, v:39, n:3, pp:736-744 [Journal]
|
