Practical Implementation of Encoding Range Top-2 Queries von Park, Wooyoung, Jo, Seungbum, Rao Satti, Srinivasa

Volltext

Encoding Two-Dimensional Range Top-k Queries von Jo, Seungbum, Lingala, Rahul, Satti, Srinivasa Rao

Volltext

Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS von Chakraborty, Sankardeep, Satti, Srinivasa Rao

Volltext

Succinct navigational oracles for families of intersection graphs on a circle von Acan, Hüseyin, Chakraborty, Sankardeep, Jo, Seungbum, Nakashima, Kei, Sadakane, Kunihiko, Satti, Srinivasa Rao

Volltext

Biconnectivity, st-numbering and other applications of DFS using O(n) bits von Chakraborty, Sankardeep, Raman, Venkatesh, Satti, Srinivasa Rao

Volltext

On Succinct Representations of Binary Trees von Davoodi, Pooya, Raman, Rajeev, Satti, Srinivasa Rao

Volltext

Space-Efficient Algorithms for Maximum Cardinality Search, Stack BFS, Queue BFS and Applications von Chakraborty, Sankardeep, Satti, Srinivasa Rao

Volltext

Space Efficient Linear Time Algorithms for BFS, DFS and Applications von Banerjee, Niranka, Chakraborty, Sankardeep, Raman, Venkatesh, Satti, Srinivasa Rao

Volltext

Optimal In-place Algorithms for Basic Graph Problems von Chakraborty, Sankardeep, Sadakane, Kunihiko, Satti, Srinivasa Rao

Volltext

Succinct Representations for (Non)Deterministic Finite Automata von Chakraborty, Sankardeep, Grossi, Roberto, Sadakane, Kunihiko, Satti, Srinivasa Rao

Volltext

Succinct Data Structures for Families of Interval Graphs von Acan, Hüseyin, Chakraborty, Sankardeep, Jo, Seungbum, Satti, Srinivasa Rao

Volltext

Succinct Representations of Binary Trees for Range Minimum Queries von Davoodi, Pooya, Raman, Rajeev, Satti, Srinivasa Rao

Volltext

Succinct indexes for strings, binary relations and multilabeled trees von Barbay, Jérémy, He, Meng, Munro, J. Ian, Satti, Srinivasa Rao

Volltext

Energy efficient sorting, selection and searching von Jayapaul, Varunkumar, Jo, Seungbum, Palem, Krishna V., Satti, Srinivasa Rao

Volltext

Succinct representation for (non)deterministic finite automata von Chakraborty, Sankardeep, Grossi, Roberto, Sadakane, Kunihiko, Satti, Srinivasa Rao

Volltext

SJSON: A succinct representation for JSON documents von Lee, Junhee, Anjos, Edman, Satti, Srinivasa Rao

Volltext

Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets von Raman, Rajeev, Raman, Venkatesh, Satti, Srinivasa Rao

Volltext

Finding kings in tournaments von Biswas, Arindam, Jayapaul, Varunkumar, Raman, Venkatesh, Satti, Srinivasa Rao

Volltext

Succinct data structures for bounded clique-width graphs von Chakraborty, Sankardeep, Jo, Seungbum, Sadakane, Kunihiko, Satti, Srinivasa Rao

Volltext

Random Access to Grammar-Compressed Strings and Trees von Bille, Philip, Landau, Gad M., Raman, Rajeev, Sadakane, Kunihiko, Satti, Srinivasa Rao, Weimann, Oren

Volltext