Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Rao, S. Srinivasa"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal indexes for sparse bit vectors
Alexander Golynski
,
Alessio Orlandi
,
Rajeev Raman
,
S. Srinivasa Rao
Algorithmica
69
(4), 2014, pp. 906-924
External memory planar point location with logarithmic updates
Lars Arge
,
Gerth Stlting Brodal
,
S. Srinivasa Rao
Algorithmica
63
(1-2), 2012, pp. 457-475
On space efficient two dimensional range minimum data structures
Gerth Stlting Brodal
,
Pooya Davoodi
,
S. Srinivasa Rao
Algorithmica
63
(4), 2012, pp. 815-830
Path minima queries in dynamic weighted trees
Gerth Stlting Brodal
,
Pooya Davoodi
,
S. Srinivasa Rao
Lecture Notes in Computer Science
6844
, 2011, pp. 290-301
Encoding 2D range maximum queries
Mordecai Golin
,
John Iacono
,
Danny Krizanc
,
Rajeev Raman
,
S. Srinivasa Rao
Lecture Notes in Computer Science
7074
, 2011, pp. 180-189
On space efficient two dimensional range minimum data structures
Gerth Stlting Brdal
,
Pooya Davoodi
,
S. Srinivasa Rao
Lecture Notes in Computer Science
6347
, 2010, pp. 171-182
A compact data structure for representing a dynamic multiset
Jyrki Katajainen
,
S. Srinivasa Rao
Information Processing Letters
110
(23), 2010, pp. 1061-1066
Universal succinct representations of trees?
Arash Farzan
,
Rajeev Raman
,
S. Srinivasa Rao
Lecture Notes in Computer Science
5555
, 2009, pp. 451-462
More haste, less waste: Lowering the redundancy in fully indexable dictionaries
Roberto Grossi
,
Alessio Orlandi
,
Rajeev Raman
,
S. Srinivasa Rao
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 517-528
On the redundancy of succinct data structures
Alexander Golynski
,
Rajeev Raman
,
S. Srinivasa Rao
Lecture Notes in Computer Science
5124
, 2008, pp. 148-159
Adaptive searching in succinctly encoded binary relations and tree-structured documents
Jérémy Barbay
,
Alexander Golynski
,
J. Ian Munro
,
S. Srinivasa Rao
Theoretical Computer Science
387
(3), 2007, pp. 284-297
Succinct ordinal trees based on tree covering
Meng He
,
J. Ian Munro
,
S. Srinivasa Rao
Lecture Notes in Computer Science
4596
, 2007, pp. 509-520
Adaptive searching in succinctly encoded binary relations and tree-structured documents
Jérémy Barbay
,
Alexander Golynski
,
J. Ian Munro
,
S. Srinivasa Rao
Lecture Notes in Computer Science
4009
, 2006, pp. 24-35
Representing trees of higher degree
David Benoit
,
Erik D. Demaine
,
J. Ian Munro
,
Rajeev Raman
,
Venkatesh Raman
,
S. Srinivasa Rao
Algorithmica
43
(4), 2005, pp. 275-292
Longest increasing subsequences in sliding windows
Michael H. Albert
,
Alexander Golynski
,
Angèle M. Hamel
,
Alejandro López-Ortiz
,
S. Srinivasa Rao
,
Mohammad Ali Safari
Theoretical Computer Science
321
(2-3), 2004, pp. 405-414
Succinct representations of functions
J. Ian Munro
,
S. Srinivasa Rao
Lecture Notes in Computer Science
3142
, 2004, pp. 1006-1015
Full-text indexes in external memory
Juha Kärkkäinen
,
S. Srinivasa Rao
Lecture Notes in Computer Science
2625
, 2003, pp. 149-170
Time-space trade-offs for compressed suffix arrays
S. Srinivasa Rao
Information Processing Letters
82
, 2002, pp. 307-311
Space efficient suffix trees
J. Ian Munro
,
Venkatesh Raman
,
S. Srinivasa Rao
Journal of Algorithms
39
(2), 2001, pp. 205-222
Explicit deterministic constructions for membership in the bitprobe model
Jaikumar Radhakrishnan
,
Venkatesh Raman
,
S. Srinivasa Rao
Lecture Notes in Computer Science
2161
, 2001, pp. 290-299
Succinct dynamic data structures
Rajeev Raman
,
Venkatesh Raman
,
S. Srinivasa Rao
Lecture Notes in Computer Science
2125
, 2001, pp. 426-437
Static dictionaries supporting rank
Venkatesh Raman
,
S. Srinivasa Rao
Lecture Notes in Computer Science
1741
, 1999, pp. 18-26
A simplified
NP
-complete MAXSAT problem
Venkatesh Raman
,
B. Ravikumar
,
S. Srinivasa Rao
Information Processing Letters
65
(1), 1998, pp. 1-6