Author of the publication

Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model.

, and . FSTTCS, volume 122 of LIPIcs, page 45:1-45:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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

Complexity Analysis of Root Clustering for a Complex Polynomial., , , , and . ISSAC, page 71-78. ACM, (2016)Near optimal tree size bounds on a simple real root isolation algorithm., and . ISSAC, page 319-326. ACM, (2012)Bounds on absolute positiveness of multivariate polynomials., and . J. Symb. Comput., 45 (6): 617-628 (2010)Complexity of real root isolation using continued fractions.. Theor. Comput. Sci., 409 (2): 292-310 (2008)Robust Approximate Zeros., , and . ESA, volume 3669 of Lecture Notes in Computer Science, page 874-886. Springer, (2005)Robust Geometric Computation., and . Encyclopedia of Algorithms, (2016)A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration., , , and . CoRR, (2015)A Lower Bound for Computing Lagrange's Real Root Bound., and . CASC, volume 9890 of Lecture Notes in Computer Science, page 444-456. Springer, (2016)Complexity of a Root Clustering Algorithm., and . CoRR, (2019)Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model., and . FSTTCS, volume 122 of LIPIcs, page 45:1-45:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)