Search ACM DL

Search Issue

enter search term and/or author name

**Recognizing circle graphs in polynomial time**

Csaba P. Gabor, Kenneth J. Supowit, Wen-Lian Hsu

Pages: 435-473

DOI: 10.1145/65950.65951

**Hierarchical planarity testing algorithms**

Thomas Lengauer

Pages: 474-509

DOI: 10.1145/65950.65952

**A trade-off between space and efficiency for routing tables**

David Peleg, Eli Upfal

Pages: 510-530

DOI: 10.1145/65950.65953

**Invariance of complexity measures for networks with unreliable gates**

Nicholas Pippenger

Pages: 531-539

DOI: 10.1145/65950.77248

**Efficient implementation of graph algorithms using contraction**

Harold N. Gabow, Zvi Galil, Thomas H. Spencer

Pages: 540-572

DOI: 10.1145/65950.65954

**Optimum lopsided binary trees**

Sanjiv Kapoor, Edward M. Reingold

Pages: 573-590

DOI: 10.1145/65950.65955

**Simple constant-time consensus protocols in realistic failure models**

Benny Chor, Michael Merritt, David B. Shmoys

Pages: 591-614

DOI: 10.1145/65950.65956

**Acyclic fork-join queuing networks**

François Baccelli, William A. Massey, Don Towsley

Pages: 615-642

DOI: 10.1145/65950.65957

**Optimal bounds for decision problems on the CRCW PRAM**

Paul Beame, Johan Hastad

Pages: 643-670

DOI: 10.1145/65950.65958

**New lower bounds for parallel computation**

Ming Li, Yaacov Yesha

Pages: 671-680

DOI: 10.1145/65950.65959