scientific article; zbMATH DE number 140457

MaRDI QIDQ4028873zbMATH OpenFDO

Authors Paul F. Dietz

Publication date 28 March 1993

zbMATH Keywords

list indexingsubset rank

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Recommendations

• Publication:4886029
• Lower bounds for dynamic data structures on algebraic RAMs
• Lower bounds on the size of selection and rank indexes
• Optimal lower bounds for rank and select indexes
• Optimal bounds for the predecessor problem and related problems

Cited in

(35)

• Random access in persistent strings and segment selection
• Counting palindromes in substrings
• Succinct partial sums and Fenwick trees
• Sorting signed permutations by reversals, revisited
• Space-efficient B trees via load-balancing
• A new family of randomized algorithms for list accessing
• Succinct data structures for searchable partial sums with optimal worst-case performance
• New algorithms and bounds for halving pseudolines
• A (slightly) faster algorithm for Klee's measure problem
• Dynamic range majority data structures
• Finding median in read-only memory on integer input
• Computing distances between partial rankings
• Partial evaluation in rank aggregation problems
• Linear-space data structures for range mode query in arrays
• Optimal resizable arrays
• Fast dynamic arrays
• Fusion trees can be implemented with AC^0 instructions only
• A quantitative study of pure parallel processes
• Partial sums on the ultra-wide word RAM
• Syntactic view of sigma-tau generation of permutations
• Lower bounds for dynamic transitive closure, planar point location, and parentheses matching
• scientific article; zbMATH DE number 7765406 (Why is no real title available?)
• scientific article; zbMATH DE number 910856 (Why is no real title available?)
• Lower bounds for dynamic algorithms
• Dynamic algorithms for the Dyck languages
• Ranking and unranking permutations in linear time
• Space-efficient B trees via load-balancing
• Improved time and space bounds for dynamic range mode
• Dynamic relative compression, dynamic partial sums, and substring concatenation
• Approximate Indexed Lists
• List Factoring and Relative Worst Order Analysis
• Succinct data structure for dynamic trees with faster queries
• A compact data structure and parallel algorithms for permutation graphs
• Dynamic data structures for approximate Hausdorff distance in the word RAM
• (Worst-case) optimal adaptive dynamic bitvectors

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028873)