Search ACM DL

Search Issue

enter search term and/or author name

**A mechanical proof of the Church-Rosser theorem**

N. Shankar

Pages: 475-522

DOI: 10.1145/44483.44484

**Finding a maximum-genus graph imbedding**

Merrick L. Furst, Jonathan L. Gross, Lyle A. McGeoch

Pages: 523-534

DOI: 10.1145/44483.44485

**The coloring and maximum independent set problems on planar perfect graphs**

Wen-Lian Hsu

Pages: 535-563

DOI: 10.1145/44483.44486

**Some distributions that allow perfect packing**

Wansoo T. Rhee, Michel Talagrand

Pages: 564-578

DOI: 10.1145/44483.44487

**Stability of binary exponential backoff**

Jonathan Goodman, Albert G. Greenberg, Neal Madras, Peter March

Pages: 579-602

DOI: 10.1145/44483.44488

**The physical mapping problem for parallel architectures**

Lenwood S. Heath, Arnold L. Rosenberg, Bruce T. Smith

Pages: 603-634

DOI: 10.1145/44483.44489

**Optimal simulations between mesh-connected arrays of processors**

S. Rao Kosaraju, Mikhail J. Atallah

Pages: 635-650

DOI: 10.1145/44483.44494

**The parallel complexity of exponentiating polynomials over finite fields**

Faith E. Fich, Martin Tompa

Pages: 651-667

DOI: 10.1145/44483.44496

**Busy periods for subnetworks in stochastic networks**: mean value analysis

Hans Daduna

Pages: 668-674

DOI: 10.1145/44483.44495

**The reduction of perturbed Markov generators**: an algorithm exposing the role of transient states

Jan Robin Rohlicek, Alan S. Willsky

Pages: 675-696

DOI: 10.1145/44483.44497

**On the power of one-way communication**

Jik H. Chang, Oscar H. Ibarra, Anastasios Vergis

Pages: 697-726

DOI: 10.1145/44483.44493

**Nonconstructive tools for proving polynomial-time decidability**

Michael R. Fellows, Michael A. Langston

Pages: 727-739

DOI: 10.1145/44483.44491

**Fast algorithms for N-dimensional restrictions of hard problems**

Friedhelm Meyer auf der Heide

Pages: 740-747

DOI: 10.1145/44483.44490

**A nonlinear lower bound for random-access machines under logarithmic cost**

Arnold Schönhage

Pages: 748-754

DOI: 10.1145/44483.44492