Pages that link to "Item:Q1241058"
From MaRDI portal
The following pages link to Preserving order in a forest in less than logarithmic time and linear space (Q1241058):
Displaying 50 items.
- Linear-space data structures for range frequency queries on arrays and trees (Q261369) (← links)
- Enumerating longest increasing subsequences and patience sorting (Q294846) (← links)
- The property suffix tree with dynamic properties (Q294931) (← links)
- Algorithms for interval structures with applications (Q388095) (← links)
- Fast algorithms for computing the constrained LCS of run-length encoded strings (Q428842) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- \(k\)-abelian pattern matching (Q491150) (← links)
- On the generalized constrained longest common subsequence problems (Q491203) (← links)
- Substring range reporting (Q517792) (← links)
- Cache-oblivious index for approximate string matching (Q551183) (← links)
- A general label search to investigate classical graph search algorithms (Q617648) (← links)
- The cost of cache-oblivious searching (Q639274) (← links)
- Trapezoid graphs and generalizations, geometry and algorithms (Q678864) (← links)
- More efficient bottom-up multi-pattern matching in trees (Q685356) (← links)
- Range-restricted mergeable priority queues (Q689640) (← links)
- Fast local searches and updates in bounded universes (Q691776) (← links)
- Biased predecessor search (Q727976) (← links)
- The power and limitations of static binary search trees with lazy finger (Q727988) (← links)
- Fast algorithms for computing tree LCS (Q732018) (← links)
- A new efficient algorithm for computing the longest common subsequence (Q733720) (← links)
- Upper bounds for sorting integers on random access machines (Q789897) (← links)
- New trie data structures which support very fast search operations (Q794438) (← links)
- Dynamic coresets (Q834605) (← links)
- Speeding up transposition-invariant string matching (Q845816) (← links)
- Finding shortest path in the presence of barriers: an alternate approach (Q870173) (← links)
- A review of metrics on permutations for search landscape analysis (Q878593) (← links)
- Efficient algorithms for the minimum connected domination on trapezoid graphs (Q881872) (← links)
- A parallel algorithm for finding a maximum clique of a set of circular arcs of a circle (Q911283) (← links)
- Bounded ordered dictionaries in O(log log N) time and O(n) space (Q915434) (← links)
- An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals (Q915465) (← links)
- Algorithms for computing variants of the longest common subsequence problem (Q932321) (← links)
- Orthogonal range searching in linear and almost-linear space (Q1005331) (← links)
- An O(m log log D) algorithm for shortest paths (Q1053460) (← links)
- Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings (Q1085982) (← links)
- The longest common subsequence problem revisited (Q1098310) (← links)
- Finding maximum cliques on circular-arc graphs (Q1108807) (← links)
- Scanline algorithms on a grid (Q1111020) (← links)
- An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs (Q1123622) (← links)
- New clique and independent set algorithms for circle graphs (Q1186158) (← links)
- Dynamic programming with convexity, concavity and sparsity (Q1190452) (← links)
- Finding the \(k\) smallest spanning trees (Q1196455) (← links)
- An efficient one-side height minimization algorithm for routing around a rectangle (Q1201874) (← links)
- Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs (Q1210310) (← links)
- A probabilistic minimum spanning tree algorithm (Q1241278) (← links)
- Space-time trade off in implementing certain set operations (Q1253919) (← links)
- Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs (Q1313714) (← links)
- Efficient labelling algorithms for the maximum noncrossing matching problem (Q1315996) (← links)
- Improved parallel integer sorting without concurrent writing (Q1362905) (← links)
- The space-optimal version of a known rectangle enclosure reporting algorithm (Q1391959) (← links)
- A new algorithm for rectangle enclosure reporting (Q1607019) (← links)