Search ACM DL

Search Issue

enter search term and/or author name

**Convexity algorithms in parallel coordinates**

Alfred Inselberg, Mordechai Reif, Tuval Chomut

Pages: 765-801

DOI: 10.1145/31846.32221

**Randomized parallel communications on an extension of the omega network**

D. Mitra, R. A. Cieslak

Pages: 802-824

DOI: 10.1145/31846.42226

**Design and analysis of dynamic Huffman codes**

Jeffrey Scott Vitter

Pages: 825-845

DOI: 10.1145/31846.42227

**Multidimensional search trees that provide new types of memory reductions**

Dan E. Willard

Pages: 846-858

DOI: 10.1145/31846.42228

**A weighted voting algorithm for replicated directories**

Joshua J. Bloch, Dean S. Daniels, Alfred Z. Spector

Pages: 859-909

DOI: 10.1145/31846.31847

**An O(log n) expected rounds randomized byzantine generals protocol**

Gabriel Bracha

Pages: 910-920

DOI: 10.1145/31846.42229

**Lower bounds on communication complexity in distributed computer networks**

Prasoon Tiwari

Pages: 921-938

DOI: 10.1145/31846.32978

**On the discrepancy of GFSR pseudorandom numbers**

Shu Tezuka

Pages: 939-949

DOI: 10.1145/31846.31848

**Parallel algorithms for minimum cuts and maximum flows in planar networks**

Donald B. Johnson

Pages: 950-967

DOI: 10.1145/31846.31849

**A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor**

Michael Kaminski

Pages: 968-984

DOI: 10.1145/31846.31850

**Asymptotic expansions of the sojourn time distribution functions of jobs in closed, product-form queuing networks**

James McKenna

Pages: 985-1003

DOI: 10.1145/31846.31851

**Monotone versus positive**

Miklos Ajtai, Yuri Gurevich

Pages: 1004-1015

DOI: 10.1145/31846.31852

**Correction to “An equivalence between relational database dependencies and a fragment of propositional logic”**

Y. Sagiv, C. Delobel, D. S. Parker, Jr., Ronald Fagin

Pages: 1016-1018

DOI: 10.1145/31846.31853