The following pages link to Peyman Afshani (Q359870):
Displaying 50 items.
- (Approximate) uncertain skylines (Q359874) (← links)
- Cache-oblivious range reporting with optimal queries requires superlinear space (Q540448) (← links)
- A general approach for cache-oblivious range reporting and approximate range counting (Q991183) (← links)
- Dynamic connectivity for axis-parallel rectangles (Q1016519) (← links)
- The query complexity of a permutation-based variant of mastermind (Q1741495) (← links)
- Optimal deterministic shallow cuttings for 3-d dominance ranges (Q1755735) (← links)
- Approximation and inapproximability results for maximum clique of disc graphs in high dimensions (Q2380046) (← links)
- The Query Complexity of Finding a Hidden Permutation (Q2848962) (← links)
- Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model (Q2874593) (← links)
- Improved pointer machine and I/O lower bounds for simplex range reporting and related problems (Q2874595) (← links)
- IMPROVED POINTER MACHINE AND I/O LOWER BOUNDS FOR SIMPLEX RANGE REPORTING AND RELATED PROBLEMS (Q2875643) (← links)
- Lower Bounds for Sorted Geometric Queries in the I/O Model (Q2912825) (← links)
- Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls (Q2948466) (← links)
- (Q3132896) (← links)
- Instance-Optimal Geometric Algorithms (Q3177884) (← links)
- I/O-Efficient Range Minima Queries (Q3188877) (← links)
- Sorting and Permuting without Bank Conflicts on GPUs (Q3452764) (← links)
- On Dominance Reporting in 3D (Q3541072) (← links)
- On the Complexity of Finding an Unknown Cut Via Vertex Queries (Q3608870) (← links)
- An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization (Q4555537) (← links)
- Cross-Referenced Dictionaries and the Limits of Write Optimization (Q4575842) (← links)
- (Q4598234) (← links)
- (Q4607940) (← links)
- (Q4633824) (← links)
- On the spectrum of the forced matching number of graphs (Q4820537) (← links)
- Fragile complexity of comparison-based algorithms (Q5075734) (← links)
- A New Lower Bound for Semigroup Orthogonal Range Searching (Q5088928) (← links)
- (Q5088929) (← links)
- Lower Bounds for Multiplication via Network Coding (Q5091158) (← links)
- Permuting and Batched Geometric Lower Bounds in the I/O Model (Q5111685) (← links)
- (Q5111686) (← links)
- A Lower Bound for Jumbled Indexing (Q5146803) (← links)
- Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM (Q5167732) (← links)
- (Q5171169) (← links)
- Orthogonal Range Reporting in Three and Higher Dimensions (Q5171171) (← links)
- An Efficient Algorithm for the 1D Total Visibility-Index Problem (Q5232583) (← links)
- Circular chromatic index of graphs of maximum degree 3 (Q5311922) (← links)
- (Q5365050) (← links)
- (Q5365152) (← links)
- Cache-oblivious range reporting with optimal queries requires superlinear space (Q5370727) (← links)
- A general approach for cache-oblivious range reporting and approximate range counting (Q5370728) (← links)
- Concurrent Range Reporting in Two-Dimensional Space (Q5384035) (← links)
- Optimal Deterministic Shallow Cuttings for 3D Dominance Ranges (Q5384064) (← links)
- Fast Computation of Output-Sensitive Maxima in a Word RAM (Q5384066) (← links)
- Orthogonal range reporting (Q5405888) (← links)
- Dynamic Connectivity for Axis-Parallel Rectangles (Q5449513) (← links)
- On approximate range counting and depth (Q5901406) (← links)
- On approximate range counting and depth (Q5902137) (← links)
- On semialgebraic range reporting (Q6145667) (← links)
- Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions (Q6159411) (← links)
