Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling.
Efficient Improvement of Brain-Tharp's Algorithm
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
Exact bounds on the complexity of sequential string matching algorithms. (Des bornes exactes de la complexité des algorithmes séquentiels de recherche d'un motif.)
Exhaustive List-Scheduling Heuristic for Dense Task Graphs