BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × France
1 × Germany
1 × Greece
1 × Latvia
1 × Spain
1 × The Netherlands
1 × USA
1 × United Kingdom
Collaborated with:
S.S.Rao A.Farzan R.Grossi J.I.Munro T.Gransden N.Walkinshaw A.Orlandi M.A.Bender R.Cole S.R.Satti R.Venturini V.Raman A.Andersson T.Hagerup S.Nilsson
Talks about:
succinct (5) represent (2) string (2) dynam (2) tree (2) rang (2) dictionari (1) exponenti (1) algorithm (1) structur (1)

Person: Rajeev Raman

DBLP DBLP: Raman:Rajeev

Contributed to:

CADE 20152015
ICALP (1) 20132013
ICALP (1) 20122012
ICALP (1) 20102010
ICALP (1) 20092009
ICALP 20032003
ICALP 20022002
STOC 19951995

Wrote 9 papers:

CADE-2015-GransdenWR #automaton #named #proving #using
SEPIA: Search for Proofs Using Inferred Automata (TG, NW, RR), pp. 246–255.
ICALP-v1-2013-GrossiRRV #random #string
Dynamic Compressed Strings with Random Access (RG, RR, SRS, RV), pp. 504–515.
ICALP-v1-2012-FarzanMR #orthogonal #query
Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima (AF, JIM, RR), pp. 327–338.
ICALP-v1-2010-GrossiOR #string #trade-off
Optimal Trade-Offs for Succinct String Indexes (RG, AO, RR), pp. 678–689.
ICALP-v1-2009-FarzanRR #question
Universal Succinct Representations of Trees? (AF, RR, SSR), pp. 451–462.
ICALP-2003-MunroRRR #permutation
Succinct Representations of Permutations (JIM, RR, VR, SSR), pp. 345–356.
Succinct Dynamic Dictionaries and Trees (RR, SSR), pp. 357–368.
ICALP-2002-BenderCR #algorithm #exponential #performance
Exponential Structures for Efficient Cache-Oblivious Algorithms (MAB, RC, RR), pp. 195–207.
STOC-1995-AnderssonHNR #linear #question #sorting
Sorting in linear time? (AA, TH, SN, RR), pp. 427–436.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.