Picture taken in Seattle, USA.
[July 2019] I am thrilled to join IISc, CSA dept. as an Assistant Professor.
- [Nov 2017] I will be starting a postdoc at UIUC! My hosts are Prof. Timothy Chan and Prof. Sariel Har-Peled.
[Feb 2017] My solo author paper on approximate range counting has been accepted at SoCG 2017!!!
[November 2016] Visited University of Waterloo, Canada to work with Prof. Timothy Chan.
[Summer 2015] I will be doing an internship at Microsoft Research in Redmond, Washington.
[Spring 2015] My paper along with Prof. Yufei Tao has been accepted at PODS 2015.
[Fall 2014] My paper (solo author) on rectangle stabbing and point location in three-dimensions has been accepted at SODA :) Hurray !!!
[Spring 2014] I have been awarded Doctoral Dissertation Fellowship (DDF) for 2014-15 by Univeristy of Minnesota.
[Spring 2012] Visited CUHK, Hong Kong to work with Prof. Yufei Tao.
[Fall 2012] Awarded first prize for my presentation in "Fast Forward Preview Session" at ACM SIGSPATIAL GIS 2012.
[Fall 2011] Awarded the UMN Computer Science department fellowship for Fall 2011.
Email: saladi [at] iisc [dot] ac [dpt] in
I am an Assistant Professor of Department of Computer Science and Automation at the Indian Institute of Science .
Prior to joining IISc, I did a postdoc at University of Illinois Urbana-Champaign (UIUC). I received my Ph.D. from University of Minnesota.
Current research interests: Geometric algorithms and data structures, Approximation algorithms, and Streaming algorithms.
During my Ph.D. I worked on range-searching problems
which has been very well studied by the computational geometry
and the database community. In range-searching queries, the user
is not interested in the entire input geometric dataset, but only
in a small subset of it and requests an informative summary
of that small subset of the data. In many applications (such as
Google Maps, Yelp, housing/dating websites) the same dataset
is queried several times, in which case one would like to answer
the queries faster by preprocessing the dataset into a data-structure.
The goal is to organize the data into a data-structure which occupies
a small amount of space on the computer and yet responds to any user query in
real-time. Read my thesis, or/and
defense slides, or/and
research statement for details...
20. Sariel Har-Peled, Mitchell Jones, Saladi Rahul
Active Learning a Convex Body in Low Dimensions.
19. Saladi Rahul
A Linear-Time Algorithm to Compute the Approximate Number of Inversions
18. Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan.
Searching for the closest-pair in a query translate
35th International Symposium on Computational Geometry (SoCG 2019)
17. Timothy M. Chan, Saladi Rahul, Jie Xue.
Range closest-pair search in higher dimensions
Algorithms and Data Structures Symposium (WADS 2019)
16. Timothy M. Chan, Yakov Nekrich, Saladi Rahul, Konstantinos Tsakalidis.
Orthogonal Point Location and Rectangle Stabbing Queries in 3-d
45th International Colloquium on Automata, Languages, and Programming (ICALP 2018).
15. Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan.
New bounds for range closest-pair problems.
34rd International Symposium on Computational Geometry (SoCG 2018)
14. Saladi Rahul.
Approximate Range Counting Revisited
33rd International Symposium on Computational Geometry (SoCG 2017)
13. Prosenjit Gupta, Ravi Janardan, Saladi Rahul, Michiel Smid.
Computational Geometry: Generalized (or Colored) Intersection Searching
Handbook of Data Structures and Applications, Sartaj Sahni and Dinesh Mehta eds., CRC Press, 2nd Edition. (To Appear).
12. Saladi Rahul, Yufei Tao.
Efficient Top-k Indexing via General Reductions
35th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), 2016
11. Saladi Rahul.
Improved Bounds for Orthogonal Point Enclosure Query and Point Location in Orthogonal Subdivisions in R3
ACM-SIAM Symposium on Discrete Algorithms (SODA 2015)
10. Saladi Rahul, Yufei Tao.
On Top-k Range Reporting in 2D Space
34th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), 2015
9. Akash Agrawal, Saladi Rahul, Yuan Li, Ravi Janardan.
Range search on tuples of points
Journal of Discrete Algorithms 30: 1-12 (2015)
8. Saladi Rahul, Ravi Janardan.
A General Technique for Top-k Geometric Intersection Query Problems[PDF]
IEEE Transactions on Knowledge and Data Engineering (IEEE TKDE), 2014.
7. Saladi Rahul, Ravi Janardan.
Algorithms for Range-Skyline Queries[PDF]
20th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL GIS), 2012.
6. Haritha Bellam, Saladi Rahul, Krishnan Rajan.
Colored Range Searching on Internal Memory[PDF]
Proc. of 17th International Conference on Database Systems for Advanced Applications (DASFAA), pages 111-125, 2012.
5. Saladi Rahul, Prosenjit Gupta, K. S. Rajan.
Data Structures for Range-Aggregation over Categories[PDF]
International Journal of Foundations of Computer Science, 22(7): 1707-1728, 2011.
4. Saladi Rahul, Prosenjit Gupta, Ravi Janardan, K. S. Rajan.
Efficient Top-k Queries for Orthogonal Ranges [PDF]
Proc. of 5th International Workshop on Algorithms and Computation (WALCOM), pages 110-121, 2011.
3. Saladi Rahul, Ananda Swarup Das, K. S. Rajan, Kannan Srinathan.
Range-Aggregate Queries Involving Geometric Aggregation Operations[PDF]
Proc. of 5th International Workshop on Algorithms and Computation (WALCOM), pages 122-133, 2011.
2. Saladi Rahul, Haritha Bellam, Prosenjit Gupta, Krishnan Rajan.
Range aggregate structures for colored geometric objects[PDF]
Proc. of 22nd Annual Canadian Conference on Computational Geometry (CCCG), pages 249-252, 2010.
1. Saladi Rahul, Prosenjit Gupta, K. S. Rajan.
Data Structures for Range Aggregation by Categories [PDF]
Proc. of 21st Annual Canadian Conference on Computational Geometry (CCCG), pages 133-136, 2009.
Back to top