default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Srinivasa Rao 0001
Srinivasa Rao Satti
Person information
- affiliation: Seoul National University, South Korea
Other persons with the same name
- S. Srinivasa Rao 0002 — IIIT, Hyderabad, India
- S. Srinivasa Rao 0003 — Department of Mechanical Engineering, Vignan's IIT, JNTU, Kakinada, India
- S. Srinivasa Rao 0004 — Koneru Lakshmaiah Education Foundation, Department of Computer Science and Engineering, Vaddeswaram, India
- S. Srinivasa Rao 0005 — Malla Reddy College of Engineering and Technology, Secunderabad, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j43]Sankardeep Chakraborty, Seungbum Jo
, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct data structures for bounded clique-width graphs. Discret. Appl. Math. 352: 55-68 (2024)- [j42]Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Data Structures for SP, Block-Cactus and 3-Leaf Power Graphs. Int. J. Found. Comput. Sci. 35(6): 705-722 (2024) - [j41]Varunkumar Jayapaul, Seungbum Jo, Krishna V. Palem, Srinivasa Rao Satti:
Energy efficient sorting, selection and searching. Theor. Comput. Sci. 1002: 114592 (2024) - [c70]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. ESA 2024: 64:1-64:18 - [i28]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 abs/2407.00573 (2024) - 2023
- [j40]Wooyoung Park, Seungbum Jo, Srinivasa Rao Satti:
Practical Implementation of Encoding Range Top-2 Queries. Comput. J. 66(11): 2794-2809 (2023) - [j39]Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct representation for (non)deterministic finite automata. J. Comput. Syst. Sci. 131: 1-12 (2023) - [c69]Seungbum Jo, Wooyoung Park, Kunihiko Sadakane, Srinivasa Rao Satti:
Practical Implementations of Compressed RAM. DCC 2023: 168-177 - [c68]Varunkumar Jayapaul, Seungbum Jo, Krishna V. Palem, Srinivasa Rao Satti:
Energy Efficient Sorting, Selection and Searching. WALCOM 2023: 179-190 - [e2]Reyer Zwiggelaar, Geetha Ganesan, Qiang Shawn Cheng, Ke-Lin Du, Srinivasa Rao Satti:
Proceedings of the Algorithms, Computing and Mathematics Conference 2022 (ACM 2022), Hybrid Event, Chennai, India, August 29 - 30, 2022. CEUR Workshop Proceedings 3445, CEUR-WS.org 2023 [contents] - 2022
- [j38]Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti:
Finding kings in tournaments. Discret. Appl. Math. 322: 240-252 (2022) - [j37]Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti:
Frameworks for designing in-place graph algorithms. J. Comput. Syst. Sci. 123: 1-19 (2022) - [j36]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: 151-166 (2022) - [c67]Tatsuya Yanagita, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti:
Space-Efficient Data Structure for Posets with Applications. SWAT 2022: 33:1-33:16 - [e1]Narendra S. Chaudhari, Geetha Ganesan, Srinivasa Rao Satti:
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). CEUR Workshop Proceedings 3244, CEUR-WS.org 2022 [contents] - 2021
- [j35]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti:
Succinct Encodings for Families of Interval Graphs. Algorithmica 83(3): 776-794 (2021) - [j34]Seungbum Jo, Rahul Lingala, Srinivasa Rao Satti:
Encoding Two-Dimensional Range Top-k Queries. Algorithmica 83(11): 3379-3402 (2021) - [j33]Junhee Lee, Edman Anjos, Srinivasa Rao Satti:
SJSON: A succinct representation for JSON documents. Inf. Syst. 97: 101686 (2021) - [j32]Ran Ben Basat, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare:
Approximate query processing over static sets and sliding windows. Theor. Comput. Sci. 885: 1-14 (2021) - [c66]Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. COCOA 2021: 416-430 - [c65]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Kei Nakashima, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct representations of Intersection Graphs on a Circle. DCC 2021: 123-132 - [c64]Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Data Structures for Small Clique-Width Graphs. DCC 2021: 133-142 - [c63]Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Representations for (Non)Deterministic Finite Automata. LATA 2021: 55-67 - [c62]Seungbum Jo, Wooyoung Park, Srinivasa Rao Satti:
Practical Implementation of Encoding Range Top-2 Queries. SEA 2021: 10:1-10:13 - [i27]Sankardeep Chakraborty, Seungbum Jo, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Data Structures for Series-Parallel, Block-Cactus and 3-Leaf Power Graphs. CoRR abs/2108.10776 (2021) - [i26]Arindam Biswas, Venkatesh Raman, Srinivasa Rao Satti, Saket Saurabh:
Space-Efficient FPT Algorithms. CoRR abs/2112.15233 (2021) - 2020
- [c61]Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti:
Enumerating Range Modes. ISAAC 2020: 29:1-29:16 - [c60]Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti:
Optimal In-place Algorithms for Basic Graph Problems. IWOCA 2020: 126-139 - [i25]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 abs/2010.04333 (2020)
2010 – 2019
- 2019
- [j31]Sankardeep Chakraborty, Srinivasa Rao Satti:
Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS. J. Comb. Optim. 37(2): 465-481 (2019) - [c59]Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti:
Space Efficient Algorithms for Breadth-Depth Search. FCT 2019: 201-212 - [c58]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti:
Succinct Data Structures for Families of Interval Graphs. WADS 2019: 1-13 - [i24]Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti:
Succinct Data Structures for Families of Interval Graphs. CoRR abs/1902.09228 (2019) - [i23]Sankardeep Chakraborty, Anish Mukherjee, Srinivasa Rao Satti:
Space Efficient Algorithms for Breadth-Depth Search. CoRR abs/1906.07874 (2019) - [i22]Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane, Srinivasa Rao Satti:
Succinct Representation for (Non)Deterministic Finite Automata. CoRR abs/1907.09271 (2019) - [i21]Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti:
Optimal In-place Algorithms for Basic Graph Problems. CoRR abs/1907.09280 (2019) - [i20]Kentaro Sumigawa, Sankardeep Chakraborty, Kunihiko Sadakane, Srinivasa Rao Satti:
Enumerating Range Modes. CoRR abs/1907.10984 (2019) - 2018
- [j30]Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti:
Space Efficient Linear Time Algorithms for BFS, DFS and Applications. Theory Comput. Syst. 62(8): 1736-1762 (2018) - [c57]Niranka Banerjee, Varunkumar Jayapaul, Srinivasa Rao Satti:
Minimum Transactions Problem. COCOON 2018: 650-661 - [c56]Niranka Banerjee, Venkatesh Raman, Srinivasa Rao Satti:
Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds. CSR 2018: 29-40 - [c55]Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti:
A Framework for In-place Graph Algorithms. ESA 2018: 13:1-13:16 - [c54]Ran Ben-Basat, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare:
Approximate Query Processing over Static Sets and Sliding Windows. ISAAC 2018: 54:1-54:12 - [c53]Seungbum Jo, Srinivasa Rao Satti:
Encoding Two-Dimensional Range Top-k Queries Revisited. ISAAC 2018: 69:1-69:13 - [i19]Ran Ben-Basat, Seungbum Jo, Srinivasa Rao Satti, Shubham Ugare:
Approximate Query Processing over Static Sets and Sliding Windows. CoRR abs/1809.05419 (2018) - [i18]Seungbum Jo, Srinivasa Rao Satti:
Encoding two-dimensional range top-k queries revisited. CoRR abs/1809.07067 (2018) - [i17]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): 44-61 (2018) - 2017
- [j29]Seungbum Jo, Stelios Joannou, Daisuke Okanohara, Rajeev Raman, Srinivasa Rao Satti:
Compressed Bit vectors Based on Variable-to-Fixed Encodings. Comput. J. 60(5): 761-775 (2017) - [j28]Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti:
Biconnectivity, st-numbering and other applications of DFS using O(n) bits. J. Comput. Syst. Sci. 90: 63-79 (2017) - [j27]Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti:
On Succinct Representations of Binary Trees. Math. Comput. Sci. 11(2): 177-189 (2017) - [j26]Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao:
Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries. ACM Trans. Algorithms 13(2): 28:1-28:31 (2017) - [j25]Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao:
Finding modes with equality comparisons. Theor. Comput. Sci. 704: 28-41 (2017) - [c52]Sankardeep Chakraborty, Srinivasa Rao Satti:
Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications. COCOON 2017: 87-98 - [c51]Jérémy Barbay, Carlos Ochoa, Srinivasa Rao Satti:
Synergistic Solutions on MultiSets. CPM 2017: 31:1-31:14 - [c50]Arindam Biswas, Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti:
The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments. FAW 2017: 22-33 - [i16]Sankardeep Chakraborty, Anish Mukherjee, Venkatesh Raman, Srinivasa Rao Satti:
Frameworks for Designing In-place Graph Algorithms. CoRR abs/1711.09859 (2017) - [i15]Sankardeep Chakraborty, Seungbum Jo, Srinivasa Rao Satti:
Improved Space-efficient Linear Time Algorithms for Some Classical Graph Problems. CoRR abs/1712.03349 (2017) - 2016
- [j24]Diego Arroyuelo, Pooya Davoodi, Srinivasa Rao Satti:
Succinct Dynamic Cardinal Trees. Algorithmica 74(2): 742-777 (2016) - [j23]Sangchul Kim, Junhee Lee, Srinivasa Rao Satti, Bongki Moon:
SBH: Super byte-aligned hybrid bitmap compression. Inf. Syst. 62: 155-168 (2016) - [j22]Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan Sorenson:
Near-optimal online multiselection in internal and external memory. J. Discrete Algorithms 36: 3-17 (2016) - [j21]Varunkumar Jayapaul, Seungbum Jo, Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti:
Space efficient data structures for nearest larger neighbor. J. Discrete Algorithms 36: 63-75 (2016) - [j20]Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, Srinivasa Rao Satti, Sunil M. Shende:
Encoding 2D range maximum queries. Theor. Comput. Sci. 609: 316-327 (2016) - [j19]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: 33-43 (2016) - [j18]Seungbum Jo, Srinivasa Rao Satti:
Simultaneous encodings for range and next/previous larger/smaller value queries. Theor. Comput. Sci. 654: 80-91 (2016) - [c49]Seungbum Jo, Rahul Lingala, Srinivasa Rao Satti:
Encoding Two-Dimensional Range Top-k Queries. CPM 2016: 3:1-3:11 - [c48]Edman Anjos, Junhee Lee, Srinivasa Rao Satti:
SJSON: A succinct representation for JavaScript object notation documents. ICDIM 2016: 173-178 - [c47]Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti:
Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits. ISAAC 2016: 22:1-22:13 - [c46]Varunkumar Jayapaul, Venkatesh Raman, Srinivasa Rao Satti:
Finding Mode Using Equality Comparisons. WALCOM 2016: 351-360 - [r3]Paolo Ferragina, Srinivasa Rao Satti:
Compressing and Indexing Structured Text. Encyclopedia of Algorithms 2016: 401-407 - [i14]Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti:
Biconnectivity, chain decomposition and $st$-numbering using $O(n)$ bits. CoRR abs/1606.08645 (2016) - [i13]Jérémy Barbay, Carlos Ochoa, Srinivasa Rao Satti:
Synergistic Sorting and Deferred Data Structures on MultiSets. CoRR abs/1608.06666 (2016) - [i12]Seungbum Jo, Srinivasa Rao Satti:
Simultaneous encodings for range and next/previous larger/smaller value queries. CoRR abs/1612.07493 (2016) - 2015
- [j17]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): 513-539 (2015) - [c45]Seungbum Jo, Srinivasa Rao Satti:
Simultaneous Encodings for Range and Next/Previous Larger/Smaller Value Queries. COCOON 2015: 648-660 - [c44]Neha Dwivedi, Srinivasa Rao Satti:
Set and array based hybrid data structure solution for Frequent Pattern Mining. ICDIM 2015: 14-19 - [c43]Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, Srinivasa Rao Satti:
Sorting and Selection with Equality Comparisons. WADS 2015: 434-445 - [c42]Seungbum Jo, Rajeev Raman, Srinivasa Rao Satti:
Compact Encodings and Indexes for the Nearest Larger Neighbor Problem. WALCOM 2015: 53-64 - [c41]Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan P. Sorenson:
Dynamic Online Multiselection in Internal and External Memory. WALCOM 2015: 199-209 - 2014
- [j16]Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao:
Optimal Indexes for Sparse Bit Vectors. Algorithmica 69(4): 906-924 (2014) - [j15]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: 34-44 (2014) - [j14]Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti:
Selection from read-only memory with limited workspace. Theor. Comput. Sci. 554: 64-73 (2014) - [c40]Seungbum Jo, Stelios Joannou, Daisuke Okanohara, Rajeev Raman, Srinivasa Rao Satti:
Compressed Bit Vectors Based on Variable-to-Fixed Encodings. DCC 2014: 409 - [c39]Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti:
Asymptotically Optimal Encodings for Range Selection. FSTTCS 2014: 291-301 - [c38]Varunkumar Jayapaul, Seungbum Jo, Venkatesh Raman, Srinivasa Rao Satti:
Space Efficient Data Structures for Nearest Larger Neighbor. IWOCA 2014: 176-187 - [i11]Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti:
Selection from read-only memory with limited workspace. CoRR abs/1407.3342 (2014) - [i10]Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti:
On Succinct Representations of Binary Trees. CoRR abs/1410.4963 (2014) - 2013
- [c37]Patrick K. Nicholson, Venkatesh Raman, S. Srinivasa Rao:
A Survey of Data Structures in the Bitprobe Model. Space-Efficient Data Structures, Streams, and Algorithms 2013: 303-318 - [c36]Rajeev Raman, S. Srinivasa Rao:
Succinct Representations of Ordinal Trees. Space-Efficient Data Structures, Streams, and Algorithms 2013: 319-332 - [c35]Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti:
Selection from Read-Only Memory with Limited Workspace. COCOON 2013: 147-157 - [c34]Jérémy Barbay, Ankur Gupta, Seungbum Jo, Srinivasa Rao Satti, Jonathan P. Sorenson:
Theory and Implementation of Online Multiselection Algorithms. ESA 2013: 109-120 - [c33]Roberto Grossi, John Iacono, Gonzalo Navarro, Rajeev Raman, Srinivasa Rao Satti:
Encodings for Range Selection and Top-k Queries. ESA 2013: 553-564 - [c32]Roberto Grossi, Rajeev Raman, Srinivasa Rao Satti, Rossano Venturini:
Dynamic Compressed Strings with Random Access. ICALP (1) 2013: 504-515 - [i9]Pooya Davoodi, Gonzalo Navarro, Rajeev Raman, S. Srinivasa Rao:
Encoding Range Minimum Queries. CoRR abs/1311.4394 (2013) - 2012
- [j13]Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao:
External Memory Planar Point Location with Logarithmic Updates. Algorithmica 63(1-2): 457-475 (2012) - [j12]Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao:
On Space Efficient Two Dimensional Range Minimum Data Structures. Algorithmica 63(4): 815-830 (2012) - [j11]Meng He, J. Ian Munro, Srinivasa Rao Satti:
Succinct ordinal trees based on tree covering. ACM Trans. Algorithms 8(4): 42:1-42:32 (2012) - [j10]J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct representations of permutations and functions. Theor. Comput. Sci. 438: 74-88 (2012) - [c31]Pooya Davoodi, Rajeev Raman, Srinivasa Rao Satti:
Succinct Representations of Binary Trees for Range Minimum Queries. COCOON 2012: 396-407 - [c30]Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao:
Two Dimensional Range Minimum Queries and Fibonacci Lattices. ESA 2012: 217-228 - [i8]Jérémy Barbay, Ankur Gupta, S. Srinivasa Rao, Jonathan P. Sorenson:
Competitive Online Selection in Main and External Memory. CoRR abs/1206.5336 (2012) - 2011
- [j9]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): 52:1-52:27 (2011) - [c29]Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao:
Encoding 2D Range Maximum Queries. ISAAC 2011: 180-189 - [c28]Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann:
Random Access to grammar-Compressed Strings. SODA 2011: 373-389 - [c27]Pooya Davoodi, S. Srinivasa Rao:
Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet. TAMC 2011: 195-205 - [c26]Gerth Stølting Brodal, Mark Greve, Vineet Pandey, Srinivasa Rao Satti:
Integer Representations towards Efficient Counting in the Bit Probe Model. TAMC 2011: 206-217 - [c25]Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao:
Path Minima Queries in Dynamic Weighted Trees. WADS 2011: 290-301 - [i7]J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct Representations of Permutations and Functions. CoRR abs/1108.1983 (2011) - [i6]Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao:
Optimal Indexes for Sparse Bit Vectors. CoRR abs/1108.2157 (2011) - [i5]Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao:
Encoding 2-D Range Maximum Queries. CoRR abs/1109.2885 (2011) - 2010
- [j8]Jyrki Katajainen, S. Srinivasa Rao:
A compact data structure for representing a dynamic multiset. Inf. Process. Lett. 110(23): 1061-1066 (2010) - [c24]Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao:
On Space Efficient Two Dimensional Range Minimum Data Structures. ESA (2) 2010: 171-182
2000 – 2009
- 2009
- [c23]Arash Farzan, Rajeev Raman, S. Srinivasa Rao:
Universal Succinct Representations of Trees? ICALP (1) 2009: 451-462 - [c22]Rasmus Pagh, Srinivasa Rao Satti:
Secondary indexing in one dimension: beyond b-trees and bitmap indexes. PODS 2009: 177-186 - [c21]Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao:
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. STACS 2009: 517-528 - [i4]Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao:
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. CoRR abs/0902.2648 (2009) - 2008
- [c20]Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao:
External memory planar point location with logarithmic updates. SCG 2008: 139-147 - [c19]Esben Rune Hansen, S. Srinivasa Rao, Peter Tiedemann:
Compressing Binary Decision Diagrams. ECAI 2008: 799-800 - [c18]Alexander Golynski, Rajeev Raman, S. Srinivasa Rao:
On the Redundancy of Succinct Data Structures. SWAT 2008: 148-159 - [r2]Paolo Ferragina, S. Srinivasa Rao:
Tree Compression and Indexing. Encyclopedia of Algorithms 2008 - [i3]Esben Rune Hansen, S. Srinivasa Rao, Peter Tiedemann:
Compressing Binary Decision Diagrams. CoRR abs/0805.3267 (2008) - [i2]Rasmus Pagh, S. Srinivasa Rao:
Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes. CoRR abs/0811.2904 (2008) - 2007
- [j7]Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti:
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3(4): 43 (2007) - [j6]Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao:
Adaptive searching in succinctly encoded binary relations and tree-structured documents. Theor. Comput. Sci. 387(3): 284-297 (2007) - [c17]Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao:
On the Size of Succinct Indices. ESA 2007: 371-382 - [c16]Meng He, J. Ian Munro, S. Srinivasa Rao:
Succinct Ordinal Trees Based on Tree Covering. ICALP 2007: 509-520 - [c15]Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao:
Succinct indexes for strings, binary relations and multi-labeled trees. SODA 2007: 680-689 - [i1]Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti:
Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets. CoRR abs/0705.0552 (2007) - 2006
- [c14]Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao:
Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents. CPM 2006: 24-35 - [c13]Alexander Golynski, J. Ian Munro, S. Srinivasa Rao:
Rank/select operations on large alphabets: a tool for text indexing. SODA 2006: 368-373 - 2005
- [j5]David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Representing Trees of Higher Degree. Algorithmica 43(4): 275-292 (2005) - [c12]Meng He, J. Ian Munro, S. Srinivasa Rao:
A categorization theorem on suffix arrays with applications to space efficient text indexes. SODA 2005: 23-32 - [c11]Anna Pagh, Rasmus Pagh, S. Srinivasa Rao:
An optimal Bloom filter replacement. SODA 2005: 823-829 - 2004
- [j4]Michael H. Albert, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, S. Srinivasa Rao, Mohammad Ali Safari:
Longest increasing subsequences in sliding windows. Theor. Comput. Sci. 321(2-3): 405-414 (2004) - [c10]J. Ian Munro, S. Srinivasa Rao:
Succinct Representations of Functions. ICALP 2004: 1006-1015 - [r1]J. Ian Munro, S. Srinivasa Rao:
Succinct Representation of Data Structures. Handbook of Data Structures and Applications 2004 - 2003
- [c9]J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct Representations of Permutations. ICALP 2003: 345-356 - [c8]Rajeev Raman, S. Srinivasa Rao:
Succinct Dynamic Dictionaries and Trees. ICALP 2003: 357-368 - [c7]Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian N. S. Pedersen, S. Srinivasa Rao:
Computing Refined Buneman Trees in Cubic Time. WABI 2003: 259-270 - 2002
- [j3]S. Srinivasa Rao:
Time-space trade-offs for compressed suffix arrays. Inf. Process. Lett. 82(6): 307-311 (2002) - [c6]Juha Kärkkäinen, S. Srinivasa Rao:
Full-Text Indexes in External Memory. Algorithms for Memory Hierarchies 2002: 149-170 - [c5]Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. SODA 2002: 233-242 - 2001
- [j2]J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao:
Space Efficient Suffix Trees. J. Algorithms 39(2): 205-222 (2001) - [c4]Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao:
Explicit Deterministic Constructions for Membership in the Bitprobe Model. ESA 2001: 290-299 - [c3]Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct Dynamic Data Structures. WADS 2001: 426-437
1990 – 1999
- 1999
- [c2]Venkatesh Raman, S. Srinivasa Rao:
Static Dictionaries Supporting Rank. ISAAC 1999: 18-26 - 1998
- [j1]Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao:
A Simplified NP-Complete MAXSAT Problem. Inf. Process. Lett. 65(1): 1-6 (1998) - [c1]J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao:
Space Efficient Suffix Trees. FSTTCS 1998: 186-196
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-23 21:28 CEST 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:
