Srinivasa Rao Satti
About
Srinivasa Rao Satti is a Professor at the Department of Computer Science. He completed his Masters and PhD from the Institute of Mathematical Sciences, India. Before joining NTNU in 2021, he worked as a Research Associate at the University of Leices, UK; as a Postdoctoral Fellow at the University of Waterloo, Canada; as a Research Assistant Professor at the IT University of Copenhagen, Denmark and also at the University of Aarhus, Denmark; and as a Assistant/Associate Professor at the Seoul National University, South Korea.
Satti's research interests are broadly in the area of algorithms and data structures. His work so far has been mainly concentrated on the design and implemntation of space-efficient structures for some fundamental problems in data structures. He has obtained optimal space structures for strings, trees and various other combinatorial objects, which have important applications in text indexing, database indexing and bioinformatics.
His other research interests include external memory algorithms, database indexing, information retrieval, data compression, string matching, approximation algorithms, parameterized complexity, energy-efficient/approximate computing and some topics in bioinformatics.
Publications: A comprehensive list of publications can be found on the DBLP page.
Publications
See a comprehensive list of publications at DBLP
2023
-
Chakraborty, Sankardeep;
Grossi, Roberto;
Sadakane, Kunihiko;
Satti, Srinivasa Rao.
(2023)
Succinct representation for (non)deterministic finite automata.
Journal of computer & systems sciences international.
volum 131.
Academic article
-
Chakraborty, Sankardeep;
Jo, Seungbum;
Sadakane, Kunihiko;
Satti, Srinivasa Rao.
(2023)
Succinct Data Structures for SP, Block-Cactus and 3 -Leaf Power Graphs.
International Journal of Foundations of Computer Science.
Academic article
2022
-
Acan, Huseyin;
Chakraborty, Sankardeep;
Jo, Seungbum;
Nakashima, Kei;
Sadakane, Kunihiko;
Satti, Srinivasa Rao.
(2022)
Succinct navigational oracles for families of intersection graphs on a circle.
Theoretical Computer Science.
volum 928.
Academic article
-
Biswas, Arindam;
Jayapaul, Varunkumar;
Raman, Venkatesh;
Satti, Srinivasa Rao.
(2022)
Finding kings in tournaments.
Discrete Applied Mathematics.
volum 322.
Academic article
-
Chakraborty, Sankardeep;
Mukherjee, Anish;
Raman, Venkaetsh;
Satti, Srinivasa Rao.
(2022)
Frameworks for designing in-place graph algorithms.
Journal of computer and system sciences.
volum 123.
Academic article
2021
-
Acan, Huseyin;
Chakraborty, Sankardeep;
Jo, Seungbum;
Satti, Srinivasa Rao.
(2021)
Succinct Encodings for Families of Interval Graphs.
Algorithmica.
volum 83 (3).
Academic article
-
Basat, Ran Ben;
Jo, Seungbum;
Satti, Srinivasa Rao;
Ugare, Shubham.
(2021)
Approximate query processing over static sets and sliding windows.
Theoretical Computer Science.
volum 885.
Academic article
-
Jo, Seungbum;
Lingala, Rahul;
Satti, Srinivasa Rao.
(2021)
Encoding Two-Dimensional Range Top-k Queries.
Algorithmica.
volum 83.
Academic article
-
Lee, Junhee;
Anjos, Edman;
Satti, Srinivasa Rao.
(2021)
SJSON: A succinct representation for JSON documents.
Information Systems.
volum 97.
Academic article
-
Zwiggelaar, Reyer;
Ganesan, Geetha;
Cheng, Qiang;
Du, Ke-Lin;
Satti, Srinivasa Rao;
Goyal, Ayush;
Ciufudean, Calin;
Saba, Djamel;
Goi, Bok Min;
Srivastava, Hari Mohan;
Al Marzouqi, Hasan;
Cheng, Haw Su;
Skliarova, Iouliia;
Lin, Jerry Chun-Wei;
Yeh, Jyh-Haw;
Ali, Liaqat;
Pekar, Libor;
Meribout, Mahmoud;
Fouladirad, Mitra.
(2021)
Preface.
CEUR Workshop Proceedings.
volum 3010.
Editorial
Journal publications
-
Chakraborty, Sankardeep;
Grossi, Roberto;
Sadakane, Kunihiko;
Satti, Srinivasa Rao.
(2023)
Succinct representation for (non)deterministic finite automata.
Journal of computer & systems sciences international.
volum 131.
Academic article
-
Chakraborty, Sankardeep;
Jo, Seungbum;
Sadakane, Kunihiko;
Satti, Srinivasa Rao.
(2023)
Succinct Data Structures for SP, Block-Cactus and 3 -Leaf Power Graphs.
International Journal of Foundations of Computer Science.
Academic article
-
Acan, Huseyin;
Chakraborty, Sankardeep;
Jo, Seungbum;
Nakashima, Kei;
Sadakane, Kunihiko;
Satti, Srinivasa Rao.
(2022)
Succinct navigational oracles for families of intersection graphs on a circle.
Theoretical Computer Science.
volum 928.
Academic article
-
Biswas, Arindam;
Jayapaul, Varunkumar;
Raman, Venkatesh;
Satti, Srinivasa Rao.
(2022)
Finding kings in tournaments.
Discrete Applied Mathematics.
volum 322.
Academic article
-
Chakraborty, Sankardeep;
Mukherjee, Anish;
Raman, Venkaetsh;
Satti, Srinivasa Rao.
(2022)
Frameworks for designing in-place graph algorithms.
Journal of computer and system sciences.
volum 123.
Academic article
-
Acan, Huseyin;
Chakraborty, Sankardeep;
Jo, Seungbum;
Satti, Srinivasa Rao.
(2021)
Succinct Encodings for Families of Interval Graphs.
Algorithmica.
volum 83 (3).
Academic article
-
Basat, Ran Ben;
Jo, Seungbum;
Satti, Srinivasa Rao;
Ugare, Shubham.
(2021)
Approximate query processing over static sets and sliding windows.
Theoretical Computer Science.
volum 885.
Academic article
-
Jo, Seungbum;
Lingala, Rahul;
Satti, Srinivasa Rao.
(2021)
Encoding Two-Dimensional Range Top-k Queries.
Algorithmica.
volum 83.
Academic article
-
Lee, Junhee;
Anjos, Edman;
Satti, Srinivasa Rao.
(2021)
SJSON: A succinct representation for JSON documents.
Information Systems.
volum 97.
Academic article
-
Zwiggelaar, Reyer;
Ganesan, Geetha;
Cheng, Qiang;
Du, Ke-Lin;
Satti, Srinivasa Rao;
Goyal, Ayush;
Ciufudean, Calin;
Saba, Djamel;
Goi, Bok Min;
Srivastava, Hari Mohan;
Al Marzouqi, Hasan;
Cheng, Haw Su;
Skliarova, Iouliia;
Lin, Jerry Chun-Wei;
Yeh, Jyh-Haw;
Ali, Liaqat;
Pekar, Libor;
Meribout, Mahmoud;
Fouladirad, Mitra.
(2021)
Preface.
CEUR Workshop Proceedings.
volum 3010.
Editorial
Teaching
Courses
Media
2023
-
Academic lectureJayapaul, Varunkumar; Jo, Seungbum; Palem, Krishna; Satti, Srinivasa Rao. (2023) Energy Efficient Sorting, Selection and Searching. 17th International Conference on Algorithms and Computation (WALCOM) ; Hsinchu, Taiwan (& Virtual). 2023-03-22 - 2023-03-24.
2022
-
Academic lectureYanagita, Tatsuya; Chakraborty, Sankardeep; Sadakane, Kunihiko; Satti, Srinivasa Rao. (2022) Space-Efficient Data Structure for Posets with Applications. 18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022 . University of the Faroe Islands; Torshavn. 2022-06-27 - 2022-06-29.
2021
-
Academic lectureAcan, Huseyin; Chakraborty, Sankardeep; Jo, Seungbum; Nakashima, Kei; Sadakane, Kunihiko; Satti, Srinivasa Rao. (2021) Succinct representations of Intersection Graphs on a Circle. Data Compression Conference ; Snowbird, Utah. 2021-03-23 - 2021-03-26.
-
Academic lectureChakraborty, Sankardeep; Grossi, Roberto; Sadakane, Kunihiko; Satti, Srinivasa Rao. (2021) Succinct Representations for (Non)Deterministic Finite Automata. 15th International Conference on Language and Automata Theory and Applications (LATA) ; Milan. 2021-03-01 - 2021-03-05.
-
Academic lectureChakraborty, Sankardeep; Jo, Seungbum; Sadakane, Kunihiko; Satti, Srinivasa Rao. (2021) Succinct Data Structures for Small Clique-Width Graphs. Data Compression Conference ; Snowbird, Utah. 2021-03-23 - 2021-03-26.
-
Academic lectureJo, Seungbum; Park, Wooyoung; Satti, Srinivasa Rao. (2021) Practical Implementation of Encoding Range Top-2 Queries. 19th International Symposium on Experimental Algorithms, SEA 2021 . Université Côte d'Azur; Nice. 2021-06-07 - 2021-06-09.
2020
-
Academic lectureChakraborty, Sankardeep; Sadakane, Kunihiko; Satti, Srinivasa Rao. (2020) Optimal In-place Algorithms for Basic Graph Problems. 31st International Workshop on Combinatorial Algorithms (IWOCA) ; Bordeaux. 2020-06-08 - 2020-06-10.
-
Academic lectureSumigawa, Kentaro; Chakraborty, Sankardeep; Sadakane, Kunihiko; Satti, Srinivasa Rao. (2020) Enumerating Range Modes. 31st International Symposium on Algorithms and Computation (ISAAC) ; Hong Kong. 2020-12-14 - 2020-12-18.