The following pages link to Srinivasa Rao Satti (Q262262):
Displaying 50 items.
- Succinct dynamic cardinal trees (Q262263) (← links)
- Two dimensional range minimum queries and Fibonacci lattices (Q294929) (← links)
- Simultaneous encodings for range and next/previous larger/smaller value queries (Q344773) (← links)
- Selection from read-only memory with limited workspace (Q744087) (← links)
- Encoding 2D range maximum queries (Q897899) (← links)
- Maintaining chordal graphs dynamically: improved upper and lower bounds (Q1625138) (← links)
- Minimum transactions problem (Q1791032) (← links)
- Approximate query processing over static sets and sliding windows (Q1981762) (← links)
- Succinct navigational oracles for families of intersection graphs on a circle (Q2079878) (← links)
- Finding kings in tournaments (Q2081490) (← links)
- Succinct representation for (non)deterministic finite automata (Q2084735) (← links)
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs (Q2150567) (← links)
- Succinct representations for (non)deterministic finite automata (Q2232264) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- Succinct data structures for families of interval graphs (Q2285077) (← links)
- Space efficient algorithms for breadth-depth search (Q2291421) (← links)
- Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
- On succinct representations of binary trees (Q2363992) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- Space-efficient algorithms for maximum cardinality search, stack BFS, queue BFS and applications (Q2412402) (← links)
- Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS (Q2420652) (← links)
- Integer representations towards efficient counting in the bit probe model (Q2447536) (← links)
- Near-optimal online multiselection in internal and external memory (Q2634712) (← links)
- Space efficient data structures for nearest larger neighbor (Q2634717) (← links)
- Succinct encodings for families of interval graphs (Q2661990) (← links)
- Encoding two-dimensional range top-\(k\) queries (Q2665908) (← links)
- Finding Mode Using Equality Comparisons (Q2803838) (← links)
- Succinct Representations of Binary Trees for Range Minimum Queries (Q2914344) (← links)
- Space Efficient Data Structures for Nearest Larger Neighbor (Q2946053) (← links)
- Asymptotically Optimal Encodings for Range Selection (Q2978521) (← links)
- Succinct indexes for strings, binary relations and multilabeled trees (Q3189037) (← links)
- Succinct ordinal trees based on tree covering (Q3189085) (← links)
- Sorting and Selection with Equality Comparisons (Q3449841) (← links)
- The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments (Q4632200) (← links)
- Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits (Q4636504) (← links)
- Selection from Read-Only Memory with Limited Workspace (Q4925233) (← links)
- Asymptotically Optimal Encodings of Range Data Structures for Selection and Top- <i>k</i> Queries (Q4962658) (← links)
- Succinct indexable dictionaries with applications to encoding <i>k</i> -ary trees, prefix sums and multisets (Q4962682) (← links)
- A Framework for In-place Graph Algorithms (Q5009570) (← links)
- Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
- Approximate query processing over static sets and sliding windows (Q5091046) (← links)
- (Q5091064) (← links)
- Synergistic Solutions on MultiSets (Q5110897) (← links)
- Compact Encodings and Indexes for the Nearest Larger Neighbor Problem (Q5176572) (← links)
- Dynamic Online Multiselection in Internal and External Memory (Q5176584) (← links)
- Random Access to Grammar-Compressed Strings and Trees (Q5255003) (← links)
- (Q5365049) (← links)
- Encoding Two-Dimensional Range Top-k Queries (Q5369535) (← links)
- Enumerating Range Modes (Q6065431) (← links)
- Energy efficient sorting, selection and searching (Q6091161) (← links)
