Concentration of Measure for Randomized Algorithms: Techniques and Analysis

[1]  Ketan Mulmuley.  Randomized multidimensional search trees: lazy balancing and dynamic shuffling , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[2]  David G. Kirkpatrick,et al.  Output-size sensitive algorithms for finding maximal vectors , 1985, SCG '85.

[3]  Devdatt P. Dubhashi,et al.  Balls and bins: A study in negative dependence , 1996, Random Struct. Algorithms.

[4]  John H. Reif,et al.  Optimal randomized parallel algorithms for computational geometry , 2005, Algorithmica.

[5]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[6]  Alessandro Panconesi,et al.  Nearly optimal distributed edge coloring in O (log log n ) rounds , 1997 .

[7]  R. B. Hayward,et al.  Large Deviations for Quicksort , 1996, J. Algorithms.

[8]  Binay K. Bhattacharya,et al.  On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm , 1997, J. Algorithms.

[9]  Colin McDiarmid,et al.  Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .

[10]  Ketan Mulmuley,et al.  Randomized Multidimensional Search Trees: Dynamic Sampling (Extended Abstract) , 1991, SCG.

[11]  Aravind Srinivasan,et al.  Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..

[12]  Kurt Mehlhorn,et al.  Dynamization of geometric data structures , 1985, SCG '85.

[13]  David R. Karger,et al.  An Õ(n2) algorithm for minimum cuts , 1993, STOC.

[14]  Devdatt P. Dubhashi,et al.  Probabilistic Recurrence Relations Revisited , 1997, Theor. Comput. Sci..

[15]  J. Steele.  Probability theory and combinatorial optimization , 1987 .

[16]  Mihir Bellare,et al.  Randomness-efficient oblivious sampling , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[17]  Sandeep Sen,et al.  Some Observations on Skip-Lists , 1991, Inf. Process. Lett..

[18]  Michael Luby.  Removing Randomness in Parallel Computation without a Processor Penalty , 1993, J. Comput. Syst. Sci..

[19]  Aravind Srinivasan,et al.  Chernoff-Hoeffding bounds for applications with limited independence , 1995, SODA '93.

[20]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[21]  Kenneth L. Clarkson,et al.  A Randomized Algorithm for Closest-Point Queries , 1988, SIAM J. Comput..

[22]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[23]  Ketan Mulmuley,et al.  Computational geometry : an introduction through randomized algorithms , 1993 .

[24]  Richard M. Karp,et al.  Probabilistic recurrence relations , 1994, JACM.

[25]  Kenneth L. Clarkson,et al.  New applications of random sampling in computational geometry , 1987, Discret. Comput. Geom..

[26]  Bruce A. Reed,et al.  A Bound on the Strong Chromatic Index of a Graph, , 1997, J. Comb. Theory B.

[27]  William Pugh,et al.  Skip lists: a probabilistic alternative to balanced trees , 1989, CACM.

[28]  Michael Luby.  A Simple Parallel Algorithm for the Maximal Independent Set Problem , 1986, SIAM J. Comput..

[29]  Sanguthevar Rajasekaran,et al.  Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms , 1989, SIAM J. Comput..

[30]  David R. Karger,et al.  Global min-cuts in RNC, and other ramifications of a simple min-out algorithm , 1993, SODA '93.

[31]  Sandeep Sen.  Fractional Cascading Revisited , 1995, J. Algorithms.

[32]  J. Reif,et al.  Parallel Tree Contraction Part 1: Fundamentals , 1989, Adv. Comput. Res..

[33]  Alessandro Panconesi,et al.  Near-Optimal, Distributed Edge Colouring via the Nibble Method , 1996, Theor. Comput. Sci..

[34]  Ketan Mulmuley.  Randomized multidimensional search trees (extended abstract): dynamic sampling , 1991, SCG '91.