BARC talk by Aurélien Ooms

On Thursday 14 February, PhD student Aurélien Ooms, Algorithms Research Group, Université libre de Bruxelles, will give a talk "Sorting-like problems"


Sorting-like problems


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 is a PhD student in ULB’s Algorithms Research Group under the supervision of Jean Cardinal. His research interests include Computational Complexity, Data Structures, Algorithms, Sorting Problems and Computational Geometry.