EDITORS' FOREWORD
Efficient Oblivious Branching Programs for Threshold and Mod Functions
On the Design of Reliable Boolean Circuits That Contain Partially Unreliable Gates
(De)randomized Construction of Small Sample Spaces in NC
An Efficient Membership-Query Algorithm for Learning DNF with Respect to the Uniform Distribution
Size-Estimation Framework with Applications to Transitive Closure and Reachability
Maximum (s, t)-Flows in Planar Networks in O(|V| log |V|) Time
The Set of Minimal Words of a Context-free Language is Context-free
Logical Description of Context-free Graph Languages
Amortization Results for Chromatic Search Trees, with an Application to Priority Queues
Shared Global States in Distributed Computations
The Steiner Tree Problem in Orientation Metrics
Universally Serializable Computation
Author Index for Volume 55