Travelled to:1 × Israel
1 × Italy
2 × Canada
5 × USA
Collaborated with:R.Cole T.Kavitha D.Panigrahi S.Muthukrishnan ∅ K.Mehlhorn S.Baswana S.Sen W.S.Fung N.J.A.Harvey A.Bhalgat
Talks about:algorithm (5) match (5) tree (4) construct (3) suffix (3) graph (3) parallel (2) faster (2) optim (2) determinist (1)
Person: Ramesh Hariharan
DBLP: Hariharan:Ramesh
Contributed to:
20112007
2006200320022000199719941994Wrote 10 papers:
- STOC-2011-FungHHP #framework #graph
- A general framework for graph sparsification (WSF, RH, NJAH, DP), pp. 71–80.
- STOC-2007-HariharanKPB #algorithm #graph
- An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs (RH, TK, DP, AB), pp. 605–614.
- ICALP-v1-2006-HariharanKM #algorithm #graph #performance
- A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs (RH, TK, KM), pp. 250–261.
- STOC-2003-ColeH #algorithm #performance
- A fast algorithm for computing steiner edge connectivity (RC, RH), pp. 167–176.
- STOC-2002-BaswanaHS #algorithm #maintenance #transitive
- Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths (SB, RH, SS), pp. 117–123.
- STOC-2002-ColeH #verification
- Verifying candidate matches in sparse and wildcard matching (RC, RH), pp. 592–601.
- STOC-2000-ColeH #performance
- Faster suffix tree construction with missing suffix links (RC, RH), pp. 407–415.
- STOC-1997-ColeH #pattern matching #random #set
- Tree Pattern Matching and Subset Matching in Randomized O(n log3m) Time (RC, RH), pp. 66–75.
- ICALP-1994-HariharanM #algorithm #parallel
- Optimal Parallel Algorithms for Prefix Matching (RH, SM), pp. 203–214.
- STOC-1994-Hariharan #parallel
- Optimal parallel suffix tree construction (RH), pp. 290–299.