Find

For students
For PhDs
For employees

Department of Computer Science

Publications

Aden-Ali, I., Høgsgaard, M. M., Larsen, K. G. & Zhivotovskiy, N. (2024). Majority-of-Three: The Simplest Optimal Learner? In Proceedings of Thirty Seventh Conference on Learning Theory (Vol. 247, pp. 22-45). PMLR. https://proceedings.mlr.press/v247/aden-ali24a.html

Afshani, P., Arge, L. A. & Larsen, K. D. (2009). Orthogonal Range Reporting in Three and Higher Dimensions. Symposium on Foundations of Computer Science. Annual Proceedings, 149-158. https://doi.org/10.1109/FOCS.2009.58

Afshani, P., Barbay, J. & Chan, T. M. (2009). Instance-optimal geometric algorithms. In 50th Annual Symposium on Foundations of Computer Science. Proceedings (pp. 129-138). IEEE Computer Society Press. https://doi.org/10.1109/FOCS.2009.34

Afshani, P., Hamilton, C. & Zeh, N. (2009). Cache-oblivious range reporting with optimal queries requires superlinear space. In Proceedings of the 25th annual symposium on Computational geometry (pp. 277-286). Association for Computing Machinery. https://doi.org/10.1145/1542362.1542412

Afshani, P., Hamilton, C. & Zeh, N. (2009). A general approach for cache-oblivious range reporting and approximate range counting. In Proceedings of the 25th annual symposium on Computational geometry Association for Computing Machinery. https://doi.org/10.1145/1542362.1542413

Afshani, P., Brodal, G. S. & Zeh, N. (2011). Ordered and Unordered Top-K Range Reporting in Large Data Sets. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algoritms. SODA 2011 (pp. 390-400). Society for Industrial and Applied Mathematics. http://www.siam.org/proceedings/soda/2011/SODA11_031_afshanip.pdf

Afshani, P., Arge, L. A. & Larsen, K. D. (2010). Orthogonal Range Reporting: Query Lower Bounds, Optimal Structures in 3-d, and Higher Dimensional Improvements. Annual A C M Symposium on Computational Geometry. Proceedings, 240-246. https://doi.org/10.1145/1810959.1811001

Afshani, P., Arge, L. A. & Larsen, K. D. (2010). I/O-efficient Orthogonal Range Reporting in Three and Higher Dimensions. Abstract from Workshop on Massive Data Algorithms, Snowbird, United States.

Afshani, P., Hamilton, C. & Zeh, N. (2010). A general approach for cache-oblivious range reporting and approximate range counting. Computational Geometry, 43(8), 700-712. https://doi.org/10.1016/j.comgeo.2010.04.003

Afshani, P. & Zeh, N. (2011). Improved Space Bounds for Cache-Oblivious Range Reporting. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 2011 (pp. 1745-1758). Society for Industrial and Applied Mathematics. http://www.siam.org/proceedings/soda/2011/SODA11_133_afshanip.pdf

Afshani, P., Agarwal, P. K., Arge, L. A., Larsen, K. G. & Phillips, J. M. (2011). (Approximate) Uncertain Skylines. In Proceedings of the 14th International Conference on Database Theory (pp. 186-196). Association for Computing Machinery. https://doi.org/10.1145/1938551.1938576

Afshani, P., Hamilton, C. & Zeh, N. (2011). Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space. Discrete & Computational Geometry, 45(4), 824-850. https://doi.org/10.1007/s00454-011-9347-7

Afshani, P. & Zeh, N. (2012). Lower Bounds for Sorted Geometric Queries in the I/O Model. Lecture Notes in Computer Science, 7501, 48-59 . https://doi.org/10.1007/978-3-642-33090-2_6

Afshani, P., Agarwal, P. K., Arge, L., Larsen, K. G. & Phillips, J. (2013). (Approximate) Uncertain Skylines. Theory of Computing Systems, 52(3), 342-366. https://doi.org/10.1007/s00224-012-9382-7

Afshani, P. (2012). Improved pointer machine and I/O lower bounds for simplex range reporting and related problems. In Proceedings of the 2012 Symposuim on Computational Geometry, SoCG (pp. 339-346 ). Association for Computing Machinery. https://doi.org/10.1145/2261250.2261301

Afshani, P., Afrawal, M., Benjamin, D., Larsen, K. G., Mehlhorn, K. & Winzen, C. (2012). The Query Complexity of Finding a Hidden Permutation. Electronic Colloquium on Computational Complexity, (TR12-087). http://eccc.hpi-web.de/report/2012/087/

Afshani, P., Matulef, K. & Wilkinson, B. T. (2013). Property Testing on Linked Lists. Electronic Colloquium on Computational Complexity, TR13-187. http://www.informatik.uni-trier.de/~ley/db/journals/eccc/eccc20.html

Afshani, P., Chan, T. M. & Tsakalidis, K. (2014). Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM. In J. Esparza , P. Fraigniaud, T. Husfeldt & E. Koutsoupias (Eds.), Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I (pp. 77-88 ). Springer VS. https://doi.org/10.1007/978-3-662-43948-7_7

Afshani, P., Agrawal, M., Benjamin, D., Doerr, C., Larsen, K. G. & Mehlhorn, K. (2013). The Query Complexity of Finding a Hidden Permutation. In A. Brodnik, A. López-Ortiz, V. Raman & A. Viola (Eds.), Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday (pp. 1-11). Springer VS. https://doi.org/10.1007/978-3-642-40273-9_1

Afshani, P., Sheng, C., Tao, Y. & Wilkinson, B. T. (2014). Concurrent range reporting in two-dimensional space. In C. Chekuri (Ed.), Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2014; Portland, OR; United States; 5 January 2014 through 7 January 2014 (pp. 983-994). Association for Computing Machinery. http://www.scopus.com/inward/record.url?scp=84902105500&partnerID=8YFLogxK

Afshani, P. & Tsakalidis, K. (2014). Optimal deterministic shallow cuttings for 3D dominance ranges. In C. Chekuri (Ed.), Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2014; Portland, OR; United States; 5 January 2014 through 7 January 2014 (pp. 1389-1398 ). Association for Computing Machinery. http://www.scopus.com/inward/record.url?scp=84902105500&partnerID=8YFLogxK

Afshani, P. (2014). Fast Computation of Output-Sensitive Maxima in a Word RAM. In C. Chekuri (Ed.), Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2014; Portland, OR; United States; 5 January 2014 through 7 January 2014 (pp. 1414-1423). Association for Computing Machinery. http://www.scopus.com/inward/record.url?scp=84902105500&partnerID=8YFLogxK

Afshani, P. & Sitchinava, N. (2014). I/O-efficient range minima queries. In R. Ravi & I. L. Gørtz (Eds.), Algorithm Theory – SWAT 2014: 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings (pp. 1-12). Springer VS. https://doi.org/10.1007/978-3-319-08404-6_1

Afshani, P. & Sitchinava , N. (2015). Sorting and Permuting without Bank Conflicts on GPUs. In N. Bansal & I. Finocchi (Eds.), Algorithms – ESA 2015: 23rd Annual European Symposium, Patras, Greece, September 14–16, 2015, Proceedings (pp. 13-24). Springer VS. https://doi.org/10.1007/978-3-662-48350-3_2

Afshani, P., Berglin, E., Van Duijn, I. & Nielsen, J. S. (2016). Applications of incidence bounds in point covering problems. In S. Fekete & A. Lubiw (Eds.), 32nd International Symposium on Computational Geometry, SoCG 2016 (Vol. 51, pp. 60.1-60.15). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2016.60

Afshani, P. & Nielsen, J. A. S. (2016). Data Structure Lower Bounds for Document Indexing Problems. In I. Chatzigiannakis, M. Mitzenmacher, Y. Rabani & D. Sangiorgi (Eds.), 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) (Vol. 55, pp. 93:1-93:15). Article 93 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2016.93

Afshani, P. & Tsakalidis, K. (2018). Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges. Algorithmica, 80(11), 3192-3206. https://doi.org/10.1007/s00453-017-0376-3

Afshani, P. & Van Duijn, I. (2017). Permuting and batched geometric lower bounds in the I/O model. In K. Pruhs & C. Sohler (Eds.), 25th European Symposium on Algorithms, ESA 2017 (Vol. 87, pp. 2:1-2:13). Article 2 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2017.2

Afshani, P. & Wei, Z. (2017). Independent range sampling, revisited. In K. Pruhs & C. Sohler (Eds.), 25th European Symposium on Algorithms, ESA 2017 (Vol. 87, pp. 3:1--3:14). Article 3 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2017.3

Afshani, P., De Berg, M., Casanova, H., Karsin, B., Lambrechts, C., Sitchinava, N. & Tsirogiannis, C. (2017). An efficient algorithm for the 1D total visibility-index problem. In S. Fekete & V. Ramachandran (Eds.), 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Vol. PRAL17, pp. 218-231). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974768.18

Afshani, P., Bender, M. A., Farach-Colton, M., Fineman, J. T., Goswami, M. & Tsai, M. T. (2017). Cross-Referenced dictionaries and the limits of write optimization. In P. N. Klein (Ed.), 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 (pp. 1523-1532). Association for Computing Machinery. https://doi.org/10.1137/1.9781611974782.99

Afshani, P. & Driemel, A. (2018). On the complexity of range searching among curves. In A. Czumaj (Ed.), 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 (pp. 898-917). Association for Computing Machinery. https://doi.org/10.1137/1.9781611975031.58

Afshani, P., De Berg, M., Casanova, H., Karsin, B., Lambrechts, C., Sitchinava, N. & Tsirogiannis, C. (2018). An efficient algorithm for the 1D total visibility-index problem and its parallelization. ACM Journal of Experimental Algorithmics, 23, Article 2.3. https://doi.org/10.1145/3209685

Afshani, P., Agrawal, M., Doerr, B., Doerr, C., Larsen, K. G. & Mehlhorn, K. (2019). The query complexity of a permutation-based variant of Mastermind. Discrete Applied Mathematics, 260, 28-50. https://doi.org/10.1016/j.dam.2019.01.007

Afshani, P. & Phillips, J. M. (2019). Independent range sampling, revisited again. In G. Barequet & Y. Wang (Eds.), 35th International Symposium on Computational Geometry, SoCG 2019 Article 4 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2019.4

Afshani, P., Freksen, C. B., Kamma, L. & Larsen, K. G. (2019). Lower bounds for multiplication via network coding. Leibniz International Proceedings in Informatics, LIPIcs, 132, Article 10. https://doi.org/10.4230/LIPIcs.ICALP.2019.10

Afshani, P. (2019). A new lower bound for semigroup orthogonal range searching. In G. Barequet & Y. Wang (Eds.), 35th International Symposium on Computational Geometry, SoCG 2019 Article 3 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2019.3

Afshani, P., Fagerberg, R., Hammer, D., Jacob, R., Kostitsyna, I., Meyer, U., Penschuck, M. & Sitchinava, N. (2019). Fragile complexity of comparison-based algorithms. In M. A. Bender, O. Svensson & G. Herman (Eds.), 27th Annual European Symposium on Algorithms, ESA 2019 Article 2 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2019.2

Afshani, P., van Duijn, I., Killmann, R. & Nielsen, J. S. (2020). A lower bound for jumbled indexing. In S. Chawla (Ed.), Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (pp. 592-606). Association for Computing Machinery. https://doi.org/10.1137/1.9781611975994.36

Afshani, P. & Cheng, P. (2020). 2D generalization of fractional cascading on axis-aligned planar subdivisions. In Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020 (pp. 716-727). Article 9317953 IEEE Computer Society. https://doi.org/10.1109/FOCS46700.2020.00072

Afshani, P. (2021). A Lower Bound for Dynamic Fractional Cascading. In ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 (pp. 2229-2248). Association for Computing Machinery. https://doi.org/10.5555/3458064.3458197

Afshani, P., de Berg, M., Buchin, K., Gao, J., Loffler, M., Nayyeri, A., Raichel, B., Sarkar, R., Wang, H. & Wang, H.-T. (2021). Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. In S. M. LaValle, M. Lin, T. Ojala, D. Shell & J. Yu (Eds.), Algorithmic Foundations of Robotics XIV-Part A: Proceedings of the Fourteenth Workshop on the Algorithmic Foundations of Robotics (pp. 107-123). Springer. https://doi.org/10.1007/978-3-030-66723-8_7

Afshani, P. & Cheng, P. (2021). Lower bounds for semialgebraic range searching and stabbing problems. In K. Buchin & E. C. de Verdiere (Eds.), 37th International Symposium on Computational Geometry, SoCG 2021 Article 8 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2021.8

Afshani, P., de Berg, M., Buchin, K., Gao, J., Löffler, M., Nayyeri, A., Raichel, B., Sarkar, R., Wang, H. & Yang, H. T. (2022). On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry, SoCG 2022 Article 2 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2022.2

Afshani, P. & Cheng, P. (2022). On Semialgebraic Range Reporting. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry, SoCG 2022 Article 3 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2022.3

Afshani, P., Killmann, R. & Larsen, K. G. (2022). Hierarchical Categories in Colored Searching. In S. W. Bae & H. Park (Eds.), 33rd International Symposium on Algorithms and Computation, ISAAC 2022 Article 25 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ISAAC.2022.25

Afshani, P., Iacono, J., Jayapaul, V., Karsin, B. & Sitchinava , N. (2022). Locality-of-Reference Optimality of Cache-Oblivious Algorithms. In 3rd Symposium on Algorithmic Principles of Computer Systems, (APOCS) (pp. 31 - 45). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977059.3

Afshani, P. & Killmann, R. (2023). Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions. Computational Geometry: Theory and Applications, 111, Article 101959. https://doi.org/10.1016/j.comgeo.2022.101959

Afshani, P. & Cheng, P. (2023). Lower Bounds for Semialgebraic Range Searching and Stabbing Problems. Journal of the ACM, 70(2), 1-26. Article 16. https://doi.org/10.1145/3578574

Afshani, P., Cheng, P., Basu Roy, A. & Wei, Z. (2023). On Range Summary Queries. In K. Etessami, U. Feige & G. Puppis (Eds.), 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) (pp. 7:1-7:17). Article 7 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2023.7

Displaying results 1 to 50 out of 451

1

Revised 01.09.2025