Q5881547

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
An optimal randomized algorithm for finding the saddlepoint	2026-05-26	Paper
A general technique for searching in implicit sets via function inversion Algorithmica	2026-05-08	Paper
An improved lower bound on the number of pseudoline arrangements	2025-11-24	Paper
Conditional lower bounds for dynamic geometric measure problems ACM Transactions on Algorithms	2025-07-22	Paper
Conditional lower bounds for dynamic geometric measure problems	2025-06-19	Paper
Time-optimal computation of the rectilinear convex hull with arbitrary orientation of sets of segments and circles Journal of Global Optimization	2025-05-14	Paper
A general technique for searching in implicit sets via function inversion	2024-05-29	Paper
The rectilinear convex hull of line segments	2024-05-29	Paper
How fast can we play Tetris greedily with rectangular pieces?	2024-05-16	Paper
How fast can we play Tetris greedily with rectangular pieces? Theoretical Computer Science	2024-03-05	Paper
Finding the saddlepoint faster than sorting	2023-10-25	Paper
An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility. (available as arXiv preprint)	2023-09-20	Paper
scientific article; zbMATH DE number 7662166 (Why is no real title available?) (available as arXiv preprint)	2023-03-10	Paper
An Optimal Randomized Algorithm for Finding the Saddlepoint (available as arXiv preprint)	N/A	Paper
An Improved Lower Bound on the Number of Pseudoline Arrangements (available as arXiv preprint)	N/A	Paper
Improved Lower Bound on the Number of Pseudoline Arrangements (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: