default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaladi Rahul
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j13]Jie Xue
, Yuan Li, Saladi Rahul, Ravi Janardan:
New Bounds for Range Closest-Pair Problems. Discret. Comput. Geom. 68(1): 1-49 (2022)- [j12]Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis:
Orthogonal point location and rectangle stabbing queries in 3-d. J. Comput. Geom. 13(1) (2022) - [j11]Saladi Rahul, Yufei Tao:
Generic Techniques for Building Top-k Structures. ACM Trans. Algorithms 18(4): 38:1-38:23 (2022) - 2021
- [j10]Sariel Har-Peled, Mitchell Jones, Saladi Rahul:
Active-Learning a Convex Body in Low Dimensions. Algorithmica 83(6): 1885-1917 (2021) - [j9]Saladi Rahul:
Approximate range counting revisited. J. Comput. Geom. 12(1): 40-69 (2021) - 2020
- [j8]Timothy M. Chan, Saladi Rahul, Jie Xue:
Range closest-pair search in higher dimensions. Comput. Geom. 91: 101669 (2020) - [j7]Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan:
Searching for the closest-pair in a query translate. J. Comput. Geom. 11(2): 26-61 (2020) - [j6]Saladi Rahul:
An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3. Math. Oper. Res. 45(1): 369-383 (2020) - 2019
- [j5]Saladi Rahul, Yufei Tao:
A Guide to Designing Top-k Indexes. SIGMOD Rec. 48(2): 6-17 (2019) - 2015
- [j4]John Gunnar Carlsson, Benjamin Armbruster, Saladi Rahul, Haritha Bellam:
A Bottleneck Matching Problem with Edge-Crossing Constraints. Int. J. Comput. Geom. Appl. 25(4): 245-262 (2015) - [j3]Akash Agrawal, Saladi Rahul, Yuan Li, Ravi Janardan:
Range search on tuples of points. J. Discrete Algorithms 30: 1-12 (2015) - 2014
- [j2]Saladi Rahul, Ravi Janardan:
A General Technique for Top-$k$ Geometric Intersection Query Problems. IEEE Trans. Knowl. Data Eng. 26(12): 2859-2871 (2014) - 2011
- [j1]Saladi Rahul, Prosenjit Gupta, Krishnan Sundara Rajan:
Data Structures for Range-Aggregation over Categories. Int. J. Found. Comput. Sci. 22(7): 1707-1728 (2011)
Conference and Workshop Papers
- 2023
- [c20]Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, Andreas Wiese:
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set. SoCG 2023: 46:1-46:17 - [c19]Yakov Nekrich, Saladi Rahul:
4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time. SODA 2023: 1862-1876 - 2022
- [c18]Utkarsh Joshi, Saladi Rahul, Josson Joe Thoppil:
A Simple Polynomial Time Algorithm for Max Cut on Laminar Geometric Intersection Graphs. FSTTCS 2022: 21:1-21:12 - 2021
- [c17]Siddharth Barman, Ramakrishnan Krishnamurthy, Saladi Rahul:
Optimal Algorithms for Range Searching over Multi-Armed Bandits. IJCAI 2021: 2177-2183 - [c16]Timothy M. Chan, Saladi Rahul:
Simple Multi-Pass Streaming Algorithms for Skyline Points and Extreme Points. STACS 2021: 22:1-22:14 - 2020
- [c15]Sariel Har-Peled, Mitchell Jones, Saladi Rahul:
Active Learning a Convex Body in Low Dimensions. ICALP 2020: 64:1-64:17 - 2019
- [c14]Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan:
Searching for the Closest-Pair in a Query Translate. SoCG 2019: 61:1-61:15 - [c13]Timothy M. Chan, Saladi Rahul, Jie Xue:
Range Closest-Pair Search in Higher Dimensions. WADS 2019: 269-282 - 2018
- [c12]Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan:
New Bounds for Range Closest-Pair Problems. SoCG 2018: 73:1-73:14 - [c11]Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis:
Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. ICALP 2018: 31:1-31:14 - 2017
- [c10]Saladi Rahul:
Approximate Range Counting Revisited. SoCG 2017: 55:1-55:15 - 2016
- [c9]Saladi Rahul, Yufei Tao:
Efficient Top-k Indexing via General Reductions. PODS 2016: 277-288 - 2015
- [c8]Saladi Rahul, Yufei Tao:
On Top-k Range Reporting in 2D Space. PODS 2015: 265-275 - [c7]Saladi Rahul:
Improved Bounds for Orthogonal Point Enclosure Query and Point Location in Orthogonal Subdivisions in ℝ3. SODA 2015: 200-211 - 2012
- [c6]Haritha Bellam, Saladi Rahul, Krishnan Rajan:
Colored Range Searching on Internal Memory. DASFAA (2) 2012: 111-125 - [c5]Saladi Rahul, Ravi Janardan:
Algorithms for range-skyline queries. SIGSPATIAL/GIS 2012: 526-529 - 2011
- [c4]Saladi Rahul, Prosenjit Gupta, Ravi Janardan, Krishnan Sundara Rajan:
Efficient Top-k Queries for Orthogonal Ranges. WALCOM 2011: 110-121 - [c3]Saladi Rahul, Ananda Swarup Das, Krishnan Sundara Rajan, Kannan Srinathan:
Range-Aggregate Queries Involving Geometric Aggregation Operations. WALCOM 2011: 122-133 - 2010
- [c2]Saladi Rahul, Haritha Bellam, Prosenjit Gupta, Krishnan Rajan:
Range aggregate structures for colored geometric objects. CCCG 2010: 249-252 - 2009
- [c1]Saladi Rahul, Prosenjit Gupta, K. S. Rajan:
Data Structures for Range Aggregation by Categories. CCCG 2009: 133-136
Informal and Other Publications
- 2024
- [i14]Karthik C. S., Saladi Rahul:
Range Longest Increasing Subsequence and its Relatives: Beating Quadratic Barrier and Approaching Optimality. CoRR abs/2404.04795 (2024) - [i13]Sariel Har-Peled, Saladi Rahul:
Approximating Densest Subgraph in Geometric Intersection Graphs. CoRR abs/2405.18337 (2024) - [i12]L. Sunil Chandran, Rishikesh Gajjala, Shravan Mehra, Saladi Rahul:
Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones. CoRR abs/2407.16323 (2024) - 2023
- [i11]Arindam Khan, Aditya Lonkar, Saladi Rahul, Aditya Subramanian, Andreas Wiese:
Online and Dynamic Algorithms for Geometric Set Cover and Hitting Set. CoRR abs/2303.09524 (2023) - 2022
- [i10]Yakov Nekrich, Saladi Rahul:
4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time. CoRR abs/2211.03161 (2022) - 2021
- [i9]Siddharth Barman, Ramakrishnan Krishnamurthy, Saladi Rahul:
Optimal Algorithms for Range Searching over Multi-Armed Bandits. CoRR abs/2105.01390 (2021) - 2019
- [i8]Sariel Har-Peled, Mitchell Jones, Saladi Rahul:
Active Learning a Convex Body in Low Dimensions. CoRR abs/1903.03693 (2019) - [i7]Timothy M. Chan, Saladi Rahul, Jie Xue:
Range closest-pair search in higher dimensions. CoRR abs/1905.01029 (2019) - 2018
- [i6]Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis:
Orthogonal Point Location and Rectangle Stabbing Queries in 3-d. CoRR abs/1805.08602 (2018) - [i5]Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan:
Searching for the closest-pair in a query translate. CoRR abs/1807.09498 (2018) - [i4]Sariel Har-Peled, Saladi Rahul:
Two (Known) Results About Graphs with No Short Odd Cycles. CoRR abs/1810.01832 (2018) - 2017
- [i3]Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan:
New bounds for range closest-pair problems. CoRR abs/1712.09749 (2017) - 2016
- [i2]Saladi Rahul:
New Results for Adaptive and Approximate Counting of Inversions. CoRR abs/1612.08097 (2016) - 2015
- [i1]Saladi Rahul:
Approximate Range Counting Revisited. CoRR abs/1512.01713 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 20:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
