Author of the publication

Efficient Algorithms for k-Regret Minimizing Sets.

, , , and . SEA, volume 75 of LIPIcs, page 7:1-7:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Efficient Algorithms for k-Regret Minimizing Sets., , , and . SEA, volume 75 of LIPIcs, page 7:1-7:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Robust Proximity Search for Balls Using Sublinear Space., and . FSTTCS, volume 29 of LIPIcs, page 315-326. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Faster Approximation Algorithm for the k-Regret Minimizing Set and Related Problems., and . ALENEX, page 62-74. SIAM, (2018)Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space., and . SIAM J. Comput., 43 (4): 1486-1511 (2014)Parallelizable efficient large order multiple recursive generators., , , , , and . Parallel Comput., (September 2023)Space Exploration via Proximity Search., , , and . SoCG, volume 34 of LIPIcs, page 374-389. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)On the minimum edge size for 2-colorability and realizability of hypergraphs by axis-parallel rectangles.. CCCG, page 226-231. (2017)RTRA: Rapid Training of Regularization-based Approaches in Continual Learning., and . CoRR, (2023)Containment and Evasion in Stochastic Point Data., and . LATIN, volume 9644 of Lecture Notes in Computer Science, page 576-589. Springer, (2016)Most Likely Voronoi Diagrams in Higher Dimensions., , , and . FSTTCS, volume 65 of LIPIcs, page 31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)