1. Introduction to special issue on randomized and derandomized algorithms

   • M. Luby

   OriginalPaper Pages: 359 - 366

2. Simulating BPP using a general weak random source

   • D. Zuckerman

   OriginalPaper Pages: 367 - 391

3. A mildly exponential approximation algorithm for the permanent

   • M. Jerrum
   • U. Vazirani

   OriginalPaper Pages: 392 - 401

4. On the number of Eulerian orientations of a graph

   • M. Mihail
   • P. Winkler

   OriginalPaper Pages: 402 - 414

5. On deterministic approximation of DNF

   • M. Luby
   • B. Veličković

   OriginalPaper Pages: 415 - 433

6. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions

   • N. Alon
   • M. Naor

   OriginalPaper Pages: 434 - 449

7. Randomized geometric algorithms and pseudorandom generators

   • K. Mulmuley

   OriginalPaper Pages: 450 - 463

8. Randomized search trees

   • R. Seidel
   • C. R. Aragon

   OriginalPaper Pages: 464 - 497

9. A subexponential bound for linear programming

   • J. Matoušek
   • M. Sharir
   • E. Welzl

   OriginalPaper Pages: 498 - 516

10. Efficient PRAM simulation on a distributed memory machine

    • R. M. Karp
    • M. Luby
    • F. Meyer auf der Heide

    OriginalPaper Pages: 517 - 542

11. A method for obtaining randomized algorithms with small tail probabilities

    • H. Alt
    • L. Guibas
    • A. Wigderson

    OriginalPaper Pages: 543 - 547