Kosaraju, S. Rao

Professor
Computer Science

Malone 213
(410) 516-8134
skosara1@jhu.edu

Jump to:

About

Education
  • Ph.D. 1969, Univ Pennsylvania
Experience
  • 2003 - 2003:  Chair, Duke CS External Review Comm
  • 2002 - 2002:  Chair, Knuth Prize Selection Committee
  • 2001 - 2001:  Program Committee Chair, ACM/SIAM
  • 1989 - 1991:  Chair, NSF Advisory Committee for Computer and Computation Research
Research Areas
  • Applied algorithms
  • Computational Biology
  • Computational geometry
  • Pattern matching
Awards
  • 2001:  JHU Alumni Association Excellence in Teaching Award - 2001
  • 1999:  JHU Alumni Association Excellence in Teaching Award - 1999
  • 1992:  Fellow - ACM
  • 1992:  Willam H. Huggins Excellence in Teaching Award - 1992
  • 1992:  Fellow - IEEE
  • 1987:  Citation from SIAM for Service to Computer Science Community as the Managing Editor of SIAM Journal of Computing

Publications

Journal Articles
  • Bhargava A, Kosaraju SR (2005).  Derandomization of dimensionality reduction and SDP based algorithms.  Lecture Notes in Computer Science.  3608.
  • Kosaraju SR (2001).  Balanced suffix trees.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  2089.
  • Kosaraju SR, Manzini G (2000).  Compression of low entropy strings with Lempel-Ziv algorithms.  SIAM Journal on Computing.  29(3).
  • Capalbo MR, Kosaraju SR (1999).  Small universal graphs.  Conference Proceedings of the Annual ACM Symposium on Theory of Computing.
  • Kosaraju SR, Przytycka TM, Borgstrom R (1999).  On an optimal split tree problem.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  1663.
  • Kosaraju SR, Pop M (1998).  De-amortization of algorithms: Preliminary version.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  1449.
  • Kosaraju SR, Schäffer AA, Biesecker LG (1998).  Approximation algorithms for a genetic diagnostics problem.  Journal of Computational Biology.  5(1).
  • Kosaraju SR, Manzini G (1997).  Compression of low entropy strings with Lempel-Ziv algorithms.  Proceedings of the International Conference on Compression and Complexity of Sequences.
  • Kosaraju SR, Manzini G (1997).  Some entropic bounds for Lempel-Ziv algorithms.  Data Compression Conference Proceedings.
  • Chan T, Goodrich MT, Kosaraju SR, Tamassia R (1997).  Optimizing area and aspect ratio in straight-line orthogonal tree drawings.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  1190.
  • Kosaraju SR, Schäffer AA, Biesecker LG (1997).  Approximation algorithms for a genetic diagnostics problem.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  1272.
  • Goodrich MT, Kosaraju SR (1996).  Sorting on a parallel pointer machine with applications to set expression evaluation.  Journal of the ACM.  43(2).
  • Kosaraju SR (1995).  Faster algorithms for the construction of parameterized suffix trees.  Annual Symposium on Foundations of Computer Science - Proceedings.
  • Callahan PB, Kosaraju SR (1995).  A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors And N-Body Potential Fields.  Journal of the ACM (JACM).  42(1).
  • Callahan PB, Kosaraju SR (1995).  Algorithms for dynamic closest pair and n-body potential fields.  Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.
  • Delcher AL, Kosaraju SR (1995).  NC algorithm for evaluating monotone planar circuits.  SIAM Journal on Computing.  24(2).
  • Kosaraju SR (1994).  Real-time pattern matching and quiwi-real-time construction of suffix trees preliminary version.  Proceedings of the Annual ACM Symposium on Theory of Computing.  Part F129502.
  • Atallah MJ, Goodrich MT, Kosaraju SR (1994).  Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations.  Journal of the ACM (JACM).  41(6).
  • Kosaraju SR (1994).  Optimal RAM implementation of catenable min double-ended queues.  Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms.
  • Bergstrom RS, Kosaraju SR (1993).  Comparison-based search in the presence of errors (Preliminary version).  Proceedings of the Annual ACM Symposium on Theory of Computing.  Part F129585.
  • Callahan PB, Kosaraju SR (1993).  Faster algorithms for some geometric graph problems in higher dimensions.  Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms.
  • Callahan PB, Kosaraju SR (1992).  A decomposition of multi-dimensional point-sets with applications to κ-nearest-neighbors and n-body potential fields.  Proceedings of the Annual ACM Symposium on Theory of Computing.  Part F129722.
  • Aggarwal A, Carter JL, Kosaraju SR (1991).  Optimal tradeoffs for addition on systolic arrays.  Algorithmica.  6(1).
  • Aggarwal A, Carter JL, Kosaraju SR (1991).  Optimal tradeoffs for addition on systolic arrays.  Algorithmica.  6(1-6).
  • Agarwal PK, Aggarwal A, Aronov B, Kosaraju SR, Schieber B, Suri S (1991).  Computing external farthest neighbors for a simple polygon.  Discrete Applied Mathematics.  31(2).
  • Kosaraju SR, Delcher AL (1991).  A tree-partitioning technique with applications to expression evaluation and term matching.  IEEE Transactions on Industry Applications.  27(1 pt 1).
  • Goodrich MT, Kosaraju SR (1989).  Sorting on a parallel pointer machine with applications to set expression evaluation.  Annual Symposium on Foundations of Computer Science (Proceedings).
  • Kosaraju SR (1989).  Pipelining computations in a tree of processors.  Annual Symposium on Foundations of Computer Science (Proceedings).
  • Kosaraju SR (1989).  Efficient tree pattern matching.  Annual Symposium on Foundations of Computer Science (Proceedings).
  • Atallah MJ, Kosaraju SR (1989).  An efficient algorithm for maxdominance, with applications.  Algorithmica.  4(1-4).
  • Atallah MJ, Kosaraju SR, Larmore LL, Miller GL, Teng SH (1989).  Constructing trees in parallel.  Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989.
  • Beigel R, Kosaraju SR, Sullivan GF (1989).  Locating faults in a constant number of parallel testing rounds.  Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989.
  • Kosaraju SR, Atallah MJ (1988).  Optimal simulations between mesh-connected arrays of processors.  Journal of the ACM (JACM).  35(3).
  • Atallah MJ, Frederickson GN, Kosaraju SR (1988).  Sorting with efficient use of special-purpose sorters.  Information Processing Letters.  27(1).
  • Atallah MJ, Goodrich MT, Kosaraju SR (1988).  Parallel algorithms for evaluating sequences of set-manipulation operations: Preliminary version.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  319 LNCS.
  • Kosaraju SR, Sullivan GF (1988).  Detecting cycles in dynamic graphs in polynomial time.  Proceedings of the Annual ACM Symposium on Theory of Computing.
  • Kantabutra V, Kosaraju SR (1986).  New algorithms for multilink robot arms.  Journal of Computer and System Sciences.  32(1).
  • Aggarwal A, Carter JL, Kosaraju SR (1986).  Optimal tradeoffs for addition on systolic arrays.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  227 LNCS.
  • Atallah MJ, Kosaraju SR (1985).  A Generalized Dictionary Machine for VLSI.  IEEE Transactions on Computers.  C-34(2).
  • Atallah MJ, Kosaraju SR (1984).  Graph Problems on a Mesh-Connected Processor Array.  Journal of the ACM (JACM).  31(3).
  • Atallah MJ, Kosaráju SR (1981).  An adversary-based lower bound for sorting.  Information Processing Letters.  13(2).
  • Baker BS, Kosaraju SR (1979).  A Comparison of Multilevel break and next Statements.  Journal of the ACM (JACM).  26(3).
  • Kosaraju SR (1978).  Insertions and Deletions In One-Sided Height-Balanced Trees.  Communications of the ACM.  21(3).
  • Kosaraju SR (1977).  On independent circuits of a digraph.  Journal of Graph Theory.  1(4).
  • Flynn MJ, Kosaraju SR (1976).  Processes and their interactions.  Kybernetes.  5(3).
  • Kosaraju SR (1975).  Context-free preserving functions.  Mathematical Systems Theory.  9(2).
  • Kosaraju SR (1974).  On Some Open Problems in the Theory of Cellular Automata.  IEEE Transactions on Computers.  C-23(6).
  • Kosaraju SR (1974).  Analysis of structured programs.  Journal of Computer and System Sciences.  9(3).
  • Kosaraju SR (1974).  A note on probabilistic input3-output relations.  Information and Control.  26(2).
  • Kosaraju SR (1974).  1-Way stack automaton with jumps.  Journal of Computer and System Sciences.  9(2).
  • Kosaraju SR (1973).  LIMITATIONS OF DIJKSTRA'S SEMAPHORE PRIMITIVES AND PETRI NETS..
  • Kosaraju SR (1973).  ANALYSIS OF STRUCTURED PROGRAMS..
Back to top