Peyman Afshani

103 papers A* 26A 11B 3C 2Misc 1Journal 45Unranked 14
YearRankTypeTitle / Venue / Authors
2026 J jnl
Compatible Triangulations of Simple Polygons.
CoRR
Peyman Afshani, Boris Aronov, Kevin Buchin, Maike Buchin, Otfried Cheong, Katharina Klost, Carolin Rehs, Günter Rote
2026 J jnl
How many users have been here for a long time? Efficient solutions for counting long aggregated visits.
CoRR
Peyman Afshani, Rezaul Chowdhury, Inge Li Gørtz, Mayank Goswami, Francesco Silvestri, Mariafiore Tognon
2025 A* conf
A Cell Probe Lower Bound for the Predecessor Search Problem in PRAM.
SODA
Peyman Afshani, Nodari Sitchinava
2025 B conf
Circle-Segment Intersection Queries in Connected Geometric Graphs.
ISAAC
Peyman Afshani, Yannick Bosch, Sabine Storandt
2025 A* conf
Convexity Helps Iterated Search in 3D.
SoCG
Peyman Afshani, Yakov Nekrich, Frank Staals
2025 J jnl
Convexity Helps Iterated Search in 3D.
CoRR
Peyman Afshani, Yakov Nekrich, Frank Staals
2025 A conf
Property Testing of Curve Similarity.
ESA
Peyman Afshani, Maike Buchin, Anne Driemel, Marena Richter, Sampson Wong
2025 J jnl
Property Testing of Curve Similarity.
CoRR
Peyman Afshani, Maike Buchin, Anne Driemel, Marena Richter, Sampson Wong
2024 J jnl
Hierarchical categories in colored searching.
Comput. Geom.
Peyman Afshani, Rasmus Killmann, Kasper Green Larsen
2024 J jnl
On Semialgebraic Range Reporting.
Discret. Comput. Geom.
Peyman Afshani, Pingan Cheng
2024 A* conf
Optimal Coresets for Low-Dimensional Geometric Median.
ICML
Peyman Afshani, Chris Schwiegelshohn
2023 — conf
An Optimal Lower Bound for Simplex Range Reporting.
SOSA
Peyman Afshani, Pingan Cheng
2023 A* conf
Lower Bounds for Intersection Reporting Among Flat Objects.
SoCG
Peyman Afshani, Pingan Cheng
2023 J jnl
Lower Bounds for Intersection Reporting among Flat Objects.
CoRR
Peyman Afshani, Pingan Cheng
2023 J jnl
Lower Bounds for Semialgebraic Range Searching and Stabbing Problems.
J. ACM
Peyman Afshani, Pingan Cheng
2023 A* conf
On Range Summary Queries.
ICALP
Peyman Afshani, Pingan Cheng, Aniket Basu Roy, Zhewei Wei
2023 J jnl
On Range Summary Queries.
CoRR
Peyman Afshani, Pingan Cheng, Aniket Basu Roy, Zhewei Wei
2023 J jnl
Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions.
Comput. Geom.
Peyman Afshani, Rasmus Killmann
2022 J jnl
An Optimal Lower Bound for Simplex Range Reporting.
CoRR
Peyman Afshani, Pingan Cheng
2022 B conf
Hierarchical Categories in Colored Searching.
ISAAC
Peyman Afshani, Rasmus Killmann, Kasper Green Larsen
2022 J jnl
Hierarchical Categories in Colored Searching.
CoRR
Peyman Afshani, Rasmus Killmann, Kasper Green Larsen
2022 — conf
Locality-of-Reference Optimality of Cache-Oblivious Algorithms.
APOCS
Peyman Afshani, John Iacono, Varunkumar Jayapaul, Ben Karsin, Nodari Sitchinava
2022 A* conf
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem.
SoCG
Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang
2022 J jnl
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem.
CoRR
Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang
2022 A* conf
On Semialgebraic Range Reporting.
SoCG
Peyman Afshani, Pingan Cheng
2022 J jnl
On Semialgebraic Range Reporting.
CoRR
Peyman Afshani, Pingan Cheng
2021 A* conf
A Lower Bound for Dynamic Fractional Cascading.
SODA
Peyman Afshani
2021 C conf
Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency.
WAFR
Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang
2021 A conf
Centerpoint Query Authentication.
CIKM
Magnus Haxen, Morten Raeburn, Peyman Afshani, Panagiotis Karras
2021 A* conf
Lower Bounds for Semialgebraic Range Searching and Stabbing Problems.
SoCG
Peyman Afshani, Pingan Cheng
2021 — conf
Rectangle Stabbing and Orthogonal Range Reporting Lower Bounds in Moderate Dimensions.
CCCG
Peyman Afshani, Rasmus Killmann
2020 J jnl
2D Fractional Cascading on Axis-aligned Planar Subdivisions.
CoRR
Peyman Afshani, Pingan Cheng
2020 A* conf
2D Generalization of Fractional Cascading on Axis-aligned Planar Subdivisions.
FOCS
Peyman Afshani, Pingan Cheng
2020 J jnl
A Lower Bound for Dynamic Fractional Cascading.
CoRR
Peyman Afshani
2020 A* conf
A Lower Bound for Jumbled Indexing.
SODA
Peyman Afshani, Ingo van Duijn, Rasmus Killmann, Jesper Sindahl Nielsen
2020 J jnl
Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency.
CoRR
Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang
2020 J jnl
Lower Bounds for Semialgebraic Range Searching and Stabbing Problems.
CoRR
Peyman Afshani, Pingan Cheng
2020 B conf
Revisiting the Theory and Practice of Database Cracking.
EDBT
Fatemeh Zardbani, Peyman Afshani, Panagiotis Karras
2019 A* conf
A New Lower Bound for Semigroup Orthogonal Range Searching.
SoCG
Peyman Afshani
2019 J jnl
A New Lower Bound for Semigroup Orthogonal Range Searching.
CoRR
Peyman Afshani
2019 A conf
Fragile Complexity of Comparison-Based Algorithms.
ESA
Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava
2019 J jnl
Fragile Complexity of Comparison-Based Algorithms.
CoRR
Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava
2019 A* conf
Independent Range Sampling, Revisited Again.
SoCG
Peyman Afshani, Jeff M. Phillips
2019 J jnl
Independent Range Sampling, Revisited Again.
CoRR
Peyman Afshani, Jeff M. Phillips
2019 A* conf
Lower Bounds for Multiplication via Network Coding.
ICALP
Peyman Afshani, Casper Benjamin Freksen, Lior Kamma, Kasper Green Larsen
2019 J jnl
Lower Bounds for Multiplication via Network Coding.
CoRR
Peyman Afshani, Casper Benjamin Freksen, Lior Kamma, Kasper Green Larsen
2019 J jnl
The query complexity of a permutation-based variant of Mastermind.
Discret. Appl. Math.
Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn
2018 J jnl
An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization.
ACM J. Exp. Algorithmics
Peyman Afshani, Mark de Berg, Henri Casanova, Ben Karsin, Colin Lambrechts, Nodari Sitchinava, Constantinos Tsirogiannis
2018 A* conf
On the complexity of range searching among curves.
SODA
Peyman Afshani, Anne Driemel
2018 J jnl
Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges.
Algorithmica
Peyman Afshani, Konstantinos Tsakalidis
2018 J jnl
The Query Complexity of a Permutation-Based Variant of Mastermind.
CoRR
Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn
2017 A conf
An Efficient Algorithm for the 1D Total Visibility-Index Problem.
ALENEX
Peyman Afshani, Mark de Berg, Henri Casanova, Benjamin Karsin, Colin Lambrechts, Nodari Sitchinava, Constantinos Tsirogiannis
2017 A* conf
Cross-Referenced Dictionaries and the Limits of Write Optimization.
SODA
Peyman Afshani, Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Mayank Goswami, Meng-Tsung Tsai
2017 A conf
Independent Range Sampling, Revisited.
ESA
Peyman Afshani, Zhewei Wei
2017 J jnl
Instance-Optimal Geometric Algorithms.
J. ACM
Peyman Afshani, Jérémy Barbay, Timothy M. Chan
2017 J jnl
On the complexity of range searching among curves.
CoRR
Peyman Afshani, Anne Driemel
2017 A conf
Permuting and Batched Geometric Lower Bounds in the I/O Model.
ESA
Peyman Afshani, Ingo van Duijn
2016 A* conf
Applications of Incidence Bounds in Point Covering Problems.
SoCG
Peyman Afshani, Edvin Berglin, Ingo van Duijn, Jesper Sindahl Nielsen
2016 J jnl
Applications of incidence bounds in point covering problems.
CoRR
Peyman Afshani, Edvin Berglin, Ingo van Duijn, Jesper Sindahl Nielsen
2016 A* conf
Data Structure Lower Bounds for Document Indexing Problems.
ICALP
Peyman Afshani, Jesper Sindahl Nielsen
2016 J jnl
Data Structure Lower Bounds for Document Indexing Problems.
CoRR
Peyman Afshani, Jesper Sindahl Nielsen
2015 J jnl
Approximating the Simplicial Depth.
CoRR
Peyman Afshani, Donald R. Sheehy, Yannik Stein
2015 J jnl
Instance Optimal Geometric Algorithms.
CoRR
Peyman Afshani, Jérémy Barbay, Timothy M. Chan
2015 A conf
Sorting and Permuting without Bank Conflicts on GPUs.
ESA
Peyman Afshani, Nodari Sitchinava
2015 J jnl
Sorting and Permuting without Bank Conflicts on GPUs.
CoRR
Peyman Afshani, Nodari Sitchinava
2015 C conf
Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls.
TAMC
Wanbin Son, Peyman Afshani
2014 A* conf
Concurrent Range Reporting in Two-Dimensional Space.
SODA
Peyman Afshani, Cheng Sheng, Yufei Tao, Bryan T. Wilkinson
2014 — conf
Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM.
ICALP (1)
Peyman Afshani, Timothy M. Chan, Konstantinos Tsakalidis
2014 A* conf
Fast Computation of Output-Sensitive Maxima in a Word RAM.
SODA
Peyman Afshani
2014 — conf
I/O-Efficient Range Minima Queries.
SWAT
Peyman Afshani, Nodari Sitchinava
2014 A* conf
Optimal Deterministic Shallow Cuttings for 3D Dominance Ranges.
SODA
Peyman Afshani, Konstantinos Tsakalidis
2013 J jnl
(Approximate) Uncertain Skylines.
Theory Comput. Syst.
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips
2013 J jnl
Improved Pointer Machine and I/O Lower Bounds for Simplex Range Reporting and Related Problems.
Int. J. Comput. Geom. Appl.
Peyman Afshani
2013 J jnl
Property Testing on Linked Lists.
Electron. Colloquium Comput. Complex.
Peyman Afshani, Kevin Matulef, Bryan T. Wilkinson
2013 — conf
The Query Complexity of Finding a Hidden Permutation.
Space-Efficient Data Structures, Streams, and Algorithms
Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn
2012 — conf
Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model.
SCG
Peyman Afshani, Lars Arge, Kasper Green Larsen
2012 — conf
Improved pointer machine and I/O lower bounds for simplex range reporting and related problems.
SCG
Peyman Afshani
2012 A conf
Lower Bounds for Sorted Geometric Queries in the I/O Model.
ESA
Peyman Afshani, Norbert Zeh
2012 J jnl
The Deterministic and Randomized Query Complexity of a Simple Guessing Game.
Electron. Colloquium Comput. Complex.
Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Winzen, Kasper Green Larsen, Kurt Mehlhorn
2011 A conf
(Approximate) uncertain skylines.
ICDT
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips
2011 J jnl
Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space.
Discret. Comput. Geom.
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
2011 A* conf
Improved Space Bounds for Cache-Oblivious Range Reporting.
SODA
Peyman Afshani, Norbert Zeh
2011 A* conf
Ordered and Unordered Top-K Range Reporting in Large Data Sets.
SODA
Peyman Afshani, Gerth Stølting Brodal, Norbert Zeh
2010 J jnl
A general approach for cache-oblivious range reporting and approximate range counting.
Comput. Geom.
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
2010 — conf
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements.
SCG
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
2009 — conf
A general approach for cache-oblivious range reporting and approximate range counting.
SCG
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
2009 — conf
Cache-oblivious range reporting with optimal queries requires superlinear space.
SCG
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
2009 J jnl
Dynamic Connectivity for Axis-Parallel Rectangles.
Algorithmica
Peyman Afshani, Timothy M. Chan
2009 A* conf
Instance-Optimal Geometric Algorithms.
FOCS
Peyman Afshani, Jérémy Barbay, Timothy M. Chan
2009 J jnl
On Approximate Range Counting and Depth.
Discret. Comput. Geom.
Peyman Afshani, Timothy M. Chan
2009 A* conf
Optimal halfspace range reporting in three dimensions.
SODA
Peyman Afshani, Timothy M. Chan
2009 A* conf
Orthogonal Range Reporting in Three and Higher Dimensions.
FOCS
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
2008 J jnl
Approximation and inapproximability results for maximum clique of disc graphs in high dimensions.
Inf. Process. Lett.
Peyman Afshani, Hamed Hatami
2008 A conf
On Dominance Reporting in 3D.
ESA
Peyman Afshani
2008 — —
On Geometric Range Searching, Approximate Counting and Depth Problems.
Peyman Afshani
2007 J jnl
Approximation and Inapproximability Results for Maximum Clique of Disc Graphs in High Dimensions
CoRR
Peyman Afshani, Hamed Hatami
2007 — conf
Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull.
CCCG
Peyman Afshani, Arash Farzan
2007 — conf
On approximate range counting and depth.
SCG
Peyman Afshani, Timothy M. Chan
2007 Misc conf
On the Complexity of Finding an Unknown Cut Via Vertex Queries.
COCOON
Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigiv, Arash Farzan, Mehdi Mirzazadeh, Narges Simjour, Hamid Zarrabi-Zadeh
2006 A conf
Dynamic Connectivity for Axis-Parallel Rectangles.
ESA
Peyman Afshani, Timothy M. Chan
2005 — conf
Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs.
CCCG
Peyman Afshani, Timothy M. Chan
2005 J jnl
Circular chromatic index of graphs of maximum degree 3.
J. Graph Theory
Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari, Hamed Hatami, Ruzbeh Tusserkani, Xuding Zhu
2004 J jnl
On the spectrum of the forced matching number of graphs.
Australas. J Comb.
Peyman Afshani, Hamed Hatami, Ebadollah S. Mahmoodian