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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A new approach in mixed distributions detection”
Combinatorial analysis of quicksort algorithm
Criterion of maximizing the expected quietness (invariant by homotethies in relation to the utilities)
M. A. Gil Alvarez (1982)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Analysis of quickselect : an algorithm for order statistics
Hosam M. Mahmoud, Reza Modarres, Robert T. Smythe (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Sample density as the function-estimate of population's distribution
Jan Mikiewicz (1982)
Statistique et analyse des données
Similarity:
On schemata and systems for parallel algorithms
Georg Gati (1979)
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:
Simulated annealing algorithm for the minimum weighted perfect euclidean matching problem
Jean-Luc Lutton, Ernesto Bonomi (1986)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Two methods for multicriteria hierarchization of discrete alternatives
Gheorghe Păun (1984)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
An almost naive algorithm for finding relative neighbourhood graphs in metrics
Jyrki Katajainen, Olli Nevalainen (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: