Combinatorial analysis of quicksort algorithm
P. Hennequin (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Analysis of quickselect : an algorithm for order statistics”
Combinatorial analysis of quicksort algorithm
A limit theorem for “quicksort”
Uwe Rösler (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the median-of- version of Hoare’s selection algorithm
Rudolf Grübel (1999)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the average case complexity of some P-complete problems
Maria Serna, Fatos Xhafa (1999)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A new approach in mixed distributions detection
E. Diday, A. Schroeder (1976)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Comments on the analysis of parameters in a Random Graph Model
Helmut Prodinger (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Probabilistic bounds on one step objective/potential function improvement in Karmarkar's algorithm
M. Minoux (1994)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: