The following pages link to Rajeev Raman (Q294928):
Displaying 50 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)
- On succinct representations of binary trees (Q2363992) (← links)
- Space efficient data structures for nearest larger neighbor (Q2634717) (← links)
- (Q2753954) (← links)
- Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima (Q2843259) (← links)
- Succinct Representations of Ordinal Trees (Q2848982) (← links)
- Encodings for Range Selection and Top-k Queries (Q2849345) (← links)
- Range Extremum Queries (Q2876587) (← links)
- Two Dimensional Range Minimum Queries and Fibonacci Lattices (Q2912843) (← links)
- Succinct Representations of Binary Trees for Range Minimum Queries (Q2914344) (← links)
- Encoding Nearest Larger Values (Q2942276) (← links)
- Succinct ordinal trees with level-ancestor queries (Q2944527) (← links)
- Encoding range minima and range top-2 queries (Q2955625) (← links)
- Asymptotically Optimal Encodings for Range Selection (Q2978521) (← links)
- (Q3046471) (← links)
- (Q3128924) (← links)
- (Q3138942) (← links)
- (Q3140421) (← links)
- (Q3140433) (← links)
- (Q3361878) (← links)
- SEPIA: Search for Proofs Using Inferred Automata (Q3454097) (← links)
- On the Redundancy of Succinct Data Structures (Q3512455) (← links)
- On the Size of Succinct Indices (Q3527227) (← links)
- Optimal Trade-Offs for Succinct String Indexes (Q3587418) (← links)
- Universal Succinct Representations of Trees? (Q3638055) (← links)
- (Q4016520) (← links)
- Randomized Data Structures for the Dynamic Closest-Pair Problem (Q4210083) (← links)
- Small-Rank Selection in Parallel, with Applications to Heap Construction (Q4228284) (← links)
- (Q4228437) (← links)
- (Q4449187) (← links)
- (Q4449188) (← links)
- Converting to and from Dilated Integers (Q4589568) (← links)
- Priority queues: Small, monotone and trans-dichotomous (Q4595482) (← links)
- (Q4643860) (← links)
- (Q4737157) (← links)
- (Q4778577) (← links)
