Home     Publications
Madalgo

Sorting and Permuting without Bank Conflicts on GPUs

Peyman Afshani and Nodari Sitchinava
In ESA 15: Proceedings of the 23rd conference on Annual European Symposium, pages 13--24, 2015


Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls

Wanbin Son and Peyman Afshani
In (TAMC 12) Theory and Applications of Models of Computation, pages 189--199, 2015


Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM

Peyman Afshani and Timothy M. Chan and Konstantinos Tsakalidis
In ICALP 14: Proceedings of the 41st International Colloquium on Automata Languages and Programming, pages 77-88, 2014


I/O-Efficient Range Minima Queries

Peyman Afshani and Nodari Sitchinava
In SWAT 14: Proceedings of the 14th Scandinavian Symposium and Workshops, pages 1-12, 2014


Concurrent Range Reporting in Two-Dimensional Space

Peyman Afshani and Bryan Wilkinson and Yufei Tao and Cheng Sheng
In SODA 14: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 983-994, 2014


Determistic Shallow Cuttings for 3D Dominance Ranges

Peyman Afshani and Konstantinos Tsakalidis
In SODA 14: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1389--1398, 2014


Fast Computation of Output Sensitive Maxima in a Word RAM

Peyman Afshani
In SODA 14: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1414-1423, 2014


Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model

Peyman Afshani and Lars Arge and Kasper Green Larsen
In SoCG 12: Proceedings of the 28th Annual Symposuim on Computational Geometry, pages 323-332, 2012


Improved pointer machine and I/O lower bounds for simplex range reporting and related problems

Peyman Afshani
In SoCG 12: Proceedings of the 28th Annual Symposuim on Computational Geometry, pages 339-346, 2012


Lower Bounds for Sorted Geometric Queries in the I/O Model

Peyman Afshani and Norbert Zeh
In ESA 12: Proceedings of the 20th Annual European Symposium, pages 48-59, 2012


(Approximate) Uncertain Skylines

Peyman Afshani and Pankaj K. Agarwal and Lars Arge and Kasper Green Larsen and Jeff M. Phillips
Theory of Computing Systems, volume 52, pages 342-366, 2013


Ordered and Unordered Top-K Range Reporting in Large Data Sets

Peyman Afshani and Gerth Brodal and Norbert Zeh
In SODA 11: Proceedings of the 22nd Annual Symposium on Discrete Algorithms, pages 390-400, 2011


Improved Space Bounds for Cache-Oblivious Range Reporting

Peyman Afshani and Norbert Zeh
In SODA 11: Proceedings of the 22nd Annual Symposium on Discrete Algorithms, pages 1745-1758, 2011


Orthogonal range reporting: query lower bounds optimal structures in 3-d and higher dimensional improvements

Peyman Afshani and Lars Arge and Kasper Dalgaard Larsen
In SoCG 10: Proceedings of the 26th Annual Symposium on Computational Geometry, pages 240--246, 2010


Orthogonal range reporting in three and higher dimensions

Peyman Afshani and Lars Arge and Kasper Dalgaard Larsen
In FOCS 09: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, pages 149--158, 2009


Instance-optimal geometric algorithms

Peyman Afshani and Jérémy Barbay and Timothy M. Chan
In FOCS 09: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, pages 129--138, 2009


Cache-oblivious range reporting with optimal queries requires superlinear space

Peyman Afshani and Chris Hamilton and Norbert Zeh
Dicrete and Computational Geometry, volume 45, pages 824-850, 2011


A general approach for cache-oblivious range reporting and approximate range counting

Peyman Afshani and Chris Hamilton and Norbert Zeh
Computational Geometry: Theory and Applications, volume 43, pages 700-712, 2010


Optimal halfspace range reporting in three dimensions

Peyman Afshani and Timothy M. Chan
In SODA 09: Proceedings of the 19th Annual Symposium on Discrete Algorithms, pages 180--186, 2009


On dominance reporting in 3D

Peyman Afshani
In ESA 08: Proceedings of the 16th conference on Annual European Symposium, pages 41--51, 2008


Approximation and inapproximability results for maximum clique of disc graphs in high dimensions

Peyman Afshani and Hamed Hatami
Information Processing Letters, volume 105, pages 83--87, January 2008


On approximate range counting and depth

Peyman Afshani and Timothy M. Chan
Discrete and Computational Geometry, volume 42, pages 3--21, 2009


Cache-oblivious output-sensitive two-dimensional convex hull

Peyman Afshani and Arash Farzan
In Proceedings of the 19th Annual Canadian Conference on Computational Geometry, pages 153--155, 2007


On the complexity of finding an unknown cut via vertex queries

Peyman Afshani and Ehsan Chiniforooshan and Reza Dorrigiv and Arash Farzan and Mehdi Mirzazadeh and Narges Simjour and Hamid Zarrabi-Zadeh
In 13th Annual International Computing and Combinatorics Conference (COCOON 2007), pages 459--469, July 2007


Dynamic Connectivity for Axis-Parallel Rectangles

Peyman Afshani and Timothy M. Chan
Algorithmica, volume 53, pages 474-487, 2009
preliminary version at ESA 06


Approximation algorithms for maximum cliques in 3D unit-disk graphs

Peyman Afshani and Timothy M. Chan
In 17th Canadian Conference on Computational Geometry (CCCG), pages 6--9, 2005


Circular chromatic index of graphs of maximum degree 3

Peyman Afshani and Mahsa Ghandehari and Mahya Ghandehari and Hamed Hatami and Ruzbeh Tusserkani and Xuding Zhu
Journal Of Graph Theory, volume 49, pages 325--335, 2005


On the size of the spectrum of the forced matching number of graphs

Peyman Afshani and Hamed Hatami and E.S. Mahmoodian
Australasian Journal of Combinatorics, volume 30, pages 147--160, 2004