Justin Dallant

Publication Activity (10 Years)

Years Active: 2020-2024
Publications (10 Years): 22

Top Topics

Randomized Algorithm

Top Venues

Publications

Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono
A General Technique for Searching in Implicit Sets via Function Inversion. SOSA (2024)
Justin Dallant, John Iacono
How fast can we play Tetris greedily with rectangular pieces? Theor. Comput. Sci. 992 (2024)
Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
An Optimal Randomized Algorithm for Finding the Saddlepoint. CoRR (2024)
Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
Finding the saddlepoint faster than sorting. SOSA (2024)
Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner, Manfred Scheucher
An Improved Lower Bound on the Number of Pseudoline Arrangements. CoRR (2024)
Fernando Cortés Kühnast, Justin Dallant, Stefan Felsner, Manfred Scheucher
An Improved Lower Bound on the Number of Pseudoline Arrangements. SoCG (2024)
Justin Dallant
Improved Lower Bound on the Number of Pseudoline Arrangements. CoRR (2024)
Justin Dallant, Frederik Haagensen, Riko Jacob, László Kozma, Sebastian Wild
Finding the saddlepoint faster than sorting. CoRR (2023)
Boris Aronov, Jean Cardinal, Justin Dallant, John Iacono
A General Technique for Searching in Implicit Sets via Function Inversion. CoRR (2023)
Carlos Alegría, Justin Dallant, Pablo Pérez-Lantero, Carlos Seara
The Rectilinear Convex Hull of Line Segments. FCT (2023)
Gerth Stølting Brodal, John Iacono, László Kozma, Vijaya Ramachandran, Justin Dallant
Scalable Data Structures (Dagstuhl Seminar 23211). Dagstuhl Reports 13 (5) (2023)
Justin Dallant, John Iacono
How Fast Can We Play Tetris Greedily with Rectangular Pieces? FUN (2022)
Justin Dallant, John Iacono
How Fast Can We Play Tetris Greedily With Rectangular Pieces? CoRR (2022)
Justin Dallant, Patrick Schnider
Efficiently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem. Comput. Geom. Topol. 1 (1) (2022)
Justin Dallant, John Iacono
Conditional Lower Bounds for Dynamic Geometric Measure Problems. ESA (2022)
Justin Dallant, Patrick Schnider
Effciently Stabbing Convex Polygons and Variants of the Hadwiger-Debrunner (p, q)-Theorem. CCCG (2021)
Jean Cardinal, Justin Dallant, John Iacono
An Instance-optimal Algorithm for Bichromatic Rectangular Visibility. CoRR (2021)
Justin Dallant, John Iacono
Conditional Lower Bounds for Dynamic Geometric Measure Problems. CoRR (2021)
Jean Cardinal, Justin Dallant, John Iacono
An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. ESA (2021)
Jean Cardinal, Justin Dallant, John Iacono
Approximability of (Simultaneous) Class Cover for Boxes. CoRR (2021)
Jean Cardinal, Justin Dallant, John Iacono
Approximability of (Simultaneous) Class Cover for Boxes. CCCG (2021)
Justin Dallant, Patrick Schnider
Efficiently stabbing convex polygons and variants of the Hadwiger-Debrunner (p, q)-theorem. CoRR (2020)