Srinivasa Rao Satti
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
38
Venues
17
Active years
2009–2026
Best venue rank
A*
Where they publish
Papers
38 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ESA | Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries. | Pawel Gawrychowski, Adam Grkiewicz, Srinivasa Rao Satti |
| 2025 | CPM | Encodings for Range Minimum Queries over Bounded Alphabets. | Seungbum Jo, Srinivasa Rao Satti |
| 2024 | ESA | A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs. | Kou Hamada, Sankardeep Chakraborty, Seungbum Jo, Takuto Koriyama, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2023 | DCC | Practical Implementations of Compressed RAM. | Seungbum Jo, Wooyoung Park, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2023 | WALCOM | Energy Efficient Sorting, Selection and Searching. | Varunkumar Jayapaul, Seungbum Jo, Krishna V. Palem, Srinivasa Rao Satti |
| 2021 | COCOA | Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. | Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2021 | DCC | Succinct representations of Intersection Graphs on a Circle. | Hseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2021 | DCC | Succinct Data Structures for Small Clique-Width Graphs. | Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2021 | LATA | Succinct Representations for (Non)Deterministic Finite Automata. | Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2020 | ISAAC | Enumerating Range Modes. | Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2020 | IWOCA | Optimal In-place Algorithms for Basic Graph Problems. | Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti |
| 2019 | FCT | Space Efficient Algorithms for Breadth-Depth Search. | Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti |
| 2019 | WADS | Succinct Data Structures for Families of Interval Graphs. | Hseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti |
| 2018 | COCOON | Minimum Transactions Problem. | Niranka Banerjee, Varunkumar Jayapaul, Srinivasa Rao Satti |
| 2018 | CSR | Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds. | Niranka Banerjee, Venkatesh Raman, Srinivasa Rao Satti |
| 2018 | ESA | A Framework for In-place Graph Algorithms. | Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti |
| 2018 | ISAAC | Approximate Query Processing over Static Sets and Sliding Windows. | Ran Ben-Basat, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare |
| 2018 | ISAAC | Encoding Two-Dimensional Range Top-k Queries Revisited. | Seungbum Jo, Srinivasa Rao Satti |
| 2017 | COCOON | Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications. | Sankardeep Chakraborty, Srinivasa Rao Satti |
| 2017 | CPM | Synergistic Solutions on MultiSets. | Jrmy Barbay, Carlos Ochoa, Srinivasa Rao Satti |
| 2017 | FAW | The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments. | Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti |
| 2016 | CPM | Encoding Two-Dimensional Range Top-k Queries. | Seungbum Jo, Rahul Lingala, Srinivasa Rao Satti |
| 2016 | ISAAC | Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits. | Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti |
| 2016 | WALCOM | Finding Mode Using Equality Comparisons. | Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti |
| 2015 | COCOON | Simultaneous Encodings for Range and Next/Previous Larger/Smaller Value Queries. | Seungbum Jo, Srinivasa Rao Satti |
| 2015 | WADS | Sorting and Selection with Equality Comparisons. | Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, Srinivasa Rao Satti |
| 2015 | WALCOM | Dynamic Online Multiselection in Internal and External Memory. | Jrmy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan P. Sorenson |
| 2015 | WALCOM | Compact Encodings and Indexes for the Nearest Larger Neighbor Problem. | Seungbum Jo, Rajeev Raman, Srinivasa Rao Satti |
| 2014 | DCC | Compressed Bit Vectors Based on Variable-to-Fixed Encodings. | Seungbum Jo, Stelios Joannou, Daisuke Okanohara, Rajeev Raman, Srinivasa Rao Satti |
| 2014 | IWOCA | Space Efficient Data Structures for Nearest Larger Neighbor. | Varunkumar Jayapaul, Seungbum Jo, Venkatesh Raman, Srinivasa Rao Satti |
| 2013 | COCOON | Selection from Read-Only Memory with Limited Workspace. | Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti |
| 2013 | ESA | Theory and Implementation of Online Multiselection Algorithms. | Jrmy Barbay, Ankur Gupta, Seungbum Jo, Srinivasa Rao Satti, Jonathan P. Sorenson |
| 2013 | ESA | Encodings for Range Selection and Top-k Queries. | Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti |
| 2013 | ICALP | Dynamic Compressed Strings with Random Access. | Roberto Grossi, Rajeev Raman, Srinivasa Rao Satti, Rossano Venturini |
| 2012 | COCOON | Succinct Representations of Binary Trees for Range Minimum Queries. | Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti |
| 2011 | SODA | Random Access to grammar-Compressed Strings. | Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann |
| 2011 | TAMC | Integer Representations towards Efficient Counting in the Bit Probe Model. | Gerth Stlting Brodal, Mark Greve, Vineet Pandey, Srinivasa Rao Satti |
| 2009 | PODS | Secondary indexing in one dimension: beyond b-trees and bitmap indexes. | Rasmus Pagh, Srinivasa Rao Satti |