Srinivasa Rao Satti

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