Reaching approximate agreement in the presence of faults.
Tuple sequences and lexicographic indexes.
The performance of a precedence-based queuing discipline.
Asymptotic expansions for closed Markovian networks with state-dependent service rates.
Relativizing complexity classes with sparse oracles.
A note on the height of binary search trees.
Sort sets in the relational model.
Improved methods for storing and updating information in the out-of-kilter algorithm.
Elimination of intersection anomalies from database schemes.
Predicting fill for sparse orthogonal factorization.
Security problems on inference control for SUM, MAX, and MIN queries.
The polynomial-time hierarchy and sparse oracles.
A unified approach to approximation algorithms for bottleneck problems.