The following pages link to Rajeev Raman (Q294928):
Displaying 18 items.
- Two dimensional range minimum queries and Fibonacci lattices (Q294929) (← links)
- Succinct representations of permutations and functions (Q441860) (← links)
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism (Q450558) (← links)
- Optimal indexes for sparse bit vectors (Q472491) (← links)
- Compact routing schemes for dynamic ring networks (Q705135) (← links)
- Representing trees of higher degree (Q818675) (← links)
- A simple optimal representation for balanced parentheses (Q859854) (← links)
- Encoding 2D range maximum queries (Q897899) (← links)
- A constant update time finger search tree (Q1338781) (← links)
- (Q1899447) (redirect page) (← links)
- Lower bounds for set intersection queries (Q1899448) (← links)
- Fast deterministic selection on mesh-connected processor arrays (Q1911464) (← links)
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word (Q2006779) (← links)
- Adaptive succinctness (Q2118203) (← links)
- Fast and simple compact hashing via bucketing (Q2165038) (← links)
- More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries (Q5390004) (← links)
- (Q6098778) (← links)
- Fast and simple compact hashing via bucketing (Q6487602) (← links)
