S. Srinivasa Rao

Srinivasa Rao Satti

other persons with the same name:

• S. Srinivasa Rao

	2009
35		Arash Farzan, Rajeev Raman, S. Srinivasa Rao: Universal Succinct Representations of Trees? ICALP (1) 2009: 451-462
34		Rasmus Pagh, Srinivasa Rao Satti: Secondary indexing in one dimension: beyond b-trees and bitmap indexes. PODS 2009: 177-186
33		Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao: More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries. STACS 2009: 517-528
32		Roberto Grossi, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao: More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries CoRR abs/0902.2648: (2009)
	2008
31		Esben Rune Hansen, S. Srinivasa Rao, Peter Tiedemann: Compressing Binary Decision Diagrams. ECAI 2008: 799-800
30		Alexander Golynski, Rajeev Raman, S. Srinivasa Rao: On the Redundancy of Succinct Data Structures. SWAT 2008: 148-159
29		Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao: External memory planar point location with logarithmic updates. Symposium on Computational Geometry 2008: 139-147
28		Paolo Ferragina, S. Srinivasa Rao: Tree Compression and Indexing. Encyclopedia of Algorithms 2008
27		Esben Rune Hansen, S. Srinivasa Rao, Peter Tiedemann: Compressing Binary Decision Diagrams CoRR abs/0805.3267: (2008)
26		Rasmus Pagh, S. Srinivasa Rao: Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes CoRR abs/0811.2904: (2008)
	2007
25		Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao: On the Size of Succinct Indices. ESA 2007: 371-382
24		Meng He, J. Ian Munro, S. Srinivasa Rao: Succinct Ordinal Trees Based on Tree Covering. ICALP 2007: 509-520
23		Jérémy Barbay, Meng He, J. Ian Munro, S. Srinivasa Rao: Succinct indexes for strings, binary relations and multi-labeled trees. SODA 2007: 680-689
22		Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Transactions on Algorithms 3(4): (2007)
21		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)
20		Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao: Adaptive searching in succinctly encoded binary relations and tree-structured documents. Theor. Comput. Sci. 387(3): 284-297 (2007)
	2006
19		Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao: Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents. CPM 2006: 24-35
18		Alexander Golynski, J. Ian Munro, S. Srinivasa Rao: Rank/select operations on large alphabets: a tool for text indexing. SODA 2006: 368-373
	2005
17		Meng He, J. Ian Munro, S. Srinivasa Rao: A categorization theorem on suffix arrays with applications to space efficient text indexes. SODA 2005: 23-32
16		Anna Pagh, Rasmus Pagh, S. Srinivasa Rao: An optimal Bloom filter replacement. SODA 2005: 823-829
15		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)
	2004
14		J. Ian Munro, S. Srinivasa Rao: Succinct Representations of Functions. ICALP 2004: 1006-1015
13		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. Theor. Comput. Sci. 321(2-3): 405-414 (2004)
	2003
12		J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao: Succinct Representations of Permutations. ICALP 2003: 345-356
11		Rajeev Raman, S. Srinivasa Rao: Succinct Dynamic Dictionaries and Trees. ICALP 2003: 357-368
10		Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian N. S. Pedersen, S. Srinivasa Rao: Computing Refined Buneman Trees in Cubic Time. WABI 2003: 259-270
	2002
9		Juha Kärkkäinen, S. Srinivasa Rao: Full-Text Indexes in External Memory. Algorithms for Memory Hierarchies 2002: 149-170
8		Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. SODA 2002: 233-242
7		S. Srinivasa Rao: Time-space trade-offs for compressed suffix arrays. Inf. Process. Lett. 82(6): 307-311 (2002)
	2001
6		Jaikumar Radhakrishnan, Venkatesh Raman, S. Srinivasa Rao: Explicit Deterministic Constructions for Membership in the Bitprobe Model. ESA 2001: 290-299
5		Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao: Succinct Dynamic Data Structures. WADS 2001: 426-437
4		J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao: Space Efficient Suffix Trees. J. Algorithms 39(2): 205-222 (2001)
	1999
3		Venkatesh Raman, S. Srinivasa Rao: Static Dictionaries Supporting Rank. ISAAC 1999: 18-26
	1998
2		J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao: Space Efficient Suffix Trees. FSTTCS 1998: 186-196
1		Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao: A Simplified NP-Complete MAXSAT Problem. Inf. Process. Lett. 65(1): 1-6 (1998)

Coauthor Index

1	Michael H. Albert	[13]
2	Lars Arge	[29]
3	Jérémy Barbay	[19] [20] [23]
4	David Benoit	[15]
5	Gerth Stølting Brodal	[10] [29]
6	Erik D. Demaine	[15]
7	Rolf Fagerberg	[10]
8	Arash Farzan	[35]
9	Paolo Ferragina	[28]
10	Alexander Golynski	[13] [18] [19] [20] [25] [30]
11	Roberto Grossi	[25] [32] [33]
12	Ankur Gupta	[25]
13	Angèle M. Hamel	[13]
14	Esben Rune Hansen	[27] [31]
15	Meng He	[17] [23] [24]
16	Juha Kärkkäinen	[9]
17	Alejandro López-Ortiz	[13]
18	J. Ian Munro	[2] [4] [12] [14] [15] [17] [18] [19] [20] [23] [24]
19	Alessio Orlandi	[32] [33]
20	Anna Pagh (Anna Östlin)	[10] [16]
21	Rasmus Pagh	[16] [26] [34]
22	Christian N. S. Pedersen	[10]
23	Jaikumar Radhakrishnan	[6]
24	Rajeev Raman	[5] [8] [11] [12] [15] [21] [22] [25] [30] [32] [33] [35]
25	Venkatesh Raman	[1] [2] [3] [4] [5] [6] [8] [12] [15] [21] [22]
26	Bala Ravikumar	[1]
27	Mohammad Ali Safari	[13]
28	Peter Tiedemann	[27] [31]

Colors in the list of coauthors