Uwe Rösler  Home/Search
Context
Related
| cecm.sfu.ca/mirror/INRIA/a...roesler.ps algo.inria.fr/AofA/Researc...roesler.ps pauillac.inria.fr/algo/Aof...roesler.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cecm.sfu.ca/mirror/INRIA/...1198 (more) From: algo.inria.fr/AofA/Resear...1198 (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper develops general tools for the analysis of stochastic divide and conquer algorithms. We concentrate on the average performance and the distribution of the running time of the algorithm. As a special example we analyse the average performance and the running time distribution of the 2K + 1-median version of QUICKSORT. 1 Introduction Divide and conquer algorithms are characterized by recursive calls of the same algorithm on a lower level. After a finite time the algorithm terminates.... (Update)
Similar documents (at the sentence level):
55.5%: On the Analysis of Stochastic Divide and Conquer Algorithms. - Rösler (1999) (Correct)
Active bibliography (related documents): More All
0.9: The Contraction Method for Recursive Algorithms - Rösler, Rüschendorf (1999) (Correct)
0.8: A Limit Theorem for "Quicksort" - Rösler (1999) (Correct)
0.6: On a Multivariate Contraction Method for Random Recursive.. - Neininger (2001) (Correct)
Similar documents based on text: More All
0.2: A Model Form For Exact ... Metrics - Joshi (Correct)
0.1: The fifth International Seminar on the Mathematical.. - June Bellaterra Spain (Correct)
0.1: Object-Oriented Frameworks - Concepts And Implementations - Mätzel (Correct)
BibTeX entry: (Update)
@misc{ sler-analysis,
author = "Uwe Rösler",
title = "On the Analysis of Stochastic Divide and Conquer Algorithms.",
url = "citeseer.ist.psu.edu/104264.html" }
Citations (may not include all citations):2003 The art of computer programming (context) - Knuth - 1973
97 Computer Journal (context) - Hoare - 1962
48 Some asymptotic theory for the bootstrap (context) - Bickel, Freedman - 1981
26 Communications of the Association for Computing Machinery (context) - Hoare - 1961
20 The analysis of Quicksort programs (context) - Sedgewick - 1977
13 Total path length for random recursive trees - Dobrow, Fill
10 Asymptotic distribution theory for Hoare's selection algorit.. (context) - Grubel, Rosler - 1996
10 Stochastic Processes and their Applications (context) - Rosler - 1992
8 Increasing the Efficiency of Quicksort (context) - van Emden - 1970
7 Lecture Notes in Computer Science (context) - Flajolet - 1992
6 Advances in Applied Probability (context) - Rachev, Ruschendorf - 1995
5 the invariance principle for sums of independent identically.. (context) - Major - 1978
5 Berichtsreihe des Mathematischen Seminars Kiel (context) - Rosler - 1998
5 Berichtsreihe des Mathematischen Seminars Kiel (context) - Rosler - 1998
4 Informatique th'eorique et Applications/Theoretical Informat.. (context) - Rosler - 1991
3 Informatique th'eorique et Applications/Theoretical Informat.. (context) - Hennequin - 1989
3 Eine Methode zur asymptotischen Behandlung einer Klasse von .. (context) - Bruhn - 1996
3 Strong Concentration for Quicksort (context) - McDiarmid, Hayward - 1992
2 The moment of FIND Journal of Applied Probability (context) - Paulsen - 1997
2 Analyse von Quicksort-Varianten (context) - Bertram-Kretzberg - 1991
1 An Introduction to the Analysis of Algorithms by Sedgewick a.. (context) - Sedgewick, Flajolet - 1996
Documents on the same site (http://www.cecm.sfu.ca/mirror/INRIA/algo/AofA/Research/11-98.html):
On the Internal Path Length of d-dimensional Quad Trees - Neininger, Rüschendorf (1999) (Correct)
Convergence of Two-Dimensional Branching Recursions - Cramer, Rüschendorf (1998) (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