Concepedia

S. Rao Kosaraju

SR

52

Publications

3K

Citations

29

H-Index

1969

Active since

Affiliations

Johns Hopkins University(Current)

Purdue University West Lafayette

University of Pennsylvania

S. Rao Kosaraju is an author at Johns Hopkins University specializing in computer science, engineering, and computational complexity.

Top concepts

EngineeringComputer ScienceComputational ComplexityCombinatorial OptimizationComputer EngineeringParallel ComputingParallel ProgrammingFormal MethodsDiscrete MathematicsProgram Analysis

Publications per year

1969–2002

52

Publications

52

A decomposition of multidimensional point sets with applications to <i>k</i> -nearest-neighbors and <i>n</i> -body potential fields

Paul B. Callahan, S. Rao Kosaraju · Journal of the ACM · 1995 · 551 citations · Full text

Spectral Theory, Geometric Modeling, Engineering +14

Decidability of reachability in vector addition systems (Preliminary Version)

S. Rao Kosaraju · 1982 · 319 citations

Reachability Analysis, Engineering, Reachability Problem +11

Efficient tree pattern matching

S. Rao Kosaraju · 1989 · 122 citations

Tree Language, Tree Pattern Matching, Tree Pattern +14

Faster algorithms for some geometric graph problems in higher dimensions

Paul B. Callahan, S. Rao Kosaraju · Symposium on Discrete Algorithms · 1993 · 115 citations

Geometric Modeling, Geometric Graph Theory, Engineering +11

Compression of Low Entropy Strings with Lempel--Ziv Algorithms

S. Rao Kosaraju, Giovanni Manzini · SIAM Journal on Computing · 2000 · 109 citations

Optimal Compression Algorithm, Engineering, Kolmogorov Complexity +11

Rows per page

1–5 of 52