Randomization methods in algorithm design : DIMACS workshop, December 12-14, 1997
Pãnos M. Pardalos, Sanguthevar Rajasekaran, Andrea Roli · American Mathematical Society eBooks · 1999
Simple randomized Mergesort on parallel disks by R. D. Barve, E. F. Grove, and J. S. Vitter Randomized greedy algorithms for the hypergraph partitioning problem by R. Battiti, A. Bertossi, and R. Rizzi Elementary algebra revisited: Randomized algorithms by G. Cooperman and G. Havas Combinatorial property testing (a survey) by O. Goldreich Randomized and deterministic local search for SAT and scheduling problems by J. Gu An approximation scheme for scheduling of malleable parallel tasks by K. Jansen Blocking behaviors of broadcast switching networks in random traffics by D. S. Kim Greedy randomized adaptive search procedures for the Steiner problem in graphs by S. L. Martins, P. M. Pardalos, M. G. C. Resende, and C. C. Ribeiro On the mixing time of the triangulation walk and other Catalan structures by L. McShine and P. Tetali Bayesian approach for randomization of heuristic algorithms of discrete programming by J. Mockus, A. Mockus, and L. Mockus On the mixing rate of the triangulation walk by M. Molloy, B. Reed, and W. Steiger When and how $n$ choose $k$ by I. Pak Computing on optical models by S. Rajasekaran Manipulating statistical difference by A. Sahai and S. Vadhan A survey of the role of multicommodity flow and randomization in network design and routing by A. Srinivasan Some remarks on the optimal level of randomization in global optimization by T. V. Theodosopoulos.