Author:
Abo-Khamis Mahmoud,Im Sungjin,Moseley Benjamin,Pruhs Kirk,Samadian Alireza
Reference12 articles.
1. Instance-optimal geometric algorithms;Afshani;J. Acm,2017
2. Alway, K., 2019. Domain Ordering and Box Cover Problems for Beyond Worst-Case Join Processing. Master’s thesis. University of Waterloo.
3. Alway, K., Blais, E., Salihoglu, S., 2019. Box covers and domain orderings for beyond worst-case join processing. CoRR abs/1909.12102.
4. A (slightly) faster algorithm for Klee’s measure problem;Chan;Computational Geometry,2010
5. Chan, T.M., 2013. Klee’s measure problem made easy, in: IEEE Symposium on Foundations of Computer Science, pp. 410–419.