default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeyman Afshani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2008
[b1]Peyman Afshani:
On Geometric Range Searching, Approximate Counting and Depth Problems. University of Waterloo, Ontario, Canada, 2008
Journal Articles
- 2024
- [j17]Peyman Afshani, Rasmus Killmann, Kasper Green Larsen:
Hierarchical categories in colored searching. Comput. Geom. 121: 102090 (2024) - [j16]Peyman Afshani, Pingan Cheng
:
On Semialgebraic Range Reporting. Discret. Comput. Geom. 71(1): 4-39 (2024) - 2023
- [j15]Peyman Afshani, Rasmus Killmann:
Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions. Comput. Geom. 111: 101959 (2023) - [j14]Peyman Afshani, Pingan Cheng:
Lower Bounds for Semialgebraic Range Searching and Stabbing Problems. J. ACM 70(2): 16:1-16:26 (2023) - 2019
- [j13]Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn:
The query complexity of a permutation-based variant of Mastermind. Discret. Appl. Math. 260: 28-50 (2019) - 2018
- [j12]Peyman Afshani, Konstantinos Tsakalidis:
Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges. Algorithmica 80(11): 3192-3206 (2018) - [j11]Peyman Afshani, Mark de Berg, Henri Casanova, Ben Karsin, Colin Lambrechts, Nodari Sitchinava, Constantinos Tsirogiannis:
An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization. ACM J. Exp. Algorithmics 23 (2018) - 2017
- [j10]Peyman Afshani, Jérémy Barbay, Timothy M. Chan:
Instance-Optimal Geometric Algorithms. J. ACM 64(1): 3:1-3:38 (2017) - 2013
- [j9]Peyman Afshani:
Improved Pointer Machine and I/O Lower Bounds for Simplex Range Reporting and Related Problems. Int. J. Comput. Geom. Appl. 23(4-5): 233-252 (2013) - [j8]Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips:
(Approximate) Uncertain Skylines. Theory Comput. Syst. 52(3): 342-366 (2013) - 2011
- [j7]Peyman Afshani, Chris H. Hamilton, Norbert Zeh:
Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space. Discret. Comput. Geom. 45(4): 824-850 (2011) - 2010
- [j6]Peyman Afshani, Chris H. Hamilton, Norbert Zeh:
A general approach for cache-oblivious range reporting and approximate range counting. Comput. Geom. 43(8): 700-712 (2010) - 2009
- [j5]Peyman Afshani, Timothy M. Chan:
Dynamic Connectivity for Axis-Parallel Rectangles. Algorithmica 53(4): 474-487 (2009) - [j4]Peyman Afshani, Timothy M. Chan:
On Approximate Range Counting and Depth. Discret. Comput. Geom. 42(1): 3-21 (2009) - 2008
- [j3]Peyman Afshani, Hamed Hatami:
Approximation and inapproximability results for maximum clique of disc graphs in high dimensions. Inf. Process. Lett. 105(3): 83-87 (2008) - 2005
- [j2]Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari, Hamed Hatami, Ruzbeh Tusserkani, Xuding Zhu:
Circular chromatic index of graphs of maximum degree 3. J. Graph Theory 49(4): 325-335 (2005) - 2004
- [j1]Peyman Afshani, Hamed Hatami, Ebadollah S. Mahmoodian:
On the spectrum of the forced matching number of graphs. Australas. J Comb. 30: 147-160 (2004)
Conference and Workshop Papers
- 2024
- [c53]Peyman Afshani, Chris Schwiegelshohn:
Optimal Coresets for Low-Dimensional Geometric Median. ICML 2024 - 2023
- [c52]Peyman Afshani, Pingan Cheng:
Lower Bounds for Intersection Reporting Among Flat Objects. SoCG 2023: 3:1-3:16 - [c51]Peyman Afshani, Pingan Cheng, Aniket Basu Roy, Zhewei Wei:
On Range Summary Queries. ICALP 2023: 7:1-7:17 - [c50]Peyman Afshani, Pingan Cheng:
An Optimal Lower Bound for Simplex Range Reporting. SOSA 2023: 272-277 - 2022
- [c49]Peyman Afshani, John Iacono, Varunkumar Jayapaul, Ben Karsin, Nodari Sitchinava:
Locality-of-Reference Optimality of Cache-Oblivious Algorithms. APOCS 2022: 31-45 - [c48]Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang:
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. SoCG 2022: 2:1-2:14 - [c47]Peyman Afshani, Pingan Cheng:
On Semialgebraic Range Reporting. SoCG 2022: 3:1-3:14 - [c46]Peyman Afshani, Rasmus Killmann, Kasper Green Larsen:
Hierarchical Categories in Colored Searching. ISAAC 2022: 25:1-25:15 - 2021
- [c45]Peyman Afshani, Rasmus Killmann:
Rectangle Stabbing and Orthogonal Range Reporting Lower Bounds in Moderate Dimensions. CCCG 2021: 167-174 - [c44]Magnus Haxen, Morten Raeburn, Peyman Afshani, Panagiotis Karras:
Centerpoint Query Authentication. CIKM 2021: 3083-3087 - [c43]Peyman Afshani, Pingan Cheng:
Lower Bounds for Semialgebraic Range Searching and Stabbing Problems. SoCG 2021: 8:1-8:15 - [c42]Peyman Afshani:
A Lower Bound for Dynamic Fractional Cascading. SODA 2021: 2229-2248 - [c41]Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang:
Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. WAFR 2021: 107-123 - 2020
- [c40]Fatemeh Zardbani, Peyman Afshani, Panagiotis Karras:
Revisiting the Theory and Practice of Database Cracking. EDBT 2020: 415-418 - [c39]Peyman Afshani, Pingan Cheng:
2D Generalization of Fractional Cascading on Axis-aligned Planar Subdivisions. FOCS 2020: 716-727 - [c38]Peyman Afshani, Ingo van Duijn, Rasmus Killmann, Jesper Sindahl Nielsen:
A Lower Bound for Jumbled Indexing. SODA 2020: 592-606 - 2019
- [c37]Peyman Afshani:
A New Lower Bound for Semigroup Orthogonal Range Searching. SoCG 2019: 3:1-3:14 - [c36]Peyman Afshani, Jeff M. Phillips:
Independent Range Sampling, Revisited Again. SoCG 2019: 4:1-4:13 - [c35]Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava:
Fragile Complexity of Comparison-Based Algorithms. ESA 2019: 2:1-2:19 - [c34]Peyman Afshani, Casper Benjamin Freksen, Lior Kamma, Kasper Green Larsen:
Lower Bounds for Multiplication via Network Coding. ICALP 2019: 10:1-10:12 - 2018
- [c33]Peyman Afshani, Anne Driemel:
On the complexity of range searching among curves. SODA 2018: 898-917 - 2017
- [c32]Peyman Afshani, Mark de Berg, Henri Casanova, Benjamin Karsin, Colin Lambrechts, Nodari Sitchinava, Constantinos Tsirogiannis:
An Efficient Algorithm for the 1D Total Visibility-Index Problem. ALENEX 2017: 218-231 - [c31]Peyman Afshani, Ingo van Duijn:
Permuting and Batched Geometric Lower Bounds in the I/O Model. ESA 2017: 2:1-2:13 - [c30]Peyman Afshani, Zhewei Wei:
Independent Range Sampling, Revisited. ESA 2017: 3:1-3:14 - [c29]Peyman Afshani, Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Mayank Goswami, Meng-Tsung Tsai:
Cross-Referenced Dictionaries and the Limits of Write Optimization. SODA 2017: 1523-1532 - 2016
- [c28]Peyman Afshani, Edvin Berglin, Ingo van Duijn, Jesper Sindahl Nielsen:
Applications of Incidence Bounds in Point Covering Problems. SoCG 2016: 60:1-60:15 - [c27]Peyman Afshani, Jesper Sindahl Nielsen:
Data Structure Lower Bounds for Document Indexing Problems. ICALP 2016: 93:1-93:15 - 2015
- [c26]Peyman Afshani, Nodari Sitchinava:
Sorting and Permuting without Bank Conflicts on GPUs. ESA 2015: 13-24 - [c25]Wanbin Son, Peyman Afshani:
Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls. TAMC 2015: 189-199 - 2014
- [c24]Peyman Afshani, Timothy M. Chan, Konstantinos Tsakalidis:
Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM. ICALP (1) 2014: 77-88 - [c23]Peyman Afshani, Cheng Sheng, Yufei Tao, Bryan T. Wilkinson:
Concurrent Range Reporting in Two-Dimensional Space. SODA 2014: 983-994 - [c22]Peyman Afshani, Konstantinos Tsakalidis:
Optimal Deterministic Shallow Cuttings for 3D Dominance Ranges. SODA 2014: 1389-1398 - [c21]Peyman Afshani:
Fast Computation of Output-Sensitive Maxima in a Word RAM. SODA 2014: 1414-1423 - [c20]Peyman Afshani, Nodari Sitchinava:
I/O-Efficient Range Minima Queries. SWAT 2014: 1-12 - 2013
- [c19]Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn:
The Query Complexity of Finding a Hidden Permutation. Space-Efficient Data Structures, Streams, and Algorithms 2013: 1-11 - 2012
- [c18]Peyman Afshani, Lars Arge, Kasper Green Larsen:
Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model. SCG 2012: 323-332 - [c17]Peyman Afshani:
Improved pointer machine and I/O lower bounds for simplex range reporting and related problems. SCG 2012: 339-346 - [c16]Peyman Afshani, Norbert Zeh:
Lower Bounds for Sorted Geometric Queries in the I/O Model. ESA 2012: 48-59 - 2011
- [c15]Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasper Green Larsen, Jeff M. Phillips:
(Approximate) uncertain skylines. ICDT 2011: 186-196 - [c14]Peyman Afshani, Gerth Stølting Brodal, Norbert Zeh:
Ordered and Unordered Top-K Range Reporting in Large Data Sets. SODA 2011: 390-400 - [c13]Peyman Afshani, Norbert Zeh:
Improved Space Bounds for Cache-Oblivious Range Reporting. SODA 2011: 1745-1758 - 2010
- [c12]Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen:
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements. SCG 2010: 240-246 - 2009
- [c11]Peyman Afshani, Chris H. Hamilton, Norbert Zeh:
Cache-oblivious range reporting with optimal queries requires superlinear space. SCG 2009: 277-286 - [c10]Peyman Afshani, Chris H. Hamilton, Norbert Zeh:
A general approach for cache-oblivious range reporting and approximate range counting. SCG 2009: 287-295 - [c9]Peyman Afshani, Jérémy Barbay, Timothy M. Chan:
Instance-Optimal Geometric Algorithms. FOCS 2009: 129-138 - [c8]Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen:
Orthogonal Range Reporting in Three and Higher Dimensions. FOCS 2009: 149-158 - [c7]Peyman Afshani, Timothy M. Chan:
Optimal halfspace range reporting in three dimensions. SODA 2009: 180-186 - 2008
- [c6]Peyman Afshani:
On Dominance Reporting in 3D. ESA 2008: 41-51 - 2007
- [c5]Peyman Afshani, Arash Farzan:
Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull. CCCG 2007: 153-155 - [c4]Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigiv, Arash Farzan, Mehdi Mirzazadeh, Narges Simjour, Hamid Zarrabi-Zadeh:
On the Complexity of Finding an Unknown Cut Via Vertex Queries. COCOON 2007: 459-469 - [c3]Peyman Afshani, Timothy M. Chan:
On approximate range counting and depth. SCG 2007: 337-343 - 2006
- [c2]Peyman Afshani, Timothy M. Chan:
Dynamic Connectivity for Axis-Parallel Rectangles. ESA 2006: 16-27 - 2005
- [c1]Peyman Afshani, Timothy M. Chan:
Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs. CCCG 2005: 19-22
Informal and Other Publications
- 2023
- [i24]Peyman Afshani, Pingan Cheng:
Lower Bounds for Intersection Reporting among Flat Objects. CoRR abs/2302.11433 (2023) - [i23]Peyman Afshani, Pingan Cheng, Aniket Basu Roy, Zhewei Wei:
On Range Summary Queries. CoRR abs/2305.03180 (2023) - 2022
- [i22]Peyman Afshani, Pingan Cheng:
On Semialgebraic Range Reporting. CoRR abs/2203.07096 (2022) - [i21]Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang:
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem. CoRR abs/2203.07280 (2022) - [i20]Peyman Afshani, Rasmus Killmann, Kasper Green Larsen:
Hierarchical Categories in Colored Searching. CoRR abs/2210.05403 (2022) - [i19]Peyman Afshani, Pingan Cheng:
An Optimal Lower Bound for Simplex Range Reporting. CoRR abs/2210.14736 (2022) - 2020
- [i18]Peyman Afshani, Mark de Berg, Kevin Buchin, Jie Gao, Maarten Löffler, Amir Nayyeri, Benjamin Raichel, Rik Sarkar, Haotian Wang, Hao-Tsung Yang:
Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency. CoRR abs/2005.02530 (2020) - [i17]Peyman Afshani, Pingan Cheng:
2D Fractional Cascading on Axis-aligned Planar Subdivisions. CoRR abs/2009.05541 (2020) - [i16]Peyman Afshani:
A Lower Bound for Dynamic Fractional Cascading. CoRR abs/2011.00503 (2020) - [i15]Peyman Afshani, Pingan Cheng:
Lower Bounds for Semialgebraic Range Searching and Stabbing Problems. CoRR abs/2012.00704 (2020) - 2019
- [i14]Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava:
Fragile Complexity of Comparison-Based Algorithms. CoRR abs/1901.02857 (2019) - [i13]Peyman Afshani, Casper Benjamin Freksen, Lior Kamma, Kasper Green Larsen:
Lower Bounds for Multiplication via Network Coding. CoRR abs/1902.10935 (2019) - [i12]Peyman Afshani:
A New Lower Bound for Semigroup Orthogonal Range Searching. CoRR abs/1903.07967 (2019) - [i11]Peyman Afshani, Jeff M. Phillips:
Independent Range Sampling, Revisited Again. CoRR abs/1903.08014 (2019) - 2018
- [i10]Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn:
The Query Complexity of a Permutation-Based Variant of Mastermind. CoRR abs/1812.08480 (2018) - 2017
- [i9]Peyman Afshani, Anne Driemel:
On the complexity of range searching among curves. CoRR abs/1707.04789 (2017) - 2016
- [i8]Peyman Afshani, Edvin Berglin, Ingo van Duijn, Jesper Sindahl Nielsen:
Applications of incidence bounds in point covering problems. CoRR abs/1603.07282 (2016) - [i7]Peyman Afshani, Jesper Sindahl Nielsen:
Data Structure Lower Bounds for Document Indexing Problems. CoRR abs/1604.06264 (2016) - 2015
- [i6]Peyman Afshani, Jérémy Barbay, Timothy M. Chan:
Instance Optimal Geometric Algorithms. CoRR abs/1505.00184 (2015) - [i5]Peyman Afshani, Nodari Sitchinava:
Sorting and Permuting without Bank Conflicts on GPUs. CoRR abs/1507.01391 (2015) - [i4]Peyman Afshani, Donald R. Sheehy, Yannik Stein:
Approximating the Simplicial Depth. CoRR abs/1512.04856 (2015) - 2013
- [i3]Peyman Afshani, Kevin Matulef, Bryan T. Wilkinson:
Property Testing on Linked Lists. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [i2]Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Winzen, Kasper Green Larsen, Kurt Mehlhorn:
The Deterministic and Randomized Query Complexity of a Simple Guessing Game. Electron. Colloquium Comput. Complex. TR12 (2012) - 2007
- [i1]Peyman Afshani, Hamed Hatami:
Approximation and Inapproximability Results for Maximum Clique of Disc Graphs in High Dimensions. CoRR abs/cs/0701009 (2007)
Coauthor Index
Kasper Green Larsen
aka: Kasper Dalgaard Larsen
aka: Kasper Dalgaard Larsen
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
