See this document in CiteSeerX!

Sorting With Unreliable Comparisons: A Probabilistic Analysis  (Make Corrections)  
Laurent Alonso, Philippe Chassaing, Florent Gillet, Svante Janson, Edward M. Reingold, René Schott



  Home/Search   Context   Related

 
View or download:
math.uu.se/%7Esvant...sj153_QSerror.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  math.uu.se/research/p...preprints (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We provide a probabilistic analysis of the output of Quicksort when comparisons can err. (Update)

Active bibliography (related documents):   More   All
0.2:   Density Approximation and Exact Simulation of Random.. - Devroye, Neininger (2002)   (Correct)
0.2:   Exact Simulation of Random Variables that are Solutions of.. - Devroye, Neininger (2001)   (Correct)
0.1:   Unknown -   (Correct)

Similar documents based on text:   More   All
0.3:   Enhanced Ticket-Based QoS Routing Algorithms - Xiao (2002)   (Correct)
0.3:   An asymptotic theory for Cauchy-Euler differential equations.. - Chern, Hwang (2002)   (Correct)
0.3:   Applications of Global Optimization to Process and.. - Sahinidis, Tawarmalani   (Correct)

BibTeX entry:   (Update)

@misc{ alonso-sorting,
  author = "Laurent Alonso and Philippe Chassaing and Florent Gillet and Svante Janson
    and Edward M. Reingold and Ren\'e Schott",
  title = "Sorting With Unreliable Comparisons: A Probabilistic Analysis",
  url = "citeseer.ist.psu.edu/582981.html" }
Citations (may not include all citations):
23   On growing random binary trees (context) - Pittel - 1984
19   Oxford University Press (context) - Kingman, processes - 1993
15   The contraction method for recursive algorithms - Rosler, Ruschendorf
13   A limit theorem (context) - Rosler - 1991
10   Uniform convergence of martingales in the branching random w.. (context) - Biggins - 1992
10   Asymptotic distribution theory for Hoare's selection algorit.. (context) - Gruber, Rosler - 1996
1   The Art of Computer Programmi#21 Vol (context) - Knuth - 1986
1   of random search trees (context) - Mahmoud - 1992
1   to probabi#729 theory and i#dappli# ati#i#8 Vol (context) - Feller, oducti - 1971
1   and theStabi#801 of Stochasti# Models (context) - Rachev, Metri - 1991
1   ot-Checkers (context) - Ergun, Kannan et al. - 2000

Documents on the same site (http://www.math.uu.se/research/pub/preprints.html):   More
Random Assignment with Integer Costs - Parviainen (2001)   (Correct)
Empty confidence sets for epidemics, branching processes.. - Ball, Britton, O'Neill (2001)   (Correct)
Lower and Upper Bounds for the Time Constant of First-Passage .. - Alm, Parviainen (2001)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC