scientific article

zbMath0766.68057MaRDI QIDQ4028873

Paul F. Dietz

Publication date: 28 March 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

list indexingsubset rank

Mathematics Subject Classification ID

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

Related Items (28)

Dynamic range majority data structures ⋮ Lower bounds for dynamic transitive closure, planar point location, and parentheses matching ⋮ Lower bounds for dynamic algorithms ⋮ Dynamic algorithms for the Dyck languages ⋮ Partial evaluation in rank aggregation problems ⋮ Space-efficient B trees via load-balancing ⋮ Succinct data structure for dynamic trees with faster queries ⋮ A compact data structure and parallel algorithms for permutation graphs ⋮ Random access in persistent strings and segment selection ⋮ A quantitative study of pure parallel processes ⋮ Unnamed Item ⋮ Succinct Partial Sums and Fenwick Trees ⋮ Counting Palindromes in Substrings ⋮ Improved Time and Space Bounds for Dynamic Range Mode ⋮ Dynamic data structures for approximate Hausdorff distance in the word RAM ⋮ Dynamic relative compression, dynamic partial sums, and substring concatenation ⋮ Linear-space data structures for range mode query in arrays ⋮ New algorithms and bounds for halving pseudolines ⋮ Computing distances between partial rankings ⋮ Sorting signed permutations by reversals, revisited ⋮ Succinct data structures for searchable partial sums with optimal worst-case performance ⋮ Syntactic view of sigma-tau generation of permutations ⋮ Partial sums on the ultra-wide word RAM ⋮ Unnamed Item ⋮ A (slightly) faster algorithm for Klee's measure problem ⋮ Fusion trees can be implemented with \(AC^0\) instructions only ⋮ Finding median in read-only memory on integer input ⋮ Ranking and unranking permutations in linear time

This page was built for publication: