BibTeX records: Peyman Afshani

download as .bib file

@article{DBLP:journals/dcg/AfshaniC24,
  author       = {Peyman Afshani and
                  Pingan Cheng},
  title        = {On Semialgebraic Range Reporting},
  journal      = {Discret. Comput. Geom.},
  volume       = {71},
  number       = {1},
  pages        = {4--39},
  year         = {2024},
  url          = {https://doi.org/10.1007/s00454-023-00574-1},
  doi          = {10.1007/S00454-023-00574-1},
  timestamp    = {Fri, 26 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dcg/AfshaniC24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AfshaniK23,
  author       = {Peyman Afshani and
                  Rasmus Killmann},
  title        = {Rectangle stabbing and orthogonal range reporting lower bounds in
                  moderate dimensions},
  journal      = {Comput. Geom.},
  volume       = {111},
  pages        = {101959},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.comgeo.2022.101959},
  doi          = {10.1016/J.COMGEO.2022.101959},
  timestamp    = {Thu, 16 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/AfshaniK23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AfshaniC23,
  author       = {Peyman Afshani and
                  Pingan Cheng},
  title        = {Lower Bounds for Semialgebraic Range Searching and Stabbing Problems},
  journal      = {J. {ACM}},
  volume       = {70},
  number       = {2},
  pages        = {16:1--16:26},
  year         = {2023},
  url          = {https://doi.org/10.1145/3578574},
  doi          = {10.1145/3578574},
  timestamp    = {Wed, 17 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/AfshaniC23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AfshaniC23,
  author       = {Peyman Afshani and
                  Pingan Cheng},
  editor       = {Erin W. Chambers and
                  Joachim Gudmundsson},
  title        = {Lower Bounds for Intersection Reporting Among Flat Objects},
  booktitle    = {39th International Symposium on Computational Geometry, SoCG 2023,
                  June 12-15, 2023, Dallas, Texas, {USA}},
  series       = {LIPIcs},
  volume       = {258},
  pages        = {3:1--3:16},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2023.3},
  doi          = {10.4230/LIPICS.SOCG.2023.3},
  timestamp    = {Tue, 13 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/AfshaniC23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AfshaniCRW23,
  author       = {Peyman Afshani and
                  Pingan Cheng and
                  Aniket Basu Roy and
                  Zhewei Wei},
  editor       = {Kousha Etessami and
                  Uriel Feige and
                  Gabriele Puppis},
  title        = {On Range Summary Queries},
  booktitle    = {50th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
  series       = {LIPIcs},
  volume       = {261},
  pages        = {7:1--7:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2023.7},
  doi          = {10.4230/LIPICS.ICALP.2023.7},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/AfshaniCRW23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/AfshaniC23,
  author       = {Peyman Afshani and
                  Pingan Cheng},
  editor       = {Telikepalli Kavitha and
                  Kurt Mehlhorn},
  title        = {An Optimal Lower Bound for Simplex Range Reporting},
  booktitle    = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
                  Italy, January 23-25, 2023},
  pages        = {272--277},
  publisher    = {{SIAM}},
  year         = {2023},
  url          = {https://doi.org/10.1137/1.9781611977585.ch25},
  doi          = {10.1137/1.9781611977585.CH25},
  timestamp    = {Mon, 20 Mar 2023 16:52:56 +0100},
  biburl       = {https://dblp.org/rec/conf/sosa/AfshaniC23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-11433,
  author       = {Peyman Afshani and
                  Pingan Cheng},
  title        = {Lower Bounds for Intersection Reporting among Flat Objects},
  journal      = {CoRR},
  volume       = {abs/2302.11433},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2302.11433},
  doi          = {10.48550/ARXIV.2302.11433},
  eprinttype    = {arXiv},
  eprint       = {2302.11433},
  timestamp    = {Fri, 24 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2302-11433.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-03180,
  author       = {Peyman Afshani and
                  Pingan Cheng and
                  Aniket Basu Roy and
                  Zhewei Wei},
  title        = {On Range Summary Queries},
  journal      = {CoRR},
  volume       = {abs/2305.03180},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2305.03180},
  doi          = {10.48550/ARXIV.2305.03180},
  eprinttype    = {arXiv},
  eprint       = {2305.03180},
  timestamp    = {Wed, 10 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2305-03180.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/apocs/AfshaniIJKS22,
  author       = {Peyman Afshani and
                  John Iacono and
                  Varunkumar Jayapaul and
                  Ben Karsin and
                  Nodari Sitchinava},
  editor       = {Kunal Agrawal},
  title        = {Locality-of-Reference Optimality of Cache-Oblivious Algorithms},
  booktitle    = {3rd Symposium on Algorithmic Principles of Computer Systems, {APOCS}
                  2022, Virtual Conference / Alexandria, Virginia, USA, January 12,
                  2022},
  pages        = {31--45},
  publisher    = {{SIAM}},
  year         = {2022},
  url          = {https://doi.org/10.1137/1.9781611977059.3},
  doi          = {10.1137/1.9781611977059.3},
  timestamp    = {Mon, 11 Apr 2022 13:34:11 +0200},
  biburl       = {https://dblp.org/rec/conf/apocs/AfshaniIJKS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AfshaniBB0LNRS022,
  author       = {Peyman Afshani and
                  Mark de Berg and
                  Kevin Buchin and
                  Jie Gao and
                  Maarten L{\"{o}}ffler and
                  Amir Nayyeri and
                  Benjamin Raichel and
                  Rik Sarkar and
                  Haotian Wang and
                  Hao{-}Tsung Yang},
  editor       = {Xavier Goaoc and
                  Michael Kerber},
  title        = {On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling
                  Problem},
  booktitle    = {38th International Symposium on Computational Geometry, SoCG 2022,
                  June 7-10, 2022, Berlin, Germany},
  series       = {LIPIcs},
  volume       = {224},
  pages        = {2:1--2:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2022.2},
  doi          = {10.4230/LIPICS.SOCG.2022.2},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/AfshaniBB0LNRS022.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AfshaniC22,
  author       = {Peyman Afshani and
                  Pingan Cheng},
  editor       = {Xavier Goaoc and
                  Michael Kerber},
  title        = {On Semialgebraic Range Reporting},
  booktitle    = {38th International Symposium on Computational Geometry, SoCG 2022,
                  June 7-10, 2022, Berlin, Germany},
  series       = {LIPIcs},
  volume       = {224},
  pages        = {3:1--3:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2022.3},
  doi          = {10.4230/LIPICS.SOCG.2022.3},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/AfshaniC22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AfshaniKL22,
  author       = {Peyman Afshani and
                  Rasmus Killmann and
                  Kasper Green Larsen},
  editor       = {Sang Won Bae and
                  Heejin Park},
  title        = {Hierarchical Categories in Colored Searching},
  booktitle    = {33rd International Symposium on Algorithms and Computation, {ISAAC}
                  2022, December 19-21, 2022, Seoul, Korea},
  series       = {LIPIcs},
  volume       = {248},
  pages        = {25:1--25:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.ISAAC.2022.25},
  doi          = {10.4230/LIPICS.ISAAC.2022.25},
  timestamp    = {Wed, 14 Dec 2022 11:53:14 +0100},
  biburl       = {https://dblp.org/rec/conf/isaac/AfshaniKL22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-07096,
  author       = {Peyman Afshani and
                  Pingan Cheng},
  title        = {On Semialgebraic Range Reporting},
  journal      = {CoRR},
  volume       = {abs/2203.07096},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2203.07096},
  doi          = {10.48550/ARXIV.2203.07096},
  eprinttype    = {arXiv},
  eprint       = {2203.07096},
  timestamp    = {Wed, 16 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2203-07096.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-07280,
  author       = {Peyman Afshani and
                  Mark de Berg and
                  Kevin Buchin and
                  Jie Gao and
                  Maarten L{\"{o}}ffler and
                  Amir Nayyeri and
                  Benjamin Raichel and
                  Rik Sarkar and
                  Haotian Wang and
                  Hao{-}Tsung Yang},
  title        = {On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling
                  Problem},
  journal      = {CoRR},
  volume       = {abs/2203.07280},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2203.07280},
  doi          = {10.48550/ARXIV.2203.07280},
  eprinttype    = {arXiv},
  eprint       = {2203.07280},
  timestamp    = {Wed, 01 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2203-07280.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-05403,
  author       = {Peyman Afshani and
                  Rasmus Killmann and
                  Kasper Green Larsen},
  title        = {Hierarchical Categories in Colored Searching},
  journal      = {CoRR},
  volume       = {abs/2210.05403},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2210.05403},
  doi          = {10.48550/ARXIV.2210.05403},
  eprinttype    = {arXiv},
  eprint       = {2210.05403},
  timestamp    = {Thu, 13 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2210-05403.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-14736,
  author       = {Peyman Afshani and
                  Pingan Cheng},
  title        = {An Optimal Lower Bound for Simplex Range Reporting},
  journal      = {CoRR},
  volume       = {abs/2210.14736},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2210.14736},
  doi          = {10.48550/ARXIV.2210.14736},
  eprinttype    = {arXiv},
  eprint       = {2210.14736},
  timestamp    = {Wed, 02 Nov 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2210-14736.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AfshaniK21,
  author       = {Peyman Afshani and
                  Rasmus Killmann},
  editor       = {Meng He and
                  Don Sheehy},
  title        = {Rectangle Stabbing and Orthogonal Range Reporting Lower Bounds in
                  Moderate Dimensions},
  booktitle    = {Proceedings of the 33rd Canadian Conference on Computational Geometry,
                  {CCCG} 2021, August 10-12, 2021, Dalhousie University, Halifax, Nova
                  Scotia, Canada},
  pages        = {167--174},
  year         = {2021},
  timestamp    = {Fri, 24 Sep 2021 13:55:36 +0200},
  biburl       = {https://dblp.org/rec/conf/cccg/AfshaniK21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cikm/HaxenRAK21,
  author       = {Magnus Haxen and
                  Morten Raeburn and
                  Peyman Afshani and
                  Panagiotis Karras},
  editor       = {Gianluca Demartini and
                  Guido Zuccon and
                  J. Shane Culpepper and
                  Zi Huang and
                  Hanghang Tong},
  title        = {Centerpoint Query Authentication},
  booktitle    = {{CIKM} '21: The 30th {ACM} International Conference on Information
                  and Knowledge Management, Virtual Event, Queensland, Australia, November
                  1 - 5, 2021},
  pages        = {3083--3087},
  publisher    = {{ACM}},
  year         = {2021},
  url          = {https://doi.org/10.1145/3459637.3482072},
  doi          = {10.1145/3459637.3482072},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/cikm/HaxenRAK21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AfshaniC21,
  author       = {Peyman Afshani and
                  Pingan Cheng},
  editor       = {Kevin Buchin and
                  {\'{E}}ric Colin de Verdi{\`{e}}re},
  title        = {Lower Bounds for Semialgebraic Range Searching and Stabbing Problems},
  booktitle    = {37th International Symposium on Computational Geometry, SoCG 2021,
                  June 7-11, 2021, Buffalo, NY, {USA} (Virtual Conference)},
  series       = {LIPIcs},
  volume       = {189},
  pages        = {8:1--8:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2021.8},
  doi          = {10.4230/LIPICS.SOCG.2021.8},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/AfshaniC21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Afshani21,
  author       = {Peyman Afshani},
  editor       = {D{\'{a}}niel Marx},
  title        = {A Lower Bound for Dynamic Fractional Cascading},
  booktitle    = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2021, Virtual Conference, January 10 - 13, 2021},
  pages        = {2229--2248},
  publisher    = {{SIAM}},
  year         = {2021},
  url          = {https://doi.org/10.1137/1.9781611976465.133},
  doi          = {10.1137/1.9781611976465.133},
  timestamp    = {Thu, 15 Jul 2021 13:48:55 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/Afshani21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wafr/AfshaniBB0LNRS021,
  author       = {Peyman Afshani and
                  Mark de Berg and
                  Kevin Buchin and
                  Jie Gao and
                  Maarten L{\"{o}}ffler and
                  Amir Nayyeri and
                  Benjamin Raichel and
                  Rik Sarkar and
                  Haotian Wang and
                  Hao{-}Tsung Yang},
  editor       = {Steven M. LaValle and
                  Ming Lin and
                  Timo Ojala and
                  Dylan A. Shell and
                  Jingjin Yu},
  title        = {Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max
                  Latency},
  booktitle    = {Algorithmic Foundations of Robotics XIV, Proceedings of the Fourteenth
                  Workshop on the Algorithmic Foundations of Robotics, {WAFR} 2021,
                  Oulu, Finland, June 21-23, 2021},
  series       = {Springer Proceedings in Advanced Robotics},
  volume       = {17},
  pages        = {107--123},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-66723-8\_7},
  doi          = {10.1007/978-3-030-66723-8\_7},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wafr/AfshaniBB0LNRS021.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/edbt/ZardbaniAK20,
  author       = {Fatemeh Zardbani and
                  Peyman Afshani and
                  Panagiotis Karras},
  editor       = {Angela Bonifati and
                  Yongluan Zhou and
                  Marcos Antonio Vaz Salles and
                  Alexander B{\"{o}}hm and
                  Dan Olteanu and
                  George H. L. Fletcher and
                  Arijit Khan and
                  Bin Yang},
  title        = {Revisiting the Theory and Practice of Database Cracking},
  booktitle    = {Proceedings of the 23rd International Conference on Extending Database
                  Technology, {EDBT} 2020, Copenhagen, Denmark, March 30 - April 02,
                  2020},
  pages        = {415--418},
  publisher    = {OpenProceedings.org},
  year         = {2020},
  url          = {https://doi.org/10.5441/002/edbt.2020.46},
  doi          = {10.5441/002/EDBT.2020.46},
  timestamp    = {Wed, 15 Feb 2023 22:11:05 +0100},
  biburl       = {https://dblp.org/rec/conf/edbt/ZardbaniAK20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AfshaniC20,
  author       = {Peyman Afshani and
                  Pingan Cheng},
  editor       = {Sandy Irani},
  title        = {2D Generalization of Fractional Cascading on Axis-aligned Planar Subdivisions},
  booktitle    = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2020, Durham, NC, USA, November 16-19, 2020},
  pages        = {716--727},
  publisher    = {{IEEE}},
  year         = {2020},
  url          = {https://doi.org/10.1109/FOCS46700.2020.00072},
  doi          = {10.1109/FOCS46700.2020.00072},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/focs/AfshaniC20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AfshaniDKN20,
  author       = {Peyman Afshani and
                  Ingo van Duijn and
                  Rasmus Killmann and
                  Jesper Sindahl Nielsen},
  editor       = {Shuchi Chawla},
  title        = {A Lower Bound for Jumbled Indexing},
  booktitle    = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
  pages        = {592--606},
  publisher    = {{SIAM}},
  year         = {2020},
  url          = {https://doi.org/10.1137/1.9781611975994.36},
  doi          = {10.1137/1.9781611975994.36},
  timestamp    = {Thu, 15 Jul 2021 13:48:53 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/AfshaniDKN20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-02530,
  author       = {Peyman Afshani and
                  Mark de Berg and
                  Kevin Buchin and
                  Jie Gao and
                  Maarten L{\"{o}}ffler and
                  Amir Nayyeri and
                  Benjamin Raichel and
                  Rik Sarkar and
                  Haotian Wang and
                  Hao{-}Tsung Yang},
  title        = {Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max
                  Latency},
  journal      = {CoRR},
  volume       = {abs/2005.02530},
  year         = {2020},
  url          = {https://arxiv.org/abs/2005.02530},
  eprinttype    = {arXiv},
  eprint       = {2005.02530},
  timestamp    = {Wed, 01 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2005-02530.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-05541,
  author       = {Peyman Afshani and
                  Pingan Cheng},
  title        = {2D Fractional Cascading on Axis-aligned Planar Subdivisions},
  journal      = {CoRR},
  volume       = {abs/2009.05541},
  year         = {2020},
  url          = {https://arxiv.org/abs/2009.05541},
  eprinttype    = {arXiv},
  eprint       = {2009.05541},
  timestamp    = {Thu, 17 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2009-05541.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-00503,
  author       = {Peyman Afshani},
  title        = {A Lower Bound for Dynamic Fractional Cascading},
  journal      = {CoRR},
  volume       = {abs/2011.00503},
  year         = {2020},
  url          = {https://arxiv.org/abs/2011.00503},
  eprinttype    = {arXiv},
  eprint       = {2011.00503},
  timestamp    = {Fri, 06 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2011-00503.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-00704,
  author       = {Peyman Afshani and
                  Pingan Cheng},
  title        = {Lower Bounds for Semialgebraic Range Searching and Stabbing Problems},
  journal      = {CoRR},
  volume       = {abs/2012.00704},
  year         = {2020},
  url          = {https://arxiv.org/abs/2012.00704},
  eprinttype    = {arXiv},
  eprint       = {2012.00704},
  timestamp    = {Fri, 04 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2012-00704.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AfshaniADDLM19,
  author       = {Peyman Afshani and
                  Manindra Agrawal and
                  Benjamin Doerr and
                  Carola Doerr and
                  Kasper Green Larsen and
                  Kurt Mehlhorn},
  title        = {The query complexity of a permutation-based variant of Mastermind},
  journal      = {Discret. Appl. Math.},
  volume       = {260},
  pages        = {28--50},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.dam.2019.01.007},
  doi          = {10.1016/J.DAM.2019.01.007},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/AfshaniADDLM19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Afshani19,
  author       = {Peyman Afshani},
  editor       = {Gill Barequet and
                  Yusu Wang},
  title        = {A New Lower Bound for Semigroup Orthogonal Range Searching},
  booktitle    = {35th International Symposium on Computational Geometry, SoCG 2019,
                  June 18-21, 2019, Portland, Oregon, {USA}},
  series       = {LIPIcs},
  volume       = {129},
  pages        = {3:1--3:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2019.3},
  doi          = {10.4230/LIPICS.SOCG.2019.3},
  timestamp    = {Mon, 02 Jan 2023 09:02:13 +0100},
  biburl       = {https://dblp.org/rec/conf/compgeom/Afshani19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AfshaniP19,
  author       = {Peyman Afshani and
                  Jeff M. Phillips},
  editor       = {Gill Barequet and
                  Yusu Wang},
  title        = {Independent Range Sampling, Revisited Again},
  booktitle    = {35th International Symposium on Computational Geometry, SoCG 2019,
                  June 18-21, 2019, Portland, Oregon, {USA}},
  series       = {LIPIcs},
  volume       = {129},
  pages        = {4:1--4:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2019.4},
  doi          = {10.4230/LIPICS.SOCG.2019.4},
  timestamp    = {Wed, 16 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/AfshaniP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AfshaniFHJK0PS19,
  author       = {Peyman Afshani and
                  Rolf Fagerberg and
                  David Hammer and
                  Riko Jacob and
                  Irina Kostitsyna and
                  Ulrich Meyer and
                  Manuel Penschuck and
                  Nodari Sitchinava},
  editor       = {Michael A. Bender and
                  Ola Svensson and
                  Grzegorz Herman},
  title        = {Fragile Complexity of Comparison-Based Algorithms},
  booktitle    = {27th Annual European Symposium on Algorithms, {ESA} 2019, September
                  9-11, 2019, Munich/Garching, Germany},
  series       = {LIPIcs},
  volume       = {144},
  pages        = {2:1--2:19},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2019.2},
  doi          = {10.4230/LIPICS.ESA.2019.2},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/AfshaniFHJK0PS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AfshaniFKL19,
  author       = {Peyman Afshani and
                  Casper Benjamin Freksen and
                  Lior Kamma and
                  Kasper Green Larsen},
  editor       = {Christel Baier and
                  Ioannis Chatzigiannakis and
                  Paola Flocchini and
                  Stefano Leonardi},
  title        = {Lower Bounds for Multiplication via Network Coding},
  booktitle    = {46th International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2019, July 9-12, 2019, Patras, Greece},
  series       = {LIPIcs},
  volume       = {132},
  pages        = {10:1--10:12},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2019.10},
  doi          = {10.4230/LIPICS.ICALP.2019.10},
  timestamp    = {Tue, 27 Dec 2022 09:06:31 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/AfshaniFKL19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-02857,
  author       = {Peyman Afshani and
                  Rolf Fagerberg and
                  David Hammer and
                  Riko Jacob and
                  Irina Kostitsyna and
                  Ulrich Meyer and
                  Manuel Penschuck and
                  Nodari Sitchinava},
  title        = {Fragile Complexity of Comparison-Based Algorithms},
  journal      = {CoRR},
  volume       = {abs/1901.02857},
  year         = {2019},
  url          = {http://arxiv.org/abs/1901.02857},
  eprinttype    = {arXiv},
  eprint       = {1901.02857},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1901-02857.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-10935,
  author       = {Peyman Afshani and
                  Casper Benjamin Freksen and
                  Lior Kamma and
                  Kasper Green Larsen},
  title        = {Lower Bounds for Multiplication via Network Coding},
  journal      = {CoRR},
  volume       = {abs/1902.10935},
  year         = {2019},
  url          = {http://arxiv.org/abs/1902.10935},
  eprinttype    = {arXiv},
  eprint       = {1902.10935},
  timestamp    = {Tue, 21 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1902-10935.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-07967,
  author       = {Peyman Afshani},
  title        = {A New Lower Bound for Semigroup Orthogonal Range Searching},
  journal      = {CoRR},
  volume       = {abs/1903.07967},
  year         = {2019},
  url          = {http://arxiv.org/abs/1903.07967},
  eprinttype    = {arXiv},
  eprint       = {1903.07967},
  timestamp    = {Mon, 01 Apr 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1903-07967.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-08014,
  author       = {Peyman Afshani and
                  Jeff M. Phillips},
  title        = {Independent Range Sampling, Revisited Again},
  journal      = {CoRR},
  volume       = {abs/1903.08014},
  year         = {2019},
  url          = {http://arxiv.org/abs/1903.08014},
  eprinttype    = {arXiv},
  eprint       = {1903.08014},
  timestamp    = {Mon, 01 Apr 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1903-08014.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AfshaniT18,
  author       = {Peyman Afshani and
                  Konstantinos Tsakalidis},
  title        = {Optimal Deterministic Shallow Cuttings for 3-d Dominance Ranges},
  journal      = {Algorithmica},
  volume       = {80},
  number       = {11},
  pages        = {3192--3206},
  year         = {2018},
  url          = {https://doi.org/10.1007/s00453-017-0376-3},
  doi          = {10.1007/S00453-017-0376-3},
  timestamp    = {Tue, 07 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AfshaniT18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jea/AfshaniBCKLST18,
  author       = {Peyman Afshani and
                  Mark de Berg and
                  Henri Casanova and
                  Ben Karsin and
                  Colin Lambrechts and
                  Nodari Sitchinava and
                  Constantinos Tsirogiannis},
  title        = {An Efficient Algorithm for the 1D Total Visibility-Index Problem and
                  Its Parallelization},
  journal      = {{ACM} J. Exp. Algorithmics},
  volume       = {23},
  year         = {2018},
  url          = {https://doi.org/10.1145/3209685},
  doi          = {10.1145/3209685},
  timestamp    = {Sat, 08 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jea/AfshaniBCKLST18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AfshaniD18,
  author       = {Peyman Afshani and
                  Anne Driemel},
  editor       = {Artur Czumaj},
  title        = {On the complexity of range searching among curves},
  booktitle    = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
  pages        = {898--917},
  publisher    = {{SIAM}},
  year         = {2018},
  url          = {https://doi.org/10.1137/1.9781611975031.58},
  doi          = {10.1137/1.9781611975031.58},
  timestamp    = {Tue, 02 Feb 2021 17:07:58 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AfshaniD18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-08480,
  author       = {Peyman Afshani and
                  Manindra Agrawal and
                  Benjamin Doerr and
                  Carola Doerr and
                  Kasper Green Larsen and
                  Kurt Mehlhorn},
  title        = {The Query Complexity of a Permutation-Based Variant of Mastermind},
  journal      = {CoRR},
  volume       = {abs/1812.08480},
  year         = {2018},
  url          = {http://arxiv.org/abs/1812.08480},
  eprinttype    = {arXiv},
  eprint       = {1812.08480},
  timestamp    = {Wed, 02 Jan 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1812-08480.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AfshaniBC17,
  author       = {Peyman Afshani and
                  J{\'{e}}r{\'{e}}my Barbay and
                  Timothy M. Chan},
  title        = {Instance-Optimal Geometric Algorithms},
  journal      = {J. {ACM}},
  volume       = {64},
  number       = {1},
  pages        = {3:1--3:38},
  year         = {2017},
  url          = {https://doi.org/10.1145/3046673},
  doi          = {10.1145/3046673},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/AfshaniBC17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/AfshaniBCKLST17,
  author       = {Peyman Afshani and
                  Mark de Berg and
                  Henri Casanova and
                  Benjamin Karsin and
                  Colin Lambrechts and
                  Nodari Sitchinava and
                  Constantinos Tsirogiannis},
  editor       = {S{\'{a}}ndor P. Fekete and
                  Vijaya Ramachandran},
  title        = {An Efficient Algorithm for the 1D Total Visibility-Index Problem},
  booktitle    = {Proceedings of the Ninteenth Workshop on Algorithm Engineering and
                  Experiments, {ALENEX} 2017, Barcelona, Spain, Hotel Porta Fira, January
                  17-18, 2017},
  pages        = {218--231},
  publisher    = {{SIAM}},
  year         = {2017},
  url          = {https://doi.org/10.1137/1.9781611974768.18},
  doi          = {10.1137/1.9781611974768.18},
  timestamp    = {Fri, 19 May 2017 01:26:03 +0200},
  biburl       = {https://dblp.org/rec/conf/alenex/AfshaniBCKLST17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AfshaniD17,
  author       = {Peyman Afshani and
                  Ingo van Duijn},
  editor       = {Kirk Pruhs and
                  Christian Sohler},
  title        = {Permuting and Batched Geometric Lower Bounds in the {I/O} Model},
  booktitle    = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
                  4-6, 2017, Vienna, Austria},
  series       = {LIPIcs},
  volume       = {87},
  pages        = {2:1--2:13},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2017.2},
  doi          = {10.4230/LIPICS.ESA.2017.2},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/AfshaniD17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AfshaniW17,
  author       = {Peyman Afshani and
                  Zhewei Wei},
  editor       = {Kirk Pruhs and
                  Christian Sohler},
  title        = {Independent Range Sampling, Revisited},
  booktitle    = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
                  4-6, 2017, Vienna, Austria},
  series       = {LIPIcs},
  volume       = {87},
  pages        = {3:1--3:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2017.3},
  doi          = {10.4230/LIPICS.ESA.2017.3},
  timestamp    = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/AfshaniW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AfshaniBFFGT17,
  author       = {Peyman Afshani and
                  Michael A. Bender and
                  Martin Farach{-}Colton and
                  Jeremy T. Fineman and
                  Mayank Goswami and
                  Meng{-}Tsung Tsai},
  editor       = {Philip N. Klein},
  title        = {Cross-Referenced Dictionaries and the Limits of Write Optimization},
  booktitle    = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
                  16-19},
  pages        = {1523--1532},
  publisher    = {{SIAM}},
  year         = {2017},
  url          = {https://doi.org/10.1137/1.9781611974782.99},
  doi          = {10.1137/1.9781611974782.99},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/AfshaniBFFGT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AfshaniD17,
  author       = {Peyman Afshani and
                  Anne Driemel},
  title        = {On the complexity of range searching among curves},
  journal      = {CoRR},
  volume       = {abs/1707.04789},
  year         = {2017},
  url          = {http://arxiv.org/abs/1707.04789},
  eprinttype    = {arXiv},
  eprint       = {1707.04789},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AfshaniD17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AfshaniBDN16,
  author       = {Peyman Afshani and
                  Edvin Berglin and
                  Ingo van Duijn and
                  Jesper Sindahl Nielsen},
  editor       = {S{\'{a}}ndor P. Fekete and
                  Anna Lubiw},
  title        = {Applications of Incidence Bounds in Point Covering Problems},
  booktitle    = {32nd International Symposium on Computational Geometry, SoCG 2016,
                  June 14-18, 2016, Boston, MA, {USA}},
  series       = {LIPIcs},
  volume       = {51},
  pages        = {60:1--60:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.SoCG.2016.60},
  doi          = {10.4230/LIPICS.SOCG.2016.60},
  timestamp    = {Wed, 16 Jun 2021 12:03:34 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/AfshaniBDN16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AfshaniN16,
  author       = {Peyman Afshani and
                  Jesper Sindahl Nielsen},
  editor       = {Ioannis Chatzigiannakis and
                  Michael Mitzenmacher and
                  Yuval Rabani and
                  Davide Sangiorgi},
  title        = {Data Structure Lower Bounds for Document Indexing Problems},
  booktitle    = {43rd International Colloquium on Automata, Languages, and Programming,
                  {ICALP} 2016, July 11-15, 2016, Rome, Italy},
  series       = {LIPIcs},
  volume       = {55},
  pages        = {93:1--93:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2016.93},
  doi          = {10.4230/LIPICS.ICALP.2016.93},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/AfshaniN16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AfshaniBDN16,
  author       = {Peyman Afshani and
                  Edvin Berglin and
                  Ingo van Duijn and
                  Jesper Sindahl Nielsen},
  title        = {Applications of incidence bounds in point covering problems},
  journal      = {CoRR},
  volume       = {abs/1603.07282},
  year         = {2016},
  url          = {http://arxiv.org/abs/1603.07282},
  eprinttype    = {arXiv},
  eprint       = {1603.07282},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AfshaniBDN16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AfshaniN16,
  author       = {Peyman Afshani and
                  Jesper Sindahl Nielsen},
  title        = {Data Structure Lower Bounds for Document Indexing Problems},
  journal      = {CoRR},
  volume       = {abs/1604.06264},
  year         = {2016},
  url          = {http://arxiv.org/abs/1604.06264},
  eprinttype    = {arXiv},
  eprint       = {1604.06264},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AfshaniN16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AfshaniS15,
  author       = {Peyman Afshani and
                  Nodari Sitchinava},
  editor       = {Nikhil Bansal and
                  Irene Finocchi},
  title        = {Sorting and Permuting without Bank Conflicts on GPUs},
  booktitle    = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
                  Greece, September 14-16, 2015, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9294},
  pages        = {13--24},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-662-48350-3\_2},
  doi          = {10.1007/978-3-662-48350-3\_2},
  timestamp    = {Tue, 15 Feb 2022 07:54:27 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/AfshaniS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/SonA15,
  author       = {Wanbin Son and
                  Peyman Afshani},
  editor       = {Rahul Jain and
                  Sanjay Jain and
                  Frank Stephan},
  title        = {Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls},
  booktitle    = {Theory and Applications of Models of Computation - 12th Annual Conference,
                  {TAMC} 2015, Singapore, May 18-20, 2015, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9076},
  pages        = {189--199},
  publisher    = {Springer},
  year         = {2015},
  url          = {https://doi.org/10.1007/978-3-319-17142-5\_17},
  doi          = {10.1007/978-3-319-17142-5\_17},
  timestamp    = {Mon, 16 Sep 2019 15:30:10 +0200},
  biburl       = {https://dblp.org/rec/conf/tamc/SonA15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AfshaniBC15,
  author       = {Peyman Afshani and
                  J{\'{e}}r{\'{e}}my Barbay and
                  Timothy M. Chan},
  title        = {Instance Optimal Geometric Algorithms},
  journal      = {CoRR},
  volume       = {abs/1505.00184},
  year         = {2015},
  url          = {http://arxiv.org/abs/1505.00184},
  eprinttype    = {arXiv},
  eprint       = {1505.00184},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AfshaniBC15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AfshaniS15,
  author       = {Peyman Afshani and
                  Nodari Sitchinava},
  title        = {Sorting and Permuting without Bank Conflicts on GPUs},
  journal      = {CoRR},
  volume       = {abs/1507.01391},
  year         = {2015},
  url          = {http://arxiv.org/abs/1507.01391},
  eprinttype    = {arXiv},
  eprint       = {1507.01391},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AfshaniS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AfshaniSS15,
  author       = {Peyman Afshani and
                  Donald R. Sheehy and
                  Yannik Stein},
  title        = {Approximating the Simplicial Depth},
  journal      = {CoRR},
  volume       = {abs/1512.04856},
  year         = {2015},
  url          = {http://arxiv.org/abs/1512.04856},
  eprinttype    = {arXiv},
  eprint       = {1512.04856},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/AfshaniSS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AfshaniCT14,
  author       = {Peyman Afshani and
                  Timothy M. Chan and
                  Konstantinos Tsakalidis},
  editor       = {Javier Esparza and
                  Pierre Fraigniaud and
                  Thore Husfeldt and
                  Elias Koutsoupias},
  title        = {Deterministic Rectangle Enclosure and Offline Dominance Reporting
                  on the {RAM}},
  booktitle    = {Automata, Languages, and Programming - 41st International Colloquium,
                  {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
                  {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {8572},
  pages        = {77--88},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-662-43948-7\_7},
  doi          = {10.1007/978-3-662-43948-7\_7},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/AfshaniCT14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AfshaniSTW14,
  author       = {Peyman Afshani and
                  Cheng Sheng and
                  Yufei Tao and
                  Bryan T. Wilkinson},
  editor       = {Chandra Chekuri},
  title        = {Concurrent Range Reporting in Two-Dimensional Space},
  booktitle    = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
  pages        = {983--994},
  publisher    = {{SIAM}},
  year         = {2014},
  url          = {https://doi.org/10.1137/1.9781611973402.73},
  doi          = {10.1137/1.9781611973402.73},
  timestamp    = {Thu, 29 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/AfshaniSTW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AfshaniT14,
  author       = {Peyman Afshani and
                  Konstantinos Tsakalidis},
  editor       = {Chandra Chekuri},
  title        = {Optimal Deterministic Shallow Cuttings for 3D Dominance Ranges},
  booktitle    = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
  pages        = {1389--1398},
  publisher    = {{SIAM}},
  year         = {2014},
  url          = {https://doi.org/10.1137/1.9781611973402.102},
  doi          = {10.1137/1.9781611973402.102},
  timestamp    = {Tue, 02 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AfshaniT14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Afshani14,
  author       = {Peyman Afshani},
  editor       = {Chandra Chekuri},
  title        = {Fast Computation of Output-Sensitive Maxima in a Word {RAM}},
  booktitle    = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
  pages        = {1414--1423},
  publisher    = {{SIAM}},
  year         = {2014},
  url          = {https://doi.org/10.1137/1.9781611973402.104},
  doi          = {10.1137/1.9781611973402.104},
  timestamp    = {Tue, 02 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/Afshani14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AfshaniS14,
  author       = {Peyman Afshani and
                  Nodari Sitchinava},
  editor       = {R. Ravi and
                  Inge Li G{\o}rtz},
  title        = {I/O-Efficient Range Minima Queries},
  booktitle    = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
                  Copenhagen, Denmark, July 2-4, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8503},
  pages        = {1--12},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-08404-6\_1},
  doi          = {10.1007/978-3-319-08404-6\_1},
  timestamp    = {Sun, 02 Jun 2019 21:15:18 +0200},
  biburl       = {https://dblp.org/rec/conf/swat/AfshaniS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/Afshani13,
  author       = {Peyman Afshani},
  title        = {Improved Pointer Machine and {I/O} Lower Bounds for Simplex Range
                  Reporting and Related Problems},
  journal      = {Int. J. Comput. Geom. Appl.},
  volume       = {23},
  number       = {4-5},
  pages        = {233--252},
  year         = {2013},
  url          = {https://doi.org/10.1142/S0218195913600054},
  doi          = {10.1142/S0218195913600054},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijcga/Afshani13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AfshaniAALP13,
  author       = {Peyman Afshani and
                  Pankaj K. Agarwal and
                  Lars Arge and
                  Kasper Green Larsen and
                  Jeff M. Phillips},
  title        = {(Approximate) Uncertain Skylines},
  journal      = {Theory Comput. Syst.},
  volume       = {52},
  number       = {3},
  pages        = {342--366},
  year         = {2013},
  url          = {https://doi.org/10.1007/s00224-012-9382-7},
  doi          = {10.1007/S00224-012-9382-7},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/AfshaniAALP13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/AfshaniADDLM13,
  author       = {Peyman Afshani and
                  Manindra Agrawal and
                  Benjamin Doerr and
                  Carola Doerr and
                  Kasper Green Larsen and
                  Kurt Mehlhorn},
  editor       = {Andrej Brodnik and
                  Alejandro L{\'{o}}pez{-}Ortiz and
                  Venkatesh Raman and
                  Alfredo Viola},
  title        = {The Query Complexity of Finding a Hidden Permutation},
  booktitle    = {Space-Efficient Data Structures, Streams, and Algorithms - Papers
                  in Honor of J. Ian Munro on the Occasion of His 66th Birthday},
  series       = {Lecture Notes in Computer Science},
  volume       = {8066},
  pages        = {1--11},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-40273-9\_1},
  doi          = {10.1007/978-3-642-40273-9\_1},
  timestamp    = {Tue, 14 May 2019 10:00:52 +0200},
  biburl       = {https://dblp.org/rec/conf/birthday/AfshaniADDLM13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AfshaniMW13,
  author       = {Peyman Afshani and
                  Kevin Matulef and
                  Bryan T. Wilkinson},
  title        = {Property Testing on Linked Lists},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR13-187}},
  year         = {2013},
  url          = {https://eccc.weizmann.ac.il/report/2013/187},
  eprinttype    = {ECCC},
  eprint       = {TR13-187},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/AfshaniMW13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AfshaniAL12,
  author       = {Peyman Afshani and
                  Lars Arge and
                  Kasper Green Larsen},
  editor       = {Tamal K. Dey and
                  Sue Whitesides},
  title        = {Higher-dimensional orthogonal range reporting and rectangle stabbing
                  in the pointer machine model},
  booktitle    = {Proceedings of the 28th {ACM} Symposium on Computational Geometry,
                  Chapel Hill, NC, USA, June 17-20, 2012},
  pages        = {323--332},
  publisher    = {{ACM}},
  year         = {2012},
  url          = {https://doi.org/10.1145/2261250.2261299},
  doi          = {10.1145/2261250.2261299},
  timestamp    = {Mon, 14 Jun 2021 16:50:55 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/AfshaniAL12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Afshani12,
  author       = {Peyman Afshani},
  editor       = {Tamal K. Dey and
                  Sue Whitesides},
  title        = {Improved pointer machine and {I/O} lower bounds for simplex range
                  reporting and related problems},
  booktitle    = {Proceedings of the 28th {ACM} Symposium on Computational Geometry,
                  Chapel Hill, NC, USA, June 17-20, 2012},
  pages        = {339--346},
  publisher    = {{ACM}},
  year         = {2012},
  url          = {https://doi.org/10.1145/2261250.2261301},
  doi          = {10.1145/2261250.2261301},
  timestamp    = {Mon, 14 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/Afshani12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AfshaniZ12,
  author       = {Peyman Afshani and
                  Norbert Zeh},
  editor       = {Leah Epstein and
                  Paolo Ferragina},
  title        = {Lower Bounds for Sorted Geometric Queries in the {I/O} Model},
  booktitle    = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
                  Slovenia, September 10-12, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7501},
  pages        = {48--59},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-33090-2\_6},
  doi          = {10.1007/978-3-642-33090-2\_6},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/AfshaniZ12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AfshaniADCLM12,
  author       = {Peyman Afshani and
                  Manindra Agrawal and
                  Benjamin Doerr and
                  Carola Winzen and
                  Kasper Green Larsen and
                  Kurt Mehlhorn},
  title        = {The Deterministic and Randomized Query Complexity of a Simple Guessing
                  Game},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR12-087}},
  year         = {2012},
  url          = {https://eccc.weizmann.ac.il/report/2012/087},
  eprinttype    = {ECCC},
  eprint       = {TR12-087},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/AfshaniADCLM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AfshaniHZ11,
  author       = {Peyman Afshani and
                  Chris H. Hamilton and
                  Norbert Zeh},
  title        = {Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear
                  Space},
  journal      = {Discret. Comput. Geom.},
  volume       = {45},
  number       = {4},
  pages        = {824--850},
  year         = {2011},
  url          = {https://doi.org/10.1007/s00454-011-9347-7},
  doi          = {10.1007/S00454-011-9347-7},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dcg/AfshaniHZ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/AfshaniAALP11,
  author       = {Peyman Afshani and
                  Pankaj K. Agarwal and
                  Lars Arge and
                  Kasper Green Larsen and
                  Jeff M. Phillips},
  editor       = {Tova Milo},
  title        = {(Approximate) uncertain skylines},
  booktitle    = {Database Theory - {ICDT} 2011, 14th International Conference, Uppsala,
                  Sweden, March 21-24, 2011, Proceedings},
  pages        = {186--196},
  publisher    = {{ACM}},
  year         = {2011},
  url          = {https://doi.org/10.1145/1938551.1938576},
  doi          = {10.1145/1938551.1938576},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/icdt/AfshaniAALP11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AfshaniBZ11,
  author       = {Peyman Afshani and
                  Gerth St{\o}lting Brodal and
                  Norbert Zeh},
  editor       = {Dana Randall},
  title        = {Ordered and Unordered Top-K Range Reporting in Large Data Sets},
  booktitle    = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
                  2011},
  pages        = {390--400},
  publisher    = {{SIAM}},
  year         = {2011},
  url          = {https://doi.org/10.1137/1.9781611973082.31},
  doi          = {10.1137/1.9781611973082.31},
  timestamp    = {Tue, 02 Feb 2021 17:07:23 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AfshaniBZ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AfshaniZ11,
  author       = {Peyman Afshani and
                  Norbert Zeh},
  editor       = {Dana Randall},
  title        = {Improved Space Bounds for Cache-Oblivious Range Reporting},
  booktitle    = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
                  2011},
  pages        = {1745--1758},
  publisher    = {{SIAM}},
  year         = {2011},
  url          = {https://doi.org/10.1137/1.9781611973082.134},
  doi          = {10.1137/1.9781611973082.134},
  timestamp    = {Tue, 02 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AfshaniZ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/AfshaniHZ10,
  author       = {Peyman Afshani and
                  Chris H. Hamilton and
                  Norbert Zeh},
  title        = {A general approach for cache-oblivious range reporting and approximate
                  range counting},
  journal      = {Comput. Geom.},
  volume       = {43},
  number       = {8},
  pages        = {700--712},
  year         = {2010},
  url          = {https://doi.org/10.1016/j.comgeo.2010.04.003},
  doi          = {10.1016/J.COMGEO.2010.04.003},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/comgeo/AfshaniHZ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AfshaniAL10,
  author       = {Peyman Afshani and
                  Lars Arge and
                  Kasper Dalgaard Larsen},
  editor       = {David G. Kirkpatrick and
                  Joseph S. B. Mitchell},
  title        = {Orthogonal range reporting: query lower bounds, optimal structures
                  in 3-d, and higher-dimensional improvements},
  booktitle    = {Proceedings of the 26th {ACM} Symposium on Computational Geometry,
                  Snowbird, Utah, USA, June 13-16, 2010},
  pages        = {240--246},
  publisher    = {{ACM}},
  year         = {2010},
  url          = {https://doi.org/10.1145/1810959.1811001},
  doi          = {10.1145/1810959.1811001},
  timestamp    = {Mon, 14 Jun 2021 16:25:04 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/AfshaniAL10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AfshaniC09,
  author       = {Peyman Afshani and
                  Timothy M. Chan},
  title        = {Dynamic Connectivity for Axis-Parallel Rectangles},
  journal      = {Algorithmica},
  volume       = {53},
  number       = {4},
  pages        = {474--487},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00453-008-9234-7},
  doi          = {10.1007/S00453-008-9234-7},
  timestamp    = {Wed, 17 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AfshaniC09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/AfshaniC09,
  author       = {Peyman Afshani and
                  Timothy M. Chan},
  title        = {On Approximate Range Counting and Depth},
  journal      = {Discret. Comput. Geom.},
  volume       = {42},
  number       = {1},
  pages        = {3--21},
  year         = {2009},
  url          = {https://doi.org/10.1007/s00454-009-9177-z},
  doi          = {10.1007/S00454-009-9177-Z},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dcg/AfshaniC09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AfshaniHZ09,
  author       = {Peyman Afshani and
                  Chris H. Hamilton and
                  Norbert Zeh},
  editor       = {John Hershberger and
                  Efi Fogel},
  title        = {Cache-oblivious range reporting with optimal queries requires superlinear
                  space},
  booktitle    = {Proceedings of the 25th {ACM} Symposium on Computational Geometry,
                  Aarhus, Denmark, June 8-10, 2009},
  pages        = {277--286},
  publisher    = {{ACM}},
  year         = {2009},
  url          = {https://doi.org/10.1145/1542362.1542412},
  doi          = {10.1145/1542362.1542412},
  timestamp    = {Mon, 14 Jun 2021 16:24:56 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/AfshaniHZ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AfshaniHZ09a,
  author       = {Peyman Afshani and
                  Chris H. Hamilton and
                  Norbert Zeh},
  editor       = {John Hershberger and
                  Efi Fogel},
  title        = {A general approach for cache-oblivious range reporting and approximate
                  range counting},
  booktitle    = {Proceedings of the 25th {ACM} Symposium on Computational Geometry,
                  Aarhus, Denmark, June 8-10, 2009},
  pages        = {287--295},
  publisher    = {{ACM}},
  year         = {2009},
  url          = {https://doi.org/10.1145/1542362.1542413},
  doi          = {10.1145/1542362.1542413},
  timestamp    = {Mon, 14 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/AfshaniHZ09a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AfshaniBC09,
  author       = {Peyman Afshani and
                  J{\'{e}}r{\'{e}}my Barbay and
                  Timothy M. Chan},
  title        = {Instance-Optimal Geometric Algorithms},
  booktitle    = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
                  2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
  pages        = {129--138},
  publisher    = {{IEEE} Computer Society},
  year         = {2009},
  url          = {https://doi.org/10.1109/FOCS.2009.34},
  doi          = {10.1109/FOCS.2009.34},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/AfshaniBC09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AfshaniAL09,
  author       = {Peyman Afshani and
                  Lars Arge and
                  Kasper Dalgaard Larsen},
  title        = {Orthogonal Range Reporting in Three and Higher Dimensions},
  booktitle    = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
                  2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
  pages        = {149--158},
  publisher    = {{IEEE} Computer Society},
  year         = {2009},
  url          = {https://doi.org/10.1109/FOCS.2009.58},
  doi          = {10.1109/FOCS.2009.58},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/AfshaniAL09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AfshaniC09,
  author       = {Peyman Afshani and
                  Timothy M. Chan},
  editor       = {Claire Mathieu},
  title        = {Optimal halfspace range reporting in three dimensions},
  booktitle    = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
  pages        = {180--186},
  publisher    = {{SIAM}},
  year         = {2009},
  url          = {https://doi.org/10.1137/1.9781611973068.21},
  doi          = {10.1137/1.9781611973068.21},
  timestamp    = {Mon, 12 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/AfshaniC09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/basesearch/Afshani08,
  author       = {Peyman Afshani},
  title        = {On Geometric Range Searching, Approximate Counting and Depth Problems},
  school       = {University of Waterloo, Ontario, Canada},
  year         = {2008},
  url          = {https://hdl.handle.net/10012/4032},
  timestamp    = {Wed, 04 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/basesearch/Afshani08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/AfshaniH08,
  author       = {Peyman Afshani and
                  Hamed Hatami},
  title        = {Approximation and inapproximability results for maximum clique of
                  disc graphs in high dimensions},
  journal      = {Inf. Process. Lett.},
  volume       = {105},
  number       = {3},
  pages        = {83--87},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.ipl.2007.08.005},
  doi          = {10.1016/J.IPL.2007.08.005},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/AfshaniH08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Afshani08,
  author       = {Peyman Afshani},
  editor       = {Dan Halperin and
                  Kurt Mehlhorn},
  title        = {On Dominance Reporting in 3D},
  booktitle    = {Algorithms - {ESA} 2008, 16th Annual European Symposium, Karlsruhe,
                  Germany, September 15-17, 2008. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5193},
  pages        = {41--51},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-87744-8\_4},
  doi          = {10.1007/978-3-540-87744-8\_4},
  timestamp    = {Sun, 02 Jun 2019 21:14:36 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/Afshani08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AfshaniF07,
  author       = {Peyman Afshani and
                  Arash Farzan},
  editor       = {Prosenjit Bose},
  title        = {Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull},
  booktitle    = {Proceedings of the 19th Annual Canadian Conference on Computational
                  Geometry, {CCCG} 2007, August 20-22, 2007, Carleton University, Ottawa,
                  Canada},
  pages        = {153--155},
  publisher    = {Carleton University, Ottawa, Canada},
  year         = {2007},
  url          = {http://cccg.ca/proceedings/2007/07a3.pdf},
  timestamp    = {Wed, 12 May 2021 14:19:37 +0200},
  biburl       = {https://dblp.org/rec/conf/cccg/AfshaniF07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/AfshaniCDFMSZ07,
  author       = {Peyman Afshani and
                  Ehsan Chiniforooshan and
                  Reza Dorrigiv and
                  Arash Farzan and
                  Mehdi Mirzazadeh and
                  Narges Simjour and
                  Hamid Zarrabi{-}Zadeh},
  editor       = {Guohui Lin},
  title        = {On the Complexity of Finding an Unknown Cut Via Vertex Queries},
  booktitle    = {Computing and Combinatorics, 13th Annual International Conference,
                  {COCOON} 2007, Banff, Canada, July 16-19, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4598},
  pages        = {459--469},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-73545-8\_45},
  doi          = {10.1007/978-3-540-73545-8\_45},
  timestamp    = {Tue, 14 May 2019 10:00:35 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoon/AfshaniCDFMSZ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AfshaniC07,
  author       = {Peyman Afshani and
                  Timothy M. Chan},
  editor       = {Jeff Erickson},
  title        = {On approximate range counting and depth},
  booktitle    = {Proceedings of the 23rd {ACM} Symposium on Computational Geometry,
                  Gyeongju, South Korea, June 6-8, 2007},
  pages        = {337--343},
  publisher    = {{ACM}},
  year         = {2007},
  url          = {https://doi.org/10.1145/1247069.1247129},
  doi          = {10.1145/1247069.1247129},
  timestamp    = {Mon, 14 Jun 2021 16:25:02 +0200},
  biburl       = {https://dblp.org/rec/conf/compgeom/AfshaniC07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0701009,
  author       = {Peyman Afshani and
                  Hamed Hatami},
  title        = {Approximation and Inapproximability Results for Maximum Clique of
                  Disc Graphs in High Dimensions},
  journal      = {CoRR},
  volume       = {abs/cs/0701009},
  year         = {2007},
  url          = {http://arxiv.org/abs/cs/0701009},
  eprinttype    = {arXiv},
  eprint       = {cs/0701009},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-cs-0701009.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AfshaniC06,
  author       = {Peyman Afshani and
                  Timothy M. Chan},
  editor       = {Yossi Azar and
                  Thomas Erlebach},
  title        = {Dynamic Connectivity for Axis-Parallel Rectangles},
  booktitle    = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
                  September 11-13, 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4168},
  pages        = {16--27},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11841036\_5},
  doi          = {10.1007/11841036\_5},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/AfshaniC06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AfshaniGGHTZ05,
  author       = {Peyman Afshani and
                  Mahsa Ghandehari and
                  Mahya Ghandehari and
                  Hamed Hatami and
                  Ruzbeh Tusserkani and
                  Xuding Zhu},
  title        = {Circular chromatic index of graphs of maximum degree 3},
  journal      = {J. Graph Theory},
  volume       = {49},
  number       = {4},
  pages        = {325--335},
  year         = {2005},
  url          = {https://doi.org/10.1002/jgt.20086},
  doi          = {10.1002/JGT.20086},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/AfshaniGGHTZ05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AfshaniC05,
  author       = {Peyman Afshani and
                  Timothy M. Chan},
  title        = {Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs},
  booktitle    = {Proceedings of the 17th Canadian Conference on Computational Geometry,
                  CCCG'05, University of Windsor, Ontario, Canada, August 10-12, 2005},
  pages        = {19--22},
  year         = {2005},
  url          = {http://www.cccg.ca/proceedings/2005/69.pdf},
  timestamp    = {Wed, 12 May 2021 14:19:37 +0200},
  biburl       = {https://dblp.org/rec/conf/cccg/AfshaniC05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/AfshaniHM04,
  author       = {Peyman Afshani and
                  Hamed Hatami and
                  Ebadollah S. Mahmoodian},
  title        = {On the spectrum of the forced matching number of graphs},
  journal      = {Australas. {J} Comb.},
  volume       = {30},
  pages        = {147--160},
  year         = {2004},
  url          = {http://ajc.maths.uq.edu.au/pdf/30/ajc\_v30\_p147.pdf},
  timestamp    = {Wed, 11 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ajc/AfshaniHM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics