Search ACM DL

Search Issue

enter search term and/or author name

**A sufficient condition for backtrack-bounded search**

Eugene C. Freuder

Pages: 755-761

DOI: 10.1145/4221.4225

**A fast parallel algorithm for the maximal independent set problem**

Richard M. Karp, Avi Wigderson

Pages: 762-773

DOI: 10.1145/4221.4226

**Closures of database hypergraphs**

Domenico Saccà

Pages: 774-803

DOI: 10.1145/4221.4997

**Complexity of network synchronization**

Baruch Awerbuch

Pages: 804-823

DOI: 10.1145/4221.4227

**Asynchronous consensus and broadcast protocols**

Gabriel Bracha, Sam Toueg

Pages: 824-840

DOI: 10.1145/4221.214134

**How to assign votes in a distributed system**

Hector Garcia-Molina, Daniel Barbara

Pages: 841-860

DOI: 10.1145/4221.4223

**On ordered languages and the optimization of linear functions by greedy algorithms**

Ulrich Faigle

Pages: 861-870

DOI: 10.1145/4221.4998

**A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension**

Ilan Adler, Nimrod Megiddo

Pages: 871-895

DOI: 10.1145/4221.4222

**Acceptance trees**

M. Hennessy

Pages: 896-928

DOI: 10.1145/4221.4249

**Lower bounds for solving linear diophantine equations on random access machines**

Friedhelm Meyer auf der Heide

Pages: 929-937

DOI: 10.1145/4221.4250

**Applications of Ramsey's theorem to decision tree complexity**

Shlomo Moran, Marc Snir, Udi Manber

Pages: 938-949

DOI: 10.1145/4221.4259

**A polynomial algorithm for the min-cut linear arrangement of trees**

Mihalis Yannakakis

Pages: 950-988

DOI: 10.1145/4221.4228