Peyman Afshani

2D Fractional Cascading on Axis-aligned Planar Subdivisions. / Afshani, Peyman; Cheng, Pingan.

61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020. IEEE Computer Society, 2021.

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

A Lower Bound for Dynamic Fractional Cascading. / Afshani, Peyman.

ACM-SIAM Symposium on Discrete Algorithms (SODA21). Association for Computing Machinery, 2021.

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. / Afshani, Peyman; de Berg, Mark; Buchin, Kevin; Gao, Jie; Loffler, Maarten; Nayyeri, Amir; Raichel, Benjamin; Sarkar, Rik; Wang, Haotian; Wang, Hao-Tsung.

Algorithmic Foundations of Robotics XIV-Part A: Proceedings of the Fourteenth Workshop on the Algorithmic Foundations of Robotics. ed. / S.M. LaValle; M. Lin; T. Ojala; D. Shell; J. Yu. Springer, 2021. (Springer Proceedings in Advanced Robotics).

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

A lower bound for jumbled indexing. / Afshani, Peyman; van Duijn, Ingo; Killmann, Rasmus; Nielsen, Jesper Sindahl.

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms. ed. / Shuchi Chawla. Association for Computing Machinery, 2020. p. 592-606.

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

Revisiting the theory and practice of database cracking. / Zardbani, Fatemeh; Afshani, Peyman; Karras, Panagiotis.

Advances in Database Technology - EDBT 2020: 23rd International Conference on Extending Database Technology, Proceedings. ed. / Angela Bonifati; Yongluan Zhou; Marcos Antonio Vaz Salles; Alexander Bohm; Dan Olteanu; George Fletcher; Arijit Khan; Bin Yang. openproceedings.org, 2020. p. 415-418 (Advances in Database Technology - EDBT, Vol. 2020-March).

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

A new lower bound for semigroup orthogonal range searching. / Afshani, Peyman.

35th International Symposium on Computational Geometry, SoCG 2019. ed. / Gill Barequet; Yusu Wang. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. 3 (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 129).

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

Fragile complexity of comparison-based algorithms. / Afshani, Peyman; Fagerberg, Rolf; Hammer, David; Jacob, Riko; Kostitsyna, Irina; Meyer, Ulrich; Penschuck, Manuel; Sitchinava, Nodari.

27th Annual European Symposium on Algorithms, ESA 2019. ed. / Michael A. Bender; Ola Svensson; Grzegorz Herman. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. 2 (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 144).

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

Independent range sampling, revisited again. / Afshani, Peyman; Phillips, Jeff M.

35th International Symposium on Computational Geometry, SoCG 2019. ed. / Gill Barequet; Yusu Wang. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. 4 (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 129).

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

Permuting and batched geometric lower bounds in the I/O model. / Afshani, Peyman; Van Duijn, Ingo.

25th European Symposium on Algorithms, ESA 2017. ed. / Kirk Pruhs; Christian Sohler. Vol. 87 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2017. p. 2:1-2:13 2 (Leibniz International Proceedings in Informatics, Vol. 87).

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

Cross-Referenced dictionaries and the limits of write optimization. / Afshani, Peyman; Bender, Michael A.; Farach-Colton, Martin; Fineman, Jeremy T.; Goswami, Mayank; Tsai, Meng Tsung.

28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. ed. / P.N. Klein . Association for Computing Machinery, 2017. p. 1523-1532.

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

Data Structure Lower Bounds for Document Indexing Problems. / Afshani, Peyman; Nielsen, Jesper Asbjørn Sindahl.

43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). ed. / Ioannis Chatzigiannakis; Michael Mitzenmacher; Yuval Rabani; Davide Sangiorgi. Vol. 55 Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2016. p. 93:1-93:15 (Leibniz International Proceedings in Informatics, Vol. 55).

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

Sorting and Permuting without Bank Conflicts on GPUs. / Afshani, Peyman; Sitchinava , Nodari .

Algorithms – ESA 2015: 23rd Annual European Symposium, Patras, Greece, September 14–16, 2015, Proceedings. ed. / Nikhil Bansal ; Irene Finocchi . Springer VS, 2015. p. 13-24 (Lecture Notes in Computer Science, Vol. 9294).

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls. / Son, Wanbin; Afshani, Peyman.

Theory and Applications of Models of Computation: 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings. ed. / Rahul Jain; Sanjay Jain; Frank Stephan. Springer VS, 2015. p. 189-199 (Lecture Notes in Computer Science LNCS, Vol. 9076).

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

Concurrent range reporting in two-dimensional space. / Afshani, Peyman; Sheng, Cheng; Tao, Yufei; Wilkinson, Bryan T.

Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2014; Portland, OR; United States; 5 January 2014 through 7 January 2014. ed. / Chandra Chekuri . Association for Computing Machinery, 2014. p. 983-994.

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

Fast Computation of Output-Sensitive Maxima in a Word RAM. / Afshani, Peyman.

Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2014; Portland, OR; United States; 5 January 2014 through 7 January 2014. ed. / Chandra Chekuri . Association for Computing Machinery, 2014. p. 1414-1423.

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

I/O-efficient range minima queries. / Afshani, Peyman; Sitchinava, Nodari.

Algorithm Theory – SWAT 2014: 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings. ed. / R. Ravi; Inge Li Gørtz. Springer VS, 2014. p. 1-12 (Lecture Notes in Computer Science, Vol. 8503).

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

Optimal deterministic shallow cuttings for 3D dominance ranges. / Afshani, Peyman; Tsakalidis, Konstantinos.

Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms: SODA 2014; Portland, OR; United States; 5 January 2014 through 7 January 2014. ed. / Chandra Chekuri . Association for Computing Machinery, 2014. p. 1389-1398 .

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM. / Afshani, Peyman; Chan, Timothy M.; Tsakalidis, Konstantinos.

Automata, Languages, and Programming: 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I. ed. / Javier Esparza ; Pierre Fraigniaud; Thore Husfeldt; Elias Koutsoupias. Springer VS, 2014. p. 77-88 (Lecture Notes in Computer Science, Vol. 8572).

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

The Query Complexity of Finding a Hidden Permutation. / Afshani, Peyman; Agrawal, Manindra; Benjamin, Doerr; Doerr, Carola; Larsen, Kasper Green; Mehlhorn, Kurt.

Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday. ed. / Andrej Brodnik; Alejandro López-Ortiz; Venkatesh Raman; Alfredo Viola. Springer VS, 2013. p. 1-11 (Lecture Notes in Computer Science, Vol. 8066).

Research output: Contribution to book/anthology/report/proceeding › Book chapter › Research › peer-review

Higher-dimensional Orthogonal Range Reporting and Rectangle Stabbing in the Pointer Machine Model. / Arge, Lars; Afshani, Peyman; Larsen, Kasper Green.

Proceedings of the 2012 Symposuim on Computational Geometry. Association for Computing Machinery, 2012. p. 323-338.

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review

Improved pointer machine and I/O lower bounds for simplex range reporting and related problems. / Afshani, Peyman.

Proceedings of the 2012 Symposuim on Computational Geometry, SoCG. Association for Computing Machinery, 2012. p. 339-346 .

Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review