S. Rao Kosaraju

From Wikipedia, the free encyclopedia
Jump to: navigation, search
S. Rao Kosaraju
Fields Computer science
Doctoral advisor Hisao Yamada
Known for Kosaraju's algorithm

Sambasiva Rao Kosaraju is a professor of computer science at Johns Hopkins University, and division director for Computing & Communication Foundations at the National Science Foundation.[1] He has done extensive work in the design and analysis of parallel and sequential algorithms.

In 1978, he wrote a paper describing a method to efficiently compute strongly connected members of a directed graph, a method later called Kosaraju's algorithm. Along with Paul Callahan he published many articles on efficient algorithms for computing the well-separated pair decomposition of a point set. His research efforts include efficient algorithms for pattern matching, data structure simulations, universal graphs, DNA sequence assembly, derandomization and investigations of immune system responses.[2]

In 1995 he was inducted as a Fellow of the Association for Computing Machinery. He is also a fellow of the IEEE. A common saying at Johns Hopkins University, "At some point, the learning stops and the pain begins." has been attributed to him. There used to be a shrine in the CS Undergraduate Lab in his honor.

He was born in India, and he did his bachelors in Engineering from Andhra University, and Masters from IIT Kharagpur, and is a PhD from University of Pennsylvania.[2]

References[edit]

  1. ^ Staff Announcement – CCF, Farnam Jahanian, NSF, retrieved 2014-01-14.
  2. ^ a b http://www.cs.jhu.edu/~kosaraju/

External links[edit]

  • Callahan, Paul B.; Kosaraju, Sambasiva Rao (1992), "A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields (preliminary version)", STOC '92: Proc. ACM Symp. Theory of Computing, ACM .
  • S. Rao Kosaraju at the Mathematics Genealogy Project