The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

S. Rao Kosaraju: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. S. Rao Kosaraju
    Efficient Tree Pattern Matching (Preliminary Version) [Citation Graph (2, 0)][DBLP]
    FOCS, 1989, pp:178-183 [Conf]
  2. Mikhail J. Atallah, S. Rao Kosaraju
    A Generalized Dictionary Machine for VLSI. [Citation Graph (1, 0)][DBLP]
    IEEE Trans. Computers, 1985, v:34, n:2, pp:151-155 [Journal]
  3. Alok Aggarwal, S. Rao Kosaraju
    Optimal Tradeoffs for Addition on Systolic Arrays (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Aegean Workshop on Computing, 1986, pp:57-69 [Conf]
  4. Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju
    Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:1-10 [Conf]
  5. S. Rao Kosaraju, Arthur L. Delcher
    Optimal Parallel Evaluation of Tree-Structured Computations by Raking. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:101-110 [Conf]
  6. S. Rao Kosaraju, Mihai Pop
    De-amortization of Algorithms. [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:4-14 [Conf]
  7. S. Rao Kosaraju
    Balanced Suffix Trees (Invited Lecture). [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:231- [Conf]
  8. S. Rao Kosaraju
    Computation of Squares in a String (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:146-150 [Conf]
  9. Ankur Bhargava, S. Rao Kosaraju
    An Algorithm for Computing DNA Walks. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:110-121 [Conf]
  10. Michael T. Goodrich, S. Rao Kosaraju
    Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:190-195 [Conf]
  11. Aravind K. Joshi, S. Rao Kosaraju, H. Yamada
    String Adjunct Grammars [Citation Graph (0, 0)][DBLP]
    FOCS, 1969, pp:245-262 [Conf]
  12. S. Rao Kosaraju
    Recognition of Context-Free and Stack Languages [Citation Graph (0, 0)][DBLP]
    FOCS, 1969, pp:129-132 [Conf]
  13. S. Rao Kosaraju
    Pipelining Computations in a Tree of Processors (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:184-189 [Conf]
  14. S. Rao Kosaraju
    Faster Algorithms for the Construction of Parameterized Suffix Trees (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:631-637 [Conf]
  15. S. Rao Kosaraju, Arthur L. Delcher
    A Tree-Partitioning Technique with Applications to Expression Evaluation and Term Matching (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:163-172 [Conf]
  16. S. Rao Kosaraju, James K. Park, Clifford Stein
    Long Tours and Short Superstrings (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:166-177 [Conf]
  17. S. Rao Kosaraju
    On Parallel Evaluation of Classes of Circuits. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:232-237 [Conf]
  18. S. Rao Kosaraju
    Pattern Matching in Compressed Texts. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:349-362 [Conf]
  19. Alok Aggarwal, S. Rao Kosaraju, Mihai Pop
    Drawing of Two-Dimensional Irregular Meshes. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:1-14 [Conf]
  20. Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia
    Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:63-75 [Conf]
  21. S. Rao Kosaraju
    Mesh Algorithms for Multiplication and Division. [Citation Graph (0, 0)][DBLP]
    HiPC, 2001, pp:17-23 [Conf]
  22. David G. Heath, Simon Kasif, S. Rao Kosaraju, Steven Salzberg, Gregory F. Sullivan
    Learning Nested Concept Classes with Limited Storage. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1991, pp:777-782 [Conf]
  23. Mikhail J. Atallah, S. Rao Kosaraju
    An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:394-403 [Conf]
  24. Paul B. Callahan, S. Rao Kosaraju
    Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:291-300 [Conf]
  25. Paul B. Callahan, S. Rao Kosaraju
    Algorithms for Dynamic Closest Pair and n-Body Potential Fields. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:263-272 [Conf]
  26. S. Rao Kosaraju
    An Optimal RAM Implementation of Catenable Min Double-ended Queues. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:195-203 [Conf]
  27. S. Rao Kosaraju
    Limitations of Dijkstra's Semaphore Primitives and Petri Nets. [Citation Graph (0, 0)][DBLP]
    SOSP, 1973, pp:122-136 [Conf]
  28. Richard Beigel, S. Rao Kosaraju, Gregory F. Sullivan
    Locating Faults in a Constant Number of Parallel Testing Rounds. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:189-198 [Conf]
  29. Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng
    Constructing Trees in Parallel. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:421-431 [Conf]
  30. Mikhail J. Atallah, S. Rao Kosaraju
    Graph Problems on a Mesh-Connected Processor Array (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:345-353 [Conf]
  31. Ryan S. Borgstrom, S. Rao Kosaraju
    Comparison-based search in the presence of errors. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:130-136 [Conf]
  32. Paul B. Callahan, S. Rao Kosaraju
    A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:546-556 [Conf]
  33. Michael R. Capalbo, S. Rao Kosaraju
    Small Universal Graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:741-749 [Conf]
  34. S. Rao Kosaraju
    On Structuring Flowcharts (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1976, pp:101-111 [Conf]
  35. S. Rao Kosaraju
    On a Multidimensional Search Problem (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:67-73 [Conf]
  36. S. Rao Kosaraju
    Fast Parallel Processing Array Algorithms for some Graph Problems (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:231-236 [Conf]
  37. S. Rao Kosaraju
    Real-Time Simulation of Concatenable Double-Ended Queues by Double-Ended Queues (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:346-351 [Conf]
  38. S. Rao Kosaraju
    Localized Search in Sorted Lists [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:62-69 [Conf]
  39. S. Rao Kosaraju
    Decidability of Reachability in Vector Addition Systems (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:267-281 [Conf]
  40. S. Rao Kosaraju
    Parallel Evaluation of Division-Free Arithmetic Expressions [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:231-239 [Conf]
  41. S. Rao Kosaraju
    Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version). [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:310-316 [Conf]
  42. S. Rao Kosaraju, Mikhail J. Atallah
    Optimal Simulations between Mesh-Connected Arrays of Processors (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:264-272 [Conf]
  43. S. Rao Kosaraju
    Euler paths in series parallel graphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:237-240 [Conf]
  44. S. Rao Kosaraju
    Analysis of Structured Programs [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:240-252 [Conf]
  45. S. Rao Kosaraju, Arthur L. Delcher
    Large-scale assembly of DNA strings and space-efficient construction of suffix trees. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:169-177 [Conf]
  46. S. Rao Kosaraju, Arthur L. Delcher
    Large-Scale Assembly of DNA Strings and Space-Efficient Construction of Suffix Trees (Correction). [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:659- [Conf]
  47. S. Rao Kosaraju, Gregory F. Sullivan
    Detecting Cycles in Dynamic Graphs in Polynomial Time (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:398-406 [Conf]
  48. Ankur Bhargava, S. Rao Kosaraju
    Derandomization of Dimensionality Reduction and SDP Based Algorithms. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:396-408 [Conf]
  49. S. Rao Kosaraju, Teresa M. Przytycka, Ryan S. Borgstrom
    On an Optimal Split Tree Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:157-168 [Conf]
  50. S. Rao Kosaraju, Alejandro A. Schäffer, Leslie G. Biesecker
    Approximation Algorithms for a Genetic Diagnostics Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:69-92 [Conf]
  51. Alok Aggarwal, J. Lawrence Carter, S. Rao Kosaraju
    Optimal Tradeoffs for Addition on Systolic Arrays. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:1, pp:49-71 [Journal]
  52. Mikhail J. Atallah, S. Rao Kosaraju
    An Efficient Algorithm for Maxdominance, with Applications. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:2, pp:221-236 [Journal]
  53. S. Rao Kosaraju
    Insertions and Deletions In One-Sided Height-Balanced Trees. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1978, v:21, n:3, pp:226-227 [Journal]
  54. Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia
    Optimizing area and aspect ration in straight-line orthogonal tree drawings. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:2, pp:153-162 [Journal]
  55. Aravind K. Joshi, S. Rao Kosaraju, H. M. Yamada
    String Adjunct Grammars: I. Equational Representation, Null Symbols, and Linguistic Relevance [Citation Graph (0, 0)][DBLP]
    Information and Control, 1972, v:21, n:3, pp:235-260 [Journal]
  56. Aravind K. Joshi, S. Rao Kosaraju, H. M. Yamada
    String Adjunct Grammars: I. Local and Distributed Adjunction [Citation Graph (0, 0)][DBLP]
    Information and Control, 1972, v:21, n:2, pp:93-116 [Journal]
  57. S. Rao Kosaraju
    Probabilistic Automata-A Problem of Paz [Citation Graph (0, 0)][DBLP]
    Information and Control, 1973, v:23, n:1, pp:97-104 [Journal]
  58. S. Rao Kosaraju
    A Note on Probabilistic Input-Output Relations [Citation Graph (0, 0)][DBLP]
    Information and Control, 1974, v:26, n:2, pp:194-197 [Journal]
  59. Mikhail J. Atallah, Greg N. Frederickson, S. Rao Kosaraju
    Sorting with Efficient Use of Special-Purpose Sorters. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:1, pp:13-15 [Journal]
  60. Mikhail J. Atallah, S. Rao Kosaraju
    An Adversary-Based Lower Bound for Sorting. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:2, pp:55-57 [Journal]
  61. Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju
    Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:6, pp:1049-1088 [Journal]
  62. Mikhail J. Atallah, S. Rao Kosaraju
    Graph Problems on a Mesh-Connected Processor Array. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:3, pp:649-667 [Journal]
  63. Brenda S. Baker, S. Rao Kosaraju
    A Comparison of Multilevel break and next Statements. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1979, v:26, n:3, pp:555-566 [Journal]
  64. Paul B. Callahan, S. Rao Kosaraju
    A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:1, pp:67-90 [Journal]
  65. Michael T. Goodrich, S. Rao Kosaraju
    Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:2, pp:331-361 [Journal]
  66. S. Rao Kosaraju, Mikhail J. Atallah
    Optimal simulations between mesh-connected arrays of processors. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:3, pp:635-650 [Journal]
  67. Mikhail J. Atallah, S. Rao Kosaraju
    An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:3, pp:394-413 [Journal]
  68. S. Rao Kosaraju, Alejandro A. Schäffer, Leslie G. Biesecker
    Approximation Algorithms for a Genetic Diagnostics Problem. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1998, v:5, n:1, pp:9-26 [Journal]
  69. Paul F. Dietz, S. Rao Kosaraju
    Recognition of Topological Equivalence of Patterns by Array Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:20, n:1, pp:111-116 [Journal]
  70. Vitit Kantabutra, S. Rao Kosaraju
    New Algorithms for Multilink Robot Arms. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:32, n:1, pp:136-153 [Journal]
  71. S. Rao Kosaraju
    1-Way Stack Automaton with Jumps. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1974, v:9, n:2, pp:164-176 [Journal]
  72. S. Rao Kosaraju
    Analysis of Structured Programs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1974, v:9, n:3, pp:232-255 [Journal]
  73. David G. Heath, Simon Kasif, S. Rao Kosaraju, Steven Salzberg, Gregory F. Sullivan
    Learning nested concept classes with limited storage. [Citation Graph (0, 0)][DBLP]
    J. Exp. Theor. Artif. Intell., 1996, v:8, n:2, pp:129-147 [Journal]
  74. S. Rao Kosaraju
    Context-free Preserving Functions. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1975, v:9, n:3, pp:193-197 [Journal]
  75. Mikhail J. Atallah, S. Rao Kosaraju
    Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:5, pp:849-869 [Journal]
  76. Arthur L. Delcher, S. Rao Kosaraju
    An NC Algorithm for Evaluating Monotone Planar Circuits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:369-375 [Journal]
  77. S. Rao Kosaraju
    Speed of Recognition of Context-Free Languages by Array Automata. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1975, v:4, n:3, pp:331-340 [Journal]
  78. S. Rao Kosaraju, Giovanni Manzini
    Compression of Low Entropy Strings with Lempel-Ziv Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:893-911 [Journal]

  79. Computing external farthest neighbors for a simple polygon. [Citation Graph (, )][DBLP]


Search in 0.023secs, Finished in 0.025secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002