Funder
Natur og Univers, Det Frie Forskningsråd
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference21 articles.
1. Afshani, P., Cheng, P.: Lower bounds for semialgebraic range searching and stabbing problems. In: 37th International Symposium on Computational Geometry (2021). Leibniz Int. Proc. Inform., vol. 189, # 8. Leibniz-Zent. Inform., Wadern (2021)
2. Afshani, P.: A new lower bound for semigroup orthogonal range searching. In: 35th International Symposium on Computational (Portland 2019). Leibniz Int. Proc. Inform., vol. 129, # 3. Leibniz-Zent. Inform., Wadern (2019)
3. Afshani, P.: Improved pointer machine and I/O lower bounds for simplex range reporting and related problems. In: 28th International Symposium on Computational Geometry (Chapel Hill 2012), pp. 339–346. ACM, New York (2012)
4. Agarwal, P.K.: Simplex range searching and its variants: a review. In: A Journey Through Discrete Mathematics, pp. 1–30. Springer, Cham (2017)
5. Agarwal, P.K., Aronov, B., Ezra, E., Zahl, J.: Efficient algorithm for generalized polynomial partitioning and its applications. SIAM J. Comput. 50(2), 760–787 (2021)