Search ACM DL

Search Issue

enter search term and/or author name

**On the shortest paths between two convex polyhedra**

Avikam Balstan, Micha Sharir

Pages: 267-287

DOI: 10.1145/42282.214094

**Consensus in the presence of partial synchrony**

Cynthia Dwork, Nancy Lynch, Larry Stockmeyer

Pages: 288-323

DOI: 10.1145/42282.42283

**Church-Rosser Thue systems and formal languages**

Robert McNaughton, Paliath Narendran, Friedrich Otto

Pages: 324-344

DOI: 10.1145/42282.42284

**Efficient tests for top-down termination of logical rules**

Jeffrey D. Ullman, Allen Van Gelder

Pages: 345-373

DOI: 10.1145/42282.42285

**An O(n^{2}(m + Nlog n)log n) min-cost flow algorithm**

Zvi Galil, Éva Tardos

Pages: 374-386

DOI: 10.1145/42282.214090

**The time complexity of maximum matching by simulated annealing**

Galen H. Sasaki, Bruce Hajek

Pages: 387-403

DOI: 10.1145/42282.46160

**The schematic protection model**: its definition and analysis for acyclic attenuating schemes

Ravinderpal Singh Sandhu

Pages: 404-432

DOI: 10.1145/42282.42286

**Optimal directory placement on disk storage devices**

A. R. Calderbank, E. G. Coffman, Jr., Leopold Flatto

Pages: 433-446

DOI: 10.1145/42282.42287

**Comparing the combinational complexities of arithmetic functions**

Helmut Alt

Pages: 447-460

DOI: 10.1145/42282.214084

**On the complexity of branching programs and decision trees for clique functions**

Ingo Wegener

Pages: 461-471

DOI: 10.1145/42282.46161