An O(log n) expected rounds randomized byzantine generals protocol.
Correction to "An equivalence between relational database dependencies and a fragment of propositional logic".
A linear time algorithm for residue computation and a fast algorithm for division with a sparse divisor.
Monotone versus positive.
A weighted voting algorithm for replicated directories.
Lower bounds on communication complexity in distributed computer networks.
Asymptotic expansions of the sojourn time distribution functions of jobs in closed, product-form queuing networks.
Design and analysis of dynamic Huffman codes.
On the discrepancy of GFSR pseudorandom numbers.
Parallel algorithms for minimum cuts and maximum flows in planar networks.
Convexity algorithms in parallel coordinates.
Randomized parallel communications on an extension of the omega network.
Multidimensional search trees that provide new types of memory reductions.