1. Error Reduction by Parallel Repetition—A Negative Result

   • Uriel Feige*
   • Oleg Verbitsky†

   Original Paper Pages: 461 - 478

2. Transitive Edge Coloring of Graphs and Dimension of Lattices

   • András Gyárfás*

   Original Paper Pages: 479 - 496

3. Linear Codes and Character Sums

   • Nathan Linial*
   • Alex Samorodnitsky†

   Original Paper Pages: 497 - 522

4. Almost Sure Convergence of the Minimum Bipartite Matching Functional in Euclidean Space

   • J. H. Boutet de Monvel
   • O. C. Martin

   Original Paper Pages: 523 - 530

5. From Membership to Separation, a Simple Construction

   • Jean François Maurras

   Original Paper Pages: 531 - 536

6. Convex Embeddings and Bisections of 3-Connected Graphs¹

   • Hiroshi Nagamochi
   • Tibor Jordán
   • Toshihide Ibaraki

   Original Paper Pages: 537 - 554

7. Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus

   • Alexander Razborov*
   • Avi Wigderson†
   • Andrew Yao‡

   Original Paper Pages: 555 - 574

8. Perfect Matchings Versus Odd Cuts

   • Zoltán Szigeti

   Original Paper Pages: 575 - 589

9. On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree

   • Carsten Thomassen

   Original Paper Pages: 591 - 596