S. Rao Kosaraju

S. Rao Kosaraju publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where S. Rao Kosaraju sits on this spectrum.

S. Rao Kosaraju D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where S. Rao Kosaraju sits on this spectrum.

Research.com Recognitions

• 1995 - ACM Fellow For contributions to the Theory of Parallel Computing.
• 1993 - IEEE Fellow For contributions to parallel computing theory.

Best Publications

• A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields

  Paul B. Callahan;S. Rao Kosaraju

  763
  Citations

• Decidability of reachability in vector addition systems (Preliminary Version)

  S. Rao Kosaraju

  463
  Citations

• Faster algorithms for some geometric graph problems in higher dimensions

  Paul B. Callahan;S. Rao Kosaraju

  177
  Citations

• Analysis of structured programs

  S. Rao Kosaraju

  148
  Citations

• Graph Problems on a Mesh-Connected Processor Array

  Mikhail J. Atallah;S. Rao Kosaraju

  147
  Citations

• Compression of Low Entropy Strings with Lempel--Ziv Algorithms

  S. Rao Kosaraju;Giovanni Manzini

  136
  Citations

• Efficient solutions to some transportation problems with applications to minimizing robot arm travel

  Mikhail J. Atallah;S. Rao Kosaraju

  131
  Citations

• Efficient tree pattern matching

  Unknown

  125
  Citations

• Optimal Parallel Evaluation of Tree-Structured Computations by Raking

  S. Rao Kosaraju;Arthur L. Delcher

  118
  Citations

• Computing circular separability

  Joseph O'rourke;S. Rao Kosaraju;Nimrod Megiddo

  109
  Citations

• Optimal Parallel Evaluation of Tree-Structured Computations by Raking

  Unknown

  108
  Citations

• Speed of Recognition of Context-Free Languages by Array Automata

  S. Rao Kosaraju

  99
  Citations

• Long tours and short superstrings

  Unknown

  98
  Citations

• Comparison-based search in the presence of errors

  Ryan S. Borgstrom;S. Rao Kosaraju

  92
  Citations

• On an Optimal Split Tree Problem

  S. Rao Kosaraju;Teresa M. Przytycka;Ryan S. Borgstrom

  91
  Citations

• Detecting cycles in dynamic graphs in polynomial time

  S. Rao Kosaraju;Gregory Sullivan

  86
  Citations

• Constructing trees in parallel

  M. J. Atallah;S. R. Kosaraju;L. L. Larmore;G. L. Miller

  81
  Citations

• An efficient algorithm for maxdominance, with applications

  Mikhail J. Atallah;S. Rao Kosaraju

  76
  Citations

• Faster algorithms for the construction of parameterized suffix trees

  S. Rao Kosaraju

  74
  Citations

• Limitations of Dijkstra's Semaphore Primitives and Petri nets

  S. Rao Kosaraju

  71
  Citations