#### Filter Results:

- Full text PDF available (68)

#### Publication Year

1982

2018

- This year (11)
- Last 5 years (38)
- Last 10 years (64)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
- SODA
- 2002

We consider the <i>indexable dictionary</i> problem which consists in storing a set <i>S</i> ⊆ {0,…, <i>m</i> - 1} for some integer <i>m,</i> while supporting the operations ofâ€¦ (More)

- Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
- ACM Trans. Algorithms
- 2007

We consider the <i>indexable dictionary</i> problem, which consists of storing a set <i>S</i> ⊆ {0,…,<i>m</i> − 1} for some integer <i>m</i> while supporting theâ€¦ (More)

- Richard F. Geary, Rajeev Raman, Venkatesh Raman
- SODA
- 2004

We consider <i>suc cinct</i> or space-efficient representations of trees that efficiently support a variety of navigation operations. We focus on static <i>ordinal</i> trees, i.e., arbitrary staticâ€¦ (More)

- Rajeev Raman
- ESA
- 1996

We consider two data-structuring problems which involve performing priority queue (pq) operations on a set of integers in the range 0 . . 2 âˆ’ 1 on a unit-cost RAM with word size w bits. A monotoneâ€¦ (More)

- Rajeev Raman, S. Srinivasa Rao
- ICALP
- 2003

We consider space-efficient solutions to two dynamic data structuring problems. We first give a representation of a set S âŠ† U = {0, . . . ,mâˆ’ 1}, |S| = n that supports membership queries in O(1)â€¦ (More)

- Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman
- STOC
- 1995

We show that a unit-cost RAM with a word length of w bits can sort n integers in the range O â€¢â€¢ 2f<1 -1 in O( n log log n) time, for arbitrary w ~ log n, a significant improvement over the bound ofâ€¦ (More)

Let <i>S</i> be a string of length <i>N</i> compressed into a context-free grammar <i>S</i> of size <i>n</i>. We present two representations of <i>S</i> achieving <i>O</i>(log <i>N</i>) random accessâ€¦ (More)

- J. Ian Munro, Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
- ICALP
- 2003

- Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
- WADS
- 2001

We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array consisting of a sequence ofâ€¦ (More)

- O'Neil Delpratt, Naila Rahman, Rajeev Raman
- WEA
- 2006

Ordinal trees are arbitrary rooted trees where the children of each node are ordered. We consider succinct, or highly space-efficient, representations of (static) ordinal trees with n nodes that useâ€¦ (More)