Pages that link to "Item:Q4032934"

The following pages link to Recursive Star-Tree Parallel Data Structure (Q4032934):

Displaying 50 items.

• One-variable word equations in linear time (Q261339) (← links)
• Optimal encodings for range majority queries (Q270016) (← links)
• Online timestamped text indexing (Q294884) (← links)
• Inference algorithms for pattern-based CRFs on sequence data (Q334918) (← links)
• Entropy-bounded representation of point grids (Q390358) (← links)
• A scalable approach to computing representative lowest common ancestor in directed acyclic graphs (Q391971) (← links)
• Improved algorithms for the range next value problem and applications (Q428870) (← links)
• Extending common intervals searching from permutations to sequences (Q473211) (← links)
• LS(graph): a constraint-based local search for constraint optimization on trees and paths (Q487640) (← links)
• On Cartesian trees and range minimum queries (Q528853) (← links)
• Linear time algorithms for generalizations of the longest common substring problem (Q547294) (← links)
• The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
• Finding range minima in the middle: approximations and applications (Q626956) (← links)
• A work-time optimal algorithm for computing all string covers (Q671438) (← links)
• Blossom V: A new implementation of a minimum cost perfect matching algorithm (Q734352) (← links)
• Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees (Q975453) (← links)
• Range mode and range median queries in constant time and sub-quadratic space (Q976080) (← links)
• Improved algorithms for the multicut and multiflow problems in rooted trees (Q1024699) (← links)
• Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
• Testing string superprimitivity in parallel (Q1318749) (← links)
• Finding level-ancestors in trees (Q1329158) (← links)
• Pattern matching in a digitized image (Q1336966) (← links)
• Almost fully-parallel parentheses matching (Q1345960) (← links)
• Simulating shared memory in real time: On the computation power of reconfigurable architectures (Q1369096) (← links)
• The complexity of parallel prefix problems on small domains (Q1373137) (← links)
• Computing longest common extensions in partial words (Q1647840) (← links)
• The range 1 query (R1Q) problem (Q1659997) (← links)
• The nearest colored node in a tree (Q1698706) (← links)
• A simple linear-space data structure for constant-time range minimum query (Q1740692) (← links)
• LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161) (← links)
• Parallel algorithms for separable permutations (Q1763485) (← links)
• Parallel preprocessing for path queries without concurrent reading. (Q1854339) (← links)
• Computing optimal shortcuts for networks (Q2001454) (← links)
• Range minimum queries in minimal space (Q2078612) (← links)
• The fast algorithm for online \(k\)-server problem on trees (Q2097225) (← links)
• \textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations (Q2250447) (← links)
• Improved range minimum queries (Q2397152) (← links)
• Constructing suffix arrays in linear time (Q2569391) (← links)
• Encoding two-dimensional range top-\(k\) queries (Q2665908) (← links)
• Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
• Array Range Queries (Q2848983) (← links)
• The longest common substring problem (Q2971067) (← links)
• FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH (Q4820153) (← links)
• Parallel dynamic lowest common ancestors (Q5054770) (← links)
• Efficient parallel computing with memory faults (Q5055934) (← links)
• Heap construction in the parallel comparison tree model (Q5056136) (← links)
• (Q5091005) (← links)
• (Q5091064) (← links)
• (Q5140782) (← links)
• Spaces, Trees, and Colors (Q5176183) (← links)