The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
S. Srinivasa Rao: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao
    Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents. [Citation Graph (0, 0)][DBLP]
    CPM, 2006, pp:24-35 [Conf]
  2. Juha Kärkkäinen, S. Srinivasa Rao
    Full-Text Indexes in External Memory. [Citation Graph (0, 0)][DBLP]
    Algorithms for Memory Hierarchies, 2002, pp:149-170 [Conf]
  3. Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao
    Explicit Deterministic Constructions for Membership in the Bitprobe Model. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:290-299 [Conf]
  4. J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
    Space Efficient Suffix Trees. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:186-196 [Conf]
  5. J. Ian Munro, S. Srinivasa Rao
    Succinct Representations of Functions. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:1006-1015 [Conf]
  6. J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
    Succinct Representations of Permutations. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:345-356 [Conf]
  7. Rajeev Raman, S. Srinivasa Rao
    Succinct Dynamic Dictionaries and Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:357-368 [Conf]
  8. Venkatesh Raman, S. Srinivasa Rao
    Static Dictionaries Supporting Rank. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:18-26 [Conf]
  9. Alexander Golynski, J. Ian Munro, S. Srinivasa Rao
    Rank/select operations on large alphabets: a tool for text indexing. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:368-373 [Conf]
  10. Meng He, J. Ian Munro, S. Srinivasa Rao
    A categorization theorem on suffix arrays with applications to space efficient text indexes. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:23-32 [Conf]
  11. Anna Pagh, Rasmus Pagh, S. Srinivasa Rao
    An optimal Bloom filter replacement. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:823-829 [Conf]
  12. Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
    Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:233-242 [Conf]
  13. Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian N. S. Pedersen, S. Srinivasa Rao
    Computing Refined Buneman Trees in Cubic Time. [Citation Graph (0, 0)][DBLP]
    WABI, 2003, pp:259-270 [Conf]
  14. Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
    Succinct Dynamic Data Structures. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:426-437 [Conf]
  15. David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
    Representing Trees of Higher Degree. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:43, n:4, pp:275-292 [Journal]
  16. S. Srinivasa Rao
    Time-space trade-offs for compressed suffix arrays. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:82, n:6, pp:307-311 [Journal]
  17. Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao
    A Simplified NP-Complete MAXSAT Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:1, pp:1-6 [Journal]
  18. J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
    Space Efficient Suffix Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:39, n:2, pp:205-222 [Journal]
  19. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:405-414 [Journal]
  20. Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao
    On the Size of Succinct Indices. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:371-382 [Conf]
  21. Meng He, J. Ian Munro, S. Srinivasa Rao
    Succinct Ordinal Trees Based on Tree Covering. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:509-520 [Conf]
  22. Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao
    Succinct indexes for strings, binary relations and multi-labeled trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:680-689 [Conf]

  23. External memory planar point location with logarithmic updates. [Citation Graph (, )][DBLP]


  24. Compressing Binary Decision Diagrams. [Citation Graph (, )][DBLP]


  25. On Space Efficient Two Dimensional Range Minimum Data Structures. [Citation Graph (, )][DBLP]


  26. Universal Succinct Representations of Trees? [Citation Graph (, )][DBLP]


  27. More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. [Citation Graph (, )][DBLP]


  28. On the Redundancy of Succinct Data Structures. [Citation Graph (, )][DBLP]


  29. Compressing Binary Decision Diagrams [Citation Graph (, )][DBLP]


  30. Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes [Citation Graph (, )][DBLP]


  31. More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.306secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002