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

(32)

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

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)