Geometry Seminar

---

Recent Results on Semialgebraic Range Searching Lower Bounds

Speaker: Peyman Afshani, Aarhus University

Location: Online

Date: Tuesday, February 6, 2024, 2 p.m.

Synopsis:

In this talk, we will survey some of the new data structure lower bounds that we have obtained for semialgebraic range searching problems, solving some major open problems in the area. The goal is to have a broad introduction to the basic tools and techniques rather than technical details and the hope is to demystify such data structure lower bounds. We will finish with a number of interesting open problems which will hopefully be a motivating factor in obtaining further lower bounds in the future!

Notes:

A mix of in person and remote presentations; both types are live-streamed on Zoom and recorded.
In-person and remote talks are at different times.
See mailing list announcements for Zoom details or contact Boris Aronov.