The following pages link to Ramesh Hariharan (Q1370857):
Displayed 34 items.
- Overlap matching. (Q1401926) (← links)
- An <i>O</i>(<i>n</i>log <i>n</i>) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees (Q2706115) (← links)
- (Q2768267) (← links)
- (Q2768306) (← links)
- (Q2934590) (← links)
- Approximate String Matching: A Simpler Faster Algorithm (Q3149893) (← links)
- Faster suffix tree construction with missing suffix links (Q3192008) (← links)
- Faster Algorithms for Minimum Cycle Basis in Directed Graphs (Q3395038) (← links)
- An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs (Q3549662) (← links)
- Verifying candidate matches in sparse and wildcard matching (Q3579248) (← links)
- (Q3579486) (← links)
- A fast algorithm for computing steiner edge connectivity (Q3581294) (← links)
- A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs (Q3613764) (← links)
- (Q4228434) (← links)
- (Q4250214) (← links)
- (Q4252293) (← links)
- (Q4252294) (← links)
- Tighter Lower Bounds on the Exact Complexity of String Matching (Q4326851) (← links)
- Tighter Upper Bounds on the Exact Complexity of String Matching (Q4340774) (← links)
- Tree Pattern Matching to Subset Matching in Linear Time (Q4429673) (← links)
- Faster Suffix Tree Construction with Missing Suffix Links (Q4441899) (← links)
- (Q4471322) (← links)
- (Q4526971) (← links)
- (Q4633834) (← links)
- (Q4875202) (← links)
- Faster enumeration of all spanning trees of a directed graph (Q5057454) (← links)
- A General Framework for Graph Sparsification (Q5232324) (← links)
- Dynamic LCA Queries on Trees (Q5317181) (← links)
- A general framework for graph sparsification (Q5419076) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465851) (← links)
- Optimal parallel suffix tree construction (Q5890842) (← links)
- Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths (Q5899451) (← links)
- Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths (Q5901051) (← links)
- Optimal parallel suffix tree construction (Q5906825) (← links)