Остановите войну!
for scientists:
default search action
S. Srinivasa Rao 0001
- > Home > Persons > S. Srinivasa Rao 0001
Publications
- 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) - 2021
- [i26]Arindam Biswas, Venkatesh Raman, Srinivasa Rao Satti, Saket Saurabh:
Space-Efficient FPT Algorithms. CoRR abs/2112.15233 (2021) - 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) - [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 - 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) - [j25]Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao:
Finding modes with equality comparisons. Theor. Comput. Sci. 704: 28-41 (2017) - [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) - 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) - [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 - [i14]Sankardeep Chakraborty, Venkatesh Raman, Srinivasa Rao Satti:
Biconnectivity, chain decomposition and $st$-numbering using $O(n)$ bits. CoRR abs/1606.08645 (2016) - 2015
- [c43]Varunkumar Jayapaul, J. Ian Munro, Venkatesh Raman, Srinivasa Rao Satti:
Sorting and Selection with Equality Comparisons. WADS 2015: 434-445 - 2014
- [c38]Varunkumar Jayapaul, Seungbum Jo, Venkatesh Raman, Srinivasa Rao Satti:
Space Efficient Data Structures for Nearest Larger Neighbor. IWOCA 2014: 176-187 - 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 - 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) - 2011
- [i7]J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct Representations of Permutations and Functions. CoRR abs/1108.1983 (2011) - 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) - [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) - 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) - 2003
- [c9]J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao:
Succinct Representations of Permutations. ICALP 2003: 345-356 - 2002
- [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 - 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
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-03-02 00:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint