2 papers
cs.DS2026
A General Technique for Searching in Implicit Sets via Function Inversion
Boris Aronov, Jean Cardinal, Justin Dallant +1
In recent years, the Fiat-Naor function inversion scheme has been used to disprove conjectures in fine-grained complexity theory and design state of the art data structures for a n…
cs.CG2025
Improved Bound on the Number of Pseudoline Arrangements via the Zone Theorem
Justin Dallant
Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of…