Abstract is missing.
- Preface
- Foreword
- Simple randomized Mergesort on parallel disksRakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter. 1-20
- Randomized greedy algorithms for the hypergraph partitioning problemRoberto Battiti, Alan A. Bertossi, Romeo Rizzi. 21-36
- Elementary algebra revisited: Randomized algorithmsGene Cooperman, George Havas. 37-44
- Combinatorial property testing (a survey)Oded Goldreich. 45-60
- Randomized and deterministic local search for SAT and scheduling problemsJun Gu. 61-108
- An approximation scheme for scheduling of malleable parallel tasksKlaus Jansen. 109-122
- Blocking behaviors of broadcast switching networks in random trafficsDongsoo S. Kim. 123-132
- Greedy randomized adaptive search procedures for the Steiner problem in graphsSimone L. Martins, Panos M. Pardalos, Mauricio G. C. Resende, Celso C. Ribeiro. 133-146
- On the mixing time of the triangulation walk and other Catalan structuresLisa McShine, Prasad Tetali. 147-160
- Bayesian approach for randomization of heuristic algorithms of discrete programmingJonas Mockus, Audris Mockus, Linas Mockus. 161-178
- On the mixing rate of the triangulation walkMichael S. O. Molloy, Bruce A. Reed, William Steiger. 179-190
- kIgor Pak. 191-238
- Computing on optical modelsSanguthevar Rajasekaran. 239-250
- Manipulating statistical differenceAmit Sahai, Salil P. Vadhan. 251-270
- A survey of the role of multicommodity flow and randomization in network design and routingAravind Srinivasan. 271-302
- Some remarks on the optimal level of randomization in global optimizationTheodore V. Theodosopoulos. 303