| No. |
Title |
Author |
Year |
| 1 |
Lower Bounds for Intersection Reporting Among Flat Objects |
Afshani, Peyman et al. |
2023 |
| 2 |
On Range Summary Queries |
Afshani, Peyman et al. |
2023 |
| 3 |
Hierarchical Categories in Colored Searching |
Afshani, Peyman et al. |
2022 |
| 4 |
On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem |
Afshani, Peyman et al. |
2022 |
| 5 |
On Semialgebraic Range Reporting |
Afshani, Peyman et al. |
2022 |
| 6 |
Lower Bounds for Semialgebraic Range Searching and Stabbing Problems |
Afshani, Peyman et al. |
2021 |
| 7 |
A New Lower Bound for Semigroup Orthogonal Range Searching |
Afshani, Peyman |
2019 |
| 8 |
Fragile Complexity of Comparison-Based Algorithms |
Afshani, Peyman et al. |
2019 |
| 9 |
Independent Range Sampling, Revisited Again |
Afshani, Peyman et al. |
2019 |
| 10 |
Lower Bounds for Multiplication via Network Coding |
Afshani, Peyman et al. |
2019 |
| 11 |
Independent Range Sampling, Revisited |
Afshani, Peyman et al. |
2017 |
| 12 |
Permuting and Batched Geometric Lower Bounds in the I/O Model |
Afshani, Peyman et al. |
2017 |
| 13 |
Applications of Incidence Bounds in Point Covering Problems |
Afshani, Peyman et al. |
2016 |
| 14 |
Data Structure Lower Bounds for Document Indexing Problems |
Afshani, Peyman et al. |
2016 |
