Faster dynamic range mode
From MaRDI portal
Cites work
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- Cell probe lower bounds and approximations for range mode
- Cell-probe lower bounds for succinct partial sums
- Dynamic orthogonal range searching on the RAM, revisited
- Dynamic range majority data structures
- Efficient algorithms on sets of permutations, dominance, and real-weighted APSP
- Faster algorithms for rectangular matrix multiplication
- scientific article; zbMATH DE number 2226802 (Why is no real title available?)
- Improved rectangular matrix multiplication using powers of the Coppersmith-Winograd tensor
- Improved time and space bounds for dynamic range mode
- Linear-space data structures for range mode query in arrays
- More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
- Multiplying matrices faster than coppersmith-winograd
- On Approximate Range Mode and Range Selection
- On the all-pairs-shortest-path problem in unweighted undirected graphs.
- On the asymptotic complexity of rectangular matrix multiplication
- On the exponent of all pairs shortest path problem
- Powers of tensors and fast matrix multiplication
- STACS 2005
- The design of dynamic data structures
- Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product
- Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications
- Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
This page was built for publication: Faster dynamic range mode
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842477)
