| 359 | -- | 366 | Michael Luby. Introduction to Special Issue on Randomized and Derandomized Algorithms |
| 367 | -- | 391 | David Zuckerman. Simulating BPP Using a General Weak Random Source |
| 392 | -- | 401 | Mark Jerrum, Umesh V. Vazirani. A Mildly Exponential Approximation Algorithm for the Permanent |
| 402 | -- | 414 | Milena Mihail, Peter Winkler. On the Number of Eulerian Orientations of a Graph |
| 415 | -- | 433 | Michael Luby, Boban Velickovic. On Deterministic Approximation of DNF |
| 434 | -- | 449 | Noga Alon, Moni Naor. Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions |
| 450 | -- | 463 | Ketan Mulmuley. Randomized Geometric Algorithms and Pseudorandom Generators |
| 464 | -- | 497 | Raimund Seidel, Cecilia R. Aragon. Randomized Search Trees |
| 498 | -- | 516 | Jirí Matousek, Micha Sharir, Emo Welzl. A Subexponential Bound for Linear Programming |
| 517 | -- | 542 | Richard M. Karp, Michael Luby, Friedhelm Meyer auf der Heide. Efficient PRAM Simulation on a Distributed Memory Machine |
| 543 | -- | 547 | Helmut Alt, Leonidas J. Guibas, Kurt Mehlhorn, Richard M. Karp, Avi Wigderson. A Method for Obtaining Randomized Algorithms with Small Tail Probabilities |