Srinivasa Rao Satti

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 64

Top Topics

Deterministic Finite Automata

Top Venues

Theor. Comput. Sci.

Publications

Kou Hamada, Sankardeep Chakraborty, Seungbum Jo, Takuto Koriyama, Kunihiko Sadakane, Srinivasa Rao Satti
A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs. CoRR (2024)
Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct data structures for bounded clique-width graphs. Discret. Appl. Math. 352 (2024)
Varunkumar Jayapaul, Seungbum Jo, Krishna V. Palem, Srinivasa Rao Satti
Energy efficient sorting, selection and searching. Theor. Comput. Sci. 1002 (2024)
Wooyoung Park, Seungbum Jo, Srinivasa Rao Satti
Practical Implementation of Encoding Range Top-2 Queries. Comput. J. 66 (11) (2023)
Seungbum Jo, Wooyoung Park, Kunihiko Sadakane, Srinivasa Rao Satti
Practical Implementations of Compressed RAM. DCC (2023)
Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct representation for (non)deterministic finite automata. J. Comput. Syst. Sci. 131 (2023)
Varunkumar Jayapaul, Seungbum Jo, Krishna Palem, Srinivasa Rao Satti
Energy Efficient Sorting, Selection and Searching. WALCOM (2023)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct navigational oracles for families of intersection graphs on a circle. Theor. Comput. Sci. 928 (2022)
Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti
Finding kings in tournaments. Discret. Appl. Math. 322 (2022)
Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti
Frameworks for designing in-place graph algorithms. J. Comput. Syst. Sci. 123 (2022)
Tatsuya Yanagita, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
Space-Efficient Data Structure for Posets with Applications. SWAT (2022)
Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. CoRR (2021)
Ran Ben Basat, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare
Approximate query processing over static sets and sliding windows. Theor. Comput. Sci. 885 (2021)
Seungbum Jo, Rahul Lingala, Srinivasa Rao Satti
Encoding Two-Dimensional Range Top-k Queries. Algorithmica 83 (11) (2021)
Junhee Lee, Edman Anjos, Srinivasa Rao Satti
SJSON: A succinct representation for JSON documents. Inf. Syst. 97 (2021)
Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Representations for (Non)Deterministic Finite Automata. LATA (2021)
Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. COCOA (2021)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct representations of Intersection Graphs on a Circle. DCC (2021)
Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Data Structures for Small Clique-Width Graphs. DCC (2021)
Arindam Biswas, Venkatesh Raman, Srinivasa Rao Satti, Saket Saurabh
Space-Efficient FPT Algorithms. CoRR (2021)
Seungbum Jo, Wooyoung Park, Srinivasa Rao Satti
Practical Implementation of Encoding Range Top-2 Queries. SEA (2021)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti
Succinct Encodings for Families of Interval Graphs. Algorithmica 83 (3) (2021)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Navigational Oracles for Families of Intersection Graphs on a Circle. CoRR (2020)
Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
Optimal In-place Algorithms for Basic Graph Problems. IWOCA (2020)
Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
Enumerating Range Modes. ISAAC (2020)
Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
Enumerating Range Modes. CoRR (2019)
Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti
Succinct Representation for (Non)Deterministic Finite Automata. CoRR (2019)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti
Succinct Data Structures for Families of Interval Graphs. CoRR (2019)
Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti
Space Efficient Algorithms for Breadth-Depth Search. FCT (2019)
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti
Succinct Data Structures for Families of Interval Graphs. WADS (2019)
Sankardeep Chakraborty, Srinivasa Rao Satti
Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS. J. Comb. Optim. 37 (2) (2019)
Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti
Space Efficient Algorithms for Breadth-Depth Search. CoRR (2019)
Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti
Optimal In-place Algorithms for Basic Graph Problems. CoRR (2019)
Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti
Space Efficient Linear Time Algorithms for BFS, DFS and Applications. Theory Comput. Syst. 62 (8) (2018)
Niranka Banerjee, Venkatesh Raman, Srinivasa Rao Satti
Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds. CSR (2018)
Seungbum Jo, Srinivasa Rao Satti
Encoding Two-Dimensional Range Top-k Queries Revisited. ISAAC (2018)
Seungbum Jo, Srinivasa Rao Satti
Encoding two-dimensional range top-k queries revisited. CoRR (2018)
Jérémy Barbay, Johannes Fischer, Stefan Kratsch, Srinivasa Rao Satti
Synergies between Adaptive Analysis of Algorithms, Parameterized Complexity, Compressed Data Structures and Compressed Indices (Dagstuhl Seminar 18281). Dagstuhl Reports 8 (7) (2018)
Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti
A Framework for In-place Graph Algorithms. ESA (2018)
Niranka Banerjee, Varunkumar Jayapaul, Srinivasa Rao Satti
Minimum Transactions Problem. COCOON (2018)
Ran Ben-Basat, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare
Approximate Query Processing over Static Sets and Sliding Windows. ISAAC (2018)
Ran Ben-Basat, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare
Approximate Query Processing over Static Sets and Sliding Windows. CoRR (2018)
Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti
On Succinct Representations of Binary Trees. Math. Comput. Sci. 11 (2) (2017)
Jérémy Barbay, Carlos Ochoa, Srinivasa Rao Satti
Synergistic Solutions on MultiSets. CPM (2017)
Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti
The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments. FAW (2017)
Sankardeep Chakraborty, Srinivasa Rao Satti
Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications. COCOON (2017)
Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti
Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems. CoRR (2017)
Seungbum Jo, Stelios Joannou, Daisuke Okanohara, Rajeev Raman, Srinivasa Rao Satti
Compressed Bit vectors Based on Variable-to-Fixed Encodings. Comput. J. 60 (5) (2017)
Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti
Frameworks for Designing In-place Graph Algorithms. CoRR (2017)
Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti
Biconnectivity, st-numbering and other applications of DFS using O(n) bits. J. Comput. Syst. Sci. 90 (2017)
Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, Srinivasa Rao Satti, Sunil M. Shende
Encoding 2D range maximum queries. Theor. Comput. Sci. 609 (2016)
Varunkumar Jayapaul, Seungbum Jo, Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti
Space efficient data structures for nearest larger neighbor. J. Discrete Algorithms 36 (2016)
Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti
Biconnectivity, chain decomposition and $st$-numbering using $O(n)$ bits. CoRR (2016)
Sangchul Kim, Junhee Lee, Srinivasa Rao Satti, Bongki Moon
SBH: Super byte-aligned hybrid bitmap compression. Inf. Syst. 62 (2016)
Seungbum Jo, Rahul Lingala, Srinivasa Rao Satti
Encoding Two-Dimensional Range Top-k Queries. CPM (2016)
Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan Sorenson
Near-optimal online multiselection in internal and external memory. J. Discrete Algorithms 36 (2016)
Edman Anjos, Junhee Lee, Srinivasa Rao Satti
SJSON: A succinct representation for JavaScript object notation documents. ICDIM (2016)
Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, Srinivasa Rao Satti
Two dimensional range minimum queries and Fibonacci lattices. Theor. Comput. Sci. 638 (2016)
Diego Arroyuelo, Pooya Davoodi, Srinivasa Rao Satti
Succinct Dynamic Cardinal Trees. Algorithmica 74 (2) (2016)
Seungbum Jo, Srinivasa Rao Satti
Simultaneous encodings for range and next/previous larger/smaller value queries. Theor. Comput. Sci. 654 (2016)
Seungbum Jo, Srinivasa Rao Satti
Simultaneous encodings for range and next/previous larger/smaller value queries. CoRR (2016)
Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti
Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits. ISAAC (2016)
Jérémy Barbay, Carlos Ochoa, Srinivasa Rao Satti
Synergistic Sorting and Deferred Data Structures on MultiSets. CoRR (2016)
Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti
Finding Mode Using Equality Comparisons. WALCOM (2016)
Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, Srinivasa Rao Satti
Sorting and Selection with Equality Comparisons. WADS (2015)
Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
Random Access to Grammar-Compressed Strings and Trees. SIAM J. Comput. 44 (3) (2015)
Neha Dwivedi, Srinivasa Rao Satti
Set and array based hybrid data structure solution for Frequent Pattern Mining. ICDIM (2015)
Seungbum Jo, Rajeev Raman, Srinivasa Rao Satti
Compact Encodings and Indexes for the Nearest Larger Neighbor Problem. WALCOM (2015)
Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan P. Sorenson
Dynamic Online Multiselection in Internal and External Memory. WALCOM (2015)
Seungbum Jo, Srinivasa Rao Satti
Simultaneous Encodings for Range and Next/Previous Larger/Smaller Value Queries. COCOON (2015)
Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti
Asymptotically Optimal Encodings for Range Selection. FSTTCS (2014)
Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti
Selection from read-only memory with limited workspace. CoRR (2014)
Varunkumar Jayapaul, Seungbum Jo, Venkatesh Raman, Srinivasa Rao Satti
Space Efficient Data Structures for Nearest Larger Neighbor. IWOCA (2014)
Gerth Stølting Brodal, Mark Greve, Vineet Pandey, Srinivasa Rao Satti
Integer representations towards efficient counting in the bit probe model. J. Discrete Algorithms 26 (2014)
Seungbum Jo, Stelios Joannou, Daisuke Okanohara, Rajeev Raman, Srinivasa Rao Satti
Compressed Bit Vectors Based on Variable-to-Fixed Encodings. DCC (2014)
Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti
Selection from read-only memory with limited workspace. Theor. Comput. Sci. 554 (2014)
Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti
On Succinct Representations of Binary Trees. CoRR (2014)
Roberto Grossi, Rajeev Raman, Srinivasa Rao Satti, Rossano Venturini
Dynamic Compressed Strings with Random Access. ICALP (1) (2013)
Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti
Encodings for Range Selection and Top-k Queries. ESA (2013)
Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti
Selection from Read-Only Memory with Limited Workspace. COCOON (2013)
Jérémy Barbay, Ankur Gupta, Seungbum Jo, Srinivasa Rao Satti, Jonathan P. Sorenson
Theory and Implementation of Online Multiselection Algorithms. ESA (2013)
Meng He, J. Ian Munro, Srinivasa Rao Satti
Succinct ordinal trees based on tree covering. ACM Trans. Algorithms 8 (4) (2012)
Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti
Succinct Representations of Binary Trees for Range Minimum Queries. COCOON (2012)
Gerth Stølting Brodal, Mark Greve, Vineet Pandey, Srinivasa Rao Satti
Integer Representations towards Efficient Counting in the Bit Probe Model. TAMC (2011)
Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann
Random Access to grammar-Compressed Strings. SODA (2011)
Jérémy Barbay, Meng He, J. Ian Munro, Srinivasa Rao Satti
Succinct indexes for strings, binary relations and multilabeled trees. ACM Trans. Algorithms 7 (4) (2011)
Rasmus Pagh, Srinivasa Rao Satti
Secondary indexing in one dimension: beyond b-trees and bitmap indexes. PODS (2009)
Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti
-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3 (4) (2007)
Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti
Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets CoRR (2007)