# Biography

Aurélien Ooms completed his PhD at ULB’s Algorithms Research Group under the supervision of Jean Cardinal. He is now a Postdoc at KU’s BARC center working with Mikkel Abrahamsen. His research interests include Computational Complexity, Data Structures, Algorithms, Sorting Problems and Computational Geometry.

### Interests

• Computational Complexity
• Data Structures
• Algorithms
• Sorting Problems
• Computational Geometry

### Education

• PhD in Computer Science, 2019

Université libre de Bruxelles

• MSc in Optimization and Algorithms, 2015

Université libre de Bruxelles

• BSc in Computer Science, 2013

Université libre de Bruxelles

# Recent Publications

### Algorithms and Data Structures for 3SUM and Friends

PhD thesis revolving around 3SUM.

### Sparse Regression via Range Counting

The sparse regression problem, also known as best subset selection problem, can be cast as follows: Given a real $d \times n$ matrix …

### Encoding 3SUM

We consider the following problem: given three sets of real numbers, output a word-RAM data structure from which we can efficiently …

### Improved Bounds for Guarding Plane Graphs with Edges

An edge guard set of a plane graph G is a subset Γ of edges of G such that each face of G is incident on an endpoint of an edge in Γ. …

### Subquadratic Encodings for Point Configurations

For many algorithms dealing with sets of points in the plane, the only relevant information carried by the input is the combinatorial …

# Recent & Upcoming Talks

### 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 …

# Teaching

I was a teaching assistant for the Computability and Complexity (INFOF408) lectures at ULB from 2015 to 2019.