|
|
Journals in DBLP
J. ACM
1989, volume: 36, number: 3
- Csaba P. Gabor, Kenneth J. Supowit, Wen-Lian Hsu
Recognizing circle graphs in polynomial time. [Citation Graph (0, 0)][DBLP]
J. ACM, 1989, v:36, n:3, pp:435-473 [Journal]
- Thomas Lengauer
Hierarchical planarity testing algorithms. [Citation Graph (0, 0)][DBLP]
J. ACM, 1989, v:36, n:3, pp:474-509 [Journal]
- David Peleg, Eli Upfal
A trade-off between space and efficiency for routing tables. [Citation Graph (0, 0)][DBLP]
J. ACM, 1989, v:36, n:3, pp:510-530 [Journal]
- Nicholas Pippenger
Invariance of complexity measures for networks with unreliable gates. [Citation Graph (0, 0)][DBLP]
J. ACM, 1989, v:36, n:3, pp:531-539 [Journal]
- Harold N. Gabow, Zvi Galil, Thomas H. Spencer
Efficient implementation of graph algorithms using contraction. [Citation Graph (0, 0)][DBLP]
J. ACM, 1989, v:36, n:3, pp:540-572 [Journal]
- Sanjiv Kapoor, Edward M. Reingold
Optimum lopsided binary trees. [Citation Graph (0, 0)][DBLP]
J. ACM, 1989, v:36, n:3, pp:573-590 [Journal]
- Benny Chor, Michael Merritt, David B. Shmoys
Simple constant-time consensus protocols in realistic failure models. [Citation Graph (0, 0)][DBLP]
J. ACM, 1989, v:36, n:3, pp:591-614 [Journal]
- François Baccelli, William A. Massey, Donald F. Towsley
Acyclic fork-join queuing networks. [Citation Graph (0, 0)][DBLP]
J. ACM, 1989, v:36, n:3, pp:615-642 [Journal]
- Paul Beame, Johan Håstad
Optimal bounds for decision problems on the CRCW PRAM. [Citation Graph (0, 0)][DBLP]
J. ACM, 1989, v:36, n:3, pp:643-670 [Journal]
- Ming Li, Yaacov Yesha
New lower bounds for parallel computation. [Citation Graph (0, 0)][DBLP]
J. ACM, 1989, v:36, n:3, pp:671-680 [Journal]
|
