Combinatorial analysis of quicksort algorithm
P. Hennequin (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “On schemata and systems for parallel algorithms”
Combinatorial analysis of quicksort algorithm
The complexity of the travelling repairman problem
Foto Afrati, Stavros Cosmadakis, Christos H. Papadimitriou, George Papageorgiou, Nadia Papakostantinou (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A algorithm for projecting a vector on the intersection of a hyperplane and
Nelson Maculan, Michel Minoux, Gérard Plateau (1997)
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:
On the application of insertion techniques for job shop problems with setup times
Yuri N. Sotskov, Thomas Tautenhahn, Frank Werner (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
An algorithm for the solution of fixed-point equations for infinite words
Stephan Heilbrunner (1980)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Monotonous and randomized reductions to sparse sets
V. Arvind, J. Köbler, M. Mundhenk (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The theory of invertible algorithms
Gianni Aguzzi (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: