Editor's Foreword
The discrete logarithm modulo a composite hides 0(n) Bits
Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC
Surpassing the information theoretic bound with fusion trees
Output sensitive and dynamic constructions of higher order voronoi diagrams and levels in arrangements
Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
Self-testing/correcting with applications to numerical problems
Author index for volume 47