Sorting-like Problems

Abstract

Sorting is a well understood problem in the sense that we have been able to design efficient algorithms to solve it in various models of computation. I will talk about simple generalizations of sorting that are not so well understood. This presentation is based on work in my thesis.

Aurélien Ooms

My research interests include Computational Complexity, Data Structures, Algorithms, Sorting Problems and Computational Geometry.