论文信息 - A method for obtaining randomized algorithms with small tail probabilities - 字舞流文

A method for obtaining randomized algorithms with small tail probabilities

We study strategies for converting randomized algorithms of the Las Vegas type into randomized algorithms with small tail probabilities.

Leonidas J. Guibas | Kurt Mehlhorn | Richard M. Karp | Avi Wigderson | Helmut Alt | A. Wigderson | R. Karp | K. Mehlhorn | H. Alt | Leonidas J. Guibas

[1] Donald E. Knuth,et al. The Art of Computer Programming: Volume IV: Fascicle 2: Generating All Tuples and Permutations , 2005 .

[2] B. Monien,et al. Data structures and efficient algorithms , 1992, Lecture Notes in Computer Science.

[3] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[4] J. Wrench. Table errata: The art of computer programming, Vol. 2: Seminumerical algorithms (Addison-Wesley, Reading, Mass., 1969) by Donald E. Knuth , 1970 .

[5] P. J. Daniell,et al. Differential- und Integralrechnung , 1939 .

[6] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.