Pages that link to "Item:Q3823152"

The following pages link to On Finding Lowest Common Ancestors: Simplification and Parallelization (Q3823152):

Displaying 50 items.

• Online timestamped text indexing (Q294884) (← links)
• Compact separator decompositions in dynamic trees and applications to labeling schemes (Q352249) (← 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)
• Efficient algorithms for local ranking (Q436589) (← links)
• Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) (← links)
• On Cartesian trees and range minimum queries (Q528853) (← links)
• A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
• Testing convexity properties of tree colorings (Q547293) (← links)
• Faster query algorithms for the text fingerprinting problem (Q549671) (← links)
• The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
• Cache oblivious algorithms for the RMQ and the RMSQ problems (Q626901) (← links)
• Linear-time construction of two-dimensional suffix trees (Q627547) (← links)
• Efficient algorithms for shortest distance queries on special classes of polygons (Q673766) (← links)
• Recognition of DFS trees: Sequential and parallel algorithms with refined verifications (Q685690) (← links)
• On space efficient two dimensional range minimum data structures (Q692632) (← links)
• Constant-time tree traversal and subtree equality check for grammar-compressed trees (Q724220) (← links)
• Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
• Constant delay traversal of grammar-compressed graphs with bounded rank (Q776844) (← links)
• Sequential and parallel algorithms for the NCA problem on pure pointer machines (Q818121) (← links)
• Common intervals of trees (Q834996) (← links)
• Drawing \(c\)-planar biconnected clustered graphs (Q885287) (← links)
• Recognizing breadth-first search trees in linear time (Q911287) (← links)
• Parallel algorithms for the segment dragging problem (Q918740) (← links)
• Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm (Q919827) (← links)
• All-pairs disjoint paths from a common ancestor in \(\widetilde O (n^\omega)\) time (Q924140) (← links)
• Searching for a set of correlated patterns (Q924555) (← links)
• Real two dimensional scaled matching (Q1024780) (← links)
• Discovering subword associations in strings in time linear in the output size (Q1026231) (← links)
• Two flow network simplification algorithms (Q1045934) (← links)
• The suffix tree of a tree and minimizing sequential transducers (Q1127317) (← links)
• Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses (Q1183475) (← links)
• Fast average-case pattern matching by multiplexing sparse tables (Q1190461) (← links)
• A fast cost-optimal parallel algorithm for the lowest common ancestor problem (Q1195156) (← links)
• The weighted maximum independent set problem in permutation graphs (Q1195927) (← links)
• A parallel algorithm for approximating the minimum cycle cover (Q1207326) (← links)
• Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms (Q1274331) (← links)
• Reconstructing a history of recombinations from a set of sequences (Q1281773) (← links)
• New algorithms for the LCA problem and the binary tree reconstruction problem (Q1328757) (← links)
• Finding level-ancestors in trees (Q1329158) (← links)
• Finding lowest common ancestors in arbitrarily directed trees (Q1330662) (← links)
• Ray shooting in polygons using geodesic triangulations (Q1330785) (← links)
• Sublinear approximate string matching and biological applications (Q1336963) (← links)
• Pattern matching in a digitized image (Q1336966) (← links)
• Planarity testing in parallel (Q1342859) (← links)
• Efficient parallel recognition algorithms of cographs and distance hereditary graphs (Q1345961) (← links)
• Rectilinear short path queries among rectangular obstacles (Q1351630) (← links)
• A note on finding compact sets in graphs represented by an adjacency list (Q1351637) (← links)
• A simpler minimum spanning tree verification algorithm (Q1355729) (← links)
• Unified all-pairs shortest path algorithms in the chordal hierarchy (Q1364781) (← links)