Recommendations
Cited in
(58)- Improved algorithms for the multicut and multiflow problems in rooted trees
- Faster entropy-bounded compressed suffix trees
- Testing string superprimitivity in parallel
- Finding level-ancestors in trees
- Pattern matching in a digitized image
- Almost fully-parallel parentheses matching
- Simulating shared memory in real time: On the computation power of reconfigurable architectures
- The complexity of parallel prefix problems on small domains
- Computing longest common extensions in partial words
- The range 1 query (R1Q) problem
- The nearest colored node in a tree
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Parallel algorithms for separable permutations
- Parallel preprocessing for path queries without concurrent reading.
- Computing optimal shortcuts for networks
- Range minimum queries in minimal space
- The fast algorithm for online \(k\)-server problem on trees
- \textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations
- Improved range minimum queries
- Constructing suffix arrays in linear time
- One-variable word equations in linear time
- Encoding two-dimensional range top-\(k\) queries
- Internal shortest absent word queries in constant time and linear space
- Optimal encodings for range majority queries
- Array range queries
- Online timestamped text indexing
- The longest common substring problem
- Inference algorithms for pattern-based CRFs on sequence data
- Entropy-bounded representation of point grids
- A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
- Improved algorithms for the range next value problem and applications
- Extending common intervals searching from permutations to sequences
- FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH
- LS(graph): a constraint-based local search for constraint optimization on trees and paths
- Parallel dynamic lowest common ancestors
- Efficient parallel computing with memory faults
- Heap construction in the parallel comparison tree model
- Computing optimal shortcuts for networks
- Encoding two-dimensional range top-k queries revisited
- Dualities in tree representations
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Parallel range minima on coarse grained multicomputers
- On Cartesian trees and range minimum queries
- Linear time algorithms for generalizations of the longest common substring problem
- Shared memory simulations with triple-logarithmic delay
- The longest common extension problem revisited and applications to approximate string searching
- Prefix graphs and their applications
- Finding range minima in the middle: approximations and applications
- Range shortest unique substring queries
- On efficient algorithms for bottleneck path problems with many sources
- Time efficient implementation for online k-server problem on trees
- A work-time optimal algorithm for computing all string covers
- Quantum data structure for range minimum query
- Complexity of linear operators
- Shortest beer path queries based on graph decomposition
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
- Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees
- Range mode and range median queries in constant time and sub-quadratic space
This page was built for publication: Recursive Star-Tree Parallel Data Structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032934)
