Peyman Afshani | DeepAI

AI Chat

Featured Co-authors

Benjamin Doerr
91 publications
Carola Doerr
90 publications
Jie Gao
54 publications
Maarten Löffler
42 publications
Kasper Green Larsen
38 publications
Jeff M. Phillips
36 publications
Irina Kostitsyna
28 publications
Zhewei Wei
27 publications
Mark de Berg
24 publications
Kevin Buchin
24 publications
Anne Driemel
22 publications

∙ 05/04/2023

On Range Summary Queries

We study the query version of the approximate heavy hitter and quantile ...

0 Peyman Afshani, et al. ∙

∙ 02/22/2023

Lower Bounds for Intersection Reporting among Flat Objects

Recently, Ezra and Sharir [ES22a] showed an O(n^3/2+σ) space and O(n^1/2...

0 Peyman Afshani, et al. ∙

∙ 10/26/2022

An Optimal Lower Bound for Simplex Range Reporting

We give a simplified and improved lower bound for the simplex range repo...

0 Peyman Afshani, et al. ∙

∙ 10/11/2022

Hierarchical Categories in Colored Searching

In colored range counting (CRC), the input is a set of points where each...

0 Peyman Afshani, et al. ∙

∙ 03/14/2022

On Cyclic Solutions to the Min-Max Latency Multi-Robot Patrolling Problem

We consider the following surveillance problem: Given a set P of n sites...

0 Peyman Afshani, et al. ∙

∙ 03/14/2022

On Semialgebraic Range Reporting

In the problem of semialgebraic range searching, we are to preprocess a ...

0 Peyman Afshani, et al. ∙

∙ 12/01/2020

Lower Bounds for Semialgebraic Range Searching and Stabbing Problems

In the semialgebraic range searching problem, we are to preprocess n poi...

0 Peyman Afshani, et al. ∙

∙ 11/01/2020

A Lower Bound for Dynamic Fractional Cascading

We investigate the limits of one of the fundamental ideas in data struct...

0 Peyman Afshani, et al. ∙

∙ 09/11/2020

2D Fractional Cascading on Axis-aligned Planar Subdivisions

Fractional cascading is one of the influential techniques in data struct...

0 Peyman Afshani, et al. ∙

∙ 05/05/2020

Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency

We consider the problem of finding patrol schedules for k robots to visi...

5 Peyman Afshani, et al. ∙

∙ 03/19/2019

Independent Range Sampling, Revisited Again

We revisit the range sampling problem: the input is a set of points wher...

0 Peyman Afshani, et al. ∙

∙ 03/19/2019

A New Lower Bound for Semigroup Orthogonal Range Searching

We report the first improvement in the space-time trade-off of lower bou...

0 Peyman Afshani, et al. ∙

∙ 02/28/2019

Lower Bounds for Multiplication via Network Coding

Multiplication is one of the most fundamental computational problems, ye...

0 Peyman Afshani, et al. ∙

∙ 01/09/2019

Fragile Complexity of Comparison-Based Algorithms

We initiate a study of algorithms with a focus on the computational comp...

0 Peyman Afshani, et al. ∙

∙ 12/20/2018

The Query Complexity of a Permutation-Based Variant of Mastermind

We study the query complexity of a permutation-based variant of the gues...

0 Peyman Afshani, et al. ∙

∙ 07/15/2017

On the complexity of range searching among curves

Modern tracking technology has made the collection of large numbers of d...

0 Peyman Afshani, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world