1

Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model

Jan 1, 1999

Perfect Information Leader Election in $łog^* n + O(1)$ Rounds

Jan 1, 1998

Extraction of optimally unbiased bits from a biased source

Jan 1, 1998

Faster Algorithms for Optical Switch Configuration

Jan 1, 1997

Approximating Latin Square Extensions

Jan 1, 1996

Alternation in interaction

Jun 1, 1994

Efficient Probabilistic Checkable Proofs and Applications to Approximation

Jan 1, 1994

Efficient Probabilistically Checkable Proofs and Applications to Approximations

Jan 1, 1993

Necessary and Sufficient Conditions For Collision-Free Hashing

Jan 1, 1992