Pages that link to "Item:Q3319776"

The following pages link to Fast Algorithms for Finding Nearest Common Ancestors (Q3319776):

Displaying 50 items.

• Tight lower bounds for the longest common extension problem (Q2628282) (← links)
• Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems (Q2639778) (← links)
• The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
• Internal shortest absent word queries in constant time and linear space (Q2672592) (← links)
• A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs (Q2672614) (← links)
• Complete edge-colored permutation graphs (Q2672966) (← links)
• Checking whether a word is Hamming-isometric in linear time (Q2676462) (← links)
• A duality based 2-approximation algorithm for maximum agreement forest (Q2687064) (← links)
• Double string tandem repeats (Q2700385) (← links)
• A fully dynamic reachability algorithm for directed graphs with an almost linear update time (Q2810272) (← links)
• Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
• Array Range Queries (Q2848983) (← links)
• Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
• Longest Common Extensions in Trees (Q2942245) (← links)
• Longest Common Extensions in Sublinear Space (Q2942246) (← links)
• Range Minimum Query Indexes in Higher Dimensions (Q2942253) (← links)
• The longest common substring problem (Q2971067) (← links)
• Secure Authenticated Comparisons (Q3011317) (← links)
• FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING (Q3022028) (← links)
• Optimal Algorithms for Running Max and Min Filters on Random Inputs (Q3196410) (← links)
• Path-Fault-Tolerant Approximate Shortest-Path Trees (Q3460718) (← links)
• A Faster Computation of All the Best Swap Edges of a Tree Spanner (Q3460719) (← links)
• Fast Algorithms for Computing Tree LCS (Q3506956) (← links)
• Efficient Algorithms for SNP Haplotype Block Selection Problems (Q3511342) (← links)
• A Path Cover Technique for LCAs in Dags (Q3512461) (← links)
• Fitting a Step Function to a Point Set (Q3541106) (← links)
• Faster Swap Edge Computation in Minimum Diameter Spanning Trees (Q3541107) (← links)
• From Gene Trees to Species Trees through a Supertree Approach (Q3618625) (← links)
• Some Remarks on Superposition Based on Watson-Crick-Like Complementarity (Q3637240) (← links)
• Some Results for Elementary Operations (Q3644718) (← links)
• On Finding Lowest Common Ancestors: Simplification and Parallelization (Q3823152) (← links)
• Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees (Q4485190) (← links)
• A Data Structure for Nearest Common Ancestors with Linking (Q4554935) (← links)
• Dynamic algorithms for graphs of bounded treewidth (Q4571961) (← links)
• Strong Steiner Tree Approximations in Practice (Q4629541) (← links)
• Forty Years of Text Indexing (Q4928554) (← links)
• A Linear-Time Algorithm for Seeds Computation (Q4987445) (← links)
• What’s Behind Blast (Q4992751) (← links)
• NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs (Q4994988) (← links)
• Density Independent Algorithms for Sparsifying k-Step Random Walks (Q5002617) (← links)
• (Q5005170) (← links)
• Efficient maximum matching algorithms for trapezoid graphs (Q5006595) (← links)
• How to Keep an Eye on Small Things (Q5012868) (← links)
• Parallel dynamic lowest common ancestors (Q5054770) (← links)
• Optimal pointer algorithms for finding nearest common ancestors in dynamic trees (Q5054814) (← links)
• Linear-time heuristics for minimum weight rectangulation (Q5054819) (← links)
• Faster enumeration of all spanning trees of a directed graph (Q5057454) (← links)
• A simpler minimum spanning tree verification algorithm (Q5057455) (← links)
• Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs (Q5060111) (← links)
• (Q5077149) (← links)