World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
30
Citations
4270
World Ranking
14042
National Ranking
5574

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

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

    S. Rao Kosaraju

  • Faster algorithms for some geometric graph problems in higher dimensions

    Paul B. Callahan;S. Rao Kosaraju

  • Analysis of structured programs

    S. Rao Kosaraju

  • Graph Problems on a Mesh-Connected Processor Array

    Mikhail J. Atallah;S. Rao Kosaraju

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

    S. Rao Kosaraju;Giovanni Manzini

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

    Mikhail J. Atallah;S. Rao Kosaraju

  • Efficient tree pattern matching

    Unknown

  • Optimal Parallel Evaluation of Tree-Structured Computations by Raking

    S. Rao Kosaraju;Arthur L. Delcher

  • Computing circular separability

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

  • Optimal Parallel Evaluation of Tree-Structured Computations by Raking

    Unknown

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

    S. Rao Kosaraju

  • Long tours and short superstrings

    Unknown

  • Comparison-based search in the presence of errors

    Ryan S. Borgstrom;S. Rao Kosaraju

  • On an Optimal Split Tree Problem

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

  • Detecting cycles in dynamic graphs in polynomial time

    S. Rao Kosaraju;Gregory Sullivan

  • Constructing trees in parallel

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

  • An efficient algorithm for maxdominance, with applications

    Mikhail J. Atallah;S. Rao Kosaraju

  • Faster algorithms for the construction of parameterized suffix trees

    S. Rao Kosaraju

  • Limitations of Dijkstra's Semaphore Primitives and Petri nets

    S. Rao Kosaraju

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Recently Published Articles