Saladi Rahul

Orcid: 0000-0001-5984-0934

According to our database1, Saladi Rahul authored at least 29 papers between 2009 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022
Generic Techniques for Building Top-<i>k</i> Structures.
ACM Trans. Algorithms, 2022

Orthogonal point location and rectangle stabbing queries in 3-d.
J. Comput. Geom., 2022

New Bounds for Range Closest-Pair Problems.
Discret. Comput. Geom., 2022

A Simple Polynomial Time Algorithm for Max Cut on Laminar Geometric Intersection Graphs.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021
Approximate range counting revisited.
J. Comput. Geom., 2021

Active-Learning a Convex Body in Low Dimensions.
Algorithmica, 2021

Simple Multi-Pass Streaming Algorithms for Skyline Points and Extreme Points.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Optimal Algorithms for Range Searching over Multi-Armed Bandits.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020
An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ<sup>3</sup>.
Math. Oper. Res., 2020

Searching for the closest-pair in a query translate.
J. Comput. Geom., 2020

Range closest-pair search in higher dimensions.
Comput. Geom., 2020

2019
A Guide to Designing Top-k Indexes.
SIGMOD Rec., 2019

2018
Two (Known) Results About Graphs with No Short Odd Cycles.
CoRR, 2018

2016
New Results for Adaptive and Approximate Counting of Inversions.
CoRR, 2016

Efficient Top-k Indexing via General Reductions.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

2015
Range search on tuples of points.
J. Discrete Algorithms, 2015

A Bottleneck Matching Problem with Edge-Crossing Constraints.
Int. J. Comput. Geom. Appl., 2015

Improved Bounds for Orthogonal Point Enclosure Query and Point Location in Orthogonal Subdivisions in ℝ<sup>3</sup>.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

On Top-k Range Reporting in 2D Space.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

2014
A General Technique for Top-$k$ Geometric Intersection Query Problems.
IEEE Trans. Knowl. Data Eng., 2014

2012
Algorithms for range-skyline queries.
Proceedings of the SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), 2012

Colored Range Searching on Internal Memory.
Proceedings of the Database Systems for Advanced Applications, 2012

2011
Data Structures for Range-Aggregation over Categories.
Int. J. Found. Comput. Sci., 2011

Efficient Top-<i>k</i> Queries for Orthogonal Ranges.
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

Range-Aggregate Queries Involving Geometric Aggregation Operations.
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

2010
Range aggregate structures for colored geometric objects.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
Data Structures for Range Aggregation by Categories.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009


  Loading...