default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Rao Kosaraju
Person information
- affiliation: Johns Hopkins University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[c50]Ankur Bhargava, S. Rao Kosaraju:
Derandomization of Dimensionality Reduction and SDP Based Algorithms. WADS 2005: 396-408- 2004
- [c49]Ankur Bhargava, S. Rao Kosaraju:
An Algorithm for Computing DNA Walks. ESA 2004: 110-121 - 2002
- [j35]Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia:
Optimizing area and aspect ration in straight-line orthogonal tree drawings. Comput. Geom. 23(2): 153-162 (2002) - 2001
- [c48]S. Rao Kosaraju:
Balanced Suffix Trees (Invited Lecture). CPM 2001: 231 - [c47]S. Rao Kosaraju:
Mesh Algorithms for Multiplication and Division. HiPC 2001: 17-23 - [c46]S. Rao Kosaraju:
Euler paths in series parallel graphs. STOC 2001: 237-240 - [e3]S. Rao Kosaraju:
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA. ACM/SIAM 2001, ISBN 0-89871-490-7 [contents]
1990 – 1999
- 1999
- [j34]S. Rao Kosaraju, Giovanni Manzini
:
Compression of Low Entropy Strings with Lempel-Ziv Algorithms. SIAM J. Comput. 29(3): 893-911 (1999) - [c45]Michael R. Capalbo, S. Rao Kosaraju:
Small Universal Graphs. STOC 1999: 741-749 - [c44]S. Rao Kosaraju, Teresa M. Przytycka, Ryan S. Borgstrom:
On an Optimal Split Tree Problem. WADS 1999: 157-168 - 1998
- [j33]S. Rao Kosaraju, Alejandro A. Schäffer, Leslie G. Biesecker:
Approximation Algorithms for a Genetic Diagnostics Problem. J. Comput. Biol. 5(1): 9-26 (1998) - [c43]S. Rao Kosaraju, Mihai Pop:
De-amortization of Algorithms. COCOON 1998: 4-14 - [c42]Alok Aggarwal, S. Rao Kosaraju, Mihai Pop:
Drawing of Two-Dimensional Irregular Meshes. GD 1998: 1-14 - 1997
- [j32]Alfred V. Aho, David S. Johnson, Richard M. Karp, S. Rao Kosaraju, Catherine C. McGeoch, Christos H. Papadimitriou, Pavel A. Pevzner:
Emerging opportunities for theoretical computer science. SIGACT News 28(3): 65-74 (1997) - [c41]S. Rao Kosaraju, Giovanni Manzini:
Compression of low entropy strings with Lempel-Ziv algorithms. SEQUENCES 1997: 121- - [c40]S. Rao Kosaraju, Alejandro A. Schäffer, Leslie G. Biesecker:
Approximation Algorithms for a Genetic Diagnostics Problem. WADS 1997: 69-92 - 1996
- [j31]Michael T. Goodrich, S. Rao Kosaraju:
Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation. J. ACM 43(2): 331-361 (1996) - [j30]David G. Heath, Simon Kasif, S. Rao Kosaraju, Steven Salzberg, Gregory F. Sullivan:
Learning nested concept classes with limited storage. J. Exp. Theor. Artif. Intell. 8(2): 129-147 (1996) - [c39]Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia:
Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. GD 1996: 63-75 - [c38]S. Rao Kosaraju, Arthur L. Delcher:
Large-Scale Assembly of DNA Strings and Space-Efficient Construction of Suffix Trees (Correction). STOC 1996: 659 - 1995
- [j29]Paul B. Callahan, S. Rao Kosaraju:
A Decomposition of Multidimensional Point Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields. J. ACM 42(1): 67-90 (1995) - [j28]Arthur L. Delcher, S. Rao Kosaraju:
An NC Algorithm for Evaluating Monotone Planar Circuits. SIAM J. Comput. 24(2): 369-375 (1995) - [c37]S. Rao Kosaraju:
Faster Algorithms for the Construction of Parameterized Suffix Trees (Preliminary Version). FOCS 1995: 631-637 - [c36]S. Rao Kosaraju:
Pattern Matching in Compressed Texts. FSTTCS 1995: 349-362 - [c35]Paul B. Callahan, S. Rao Kosaraju:
Algorithms for Dynamic Closest Pair and n-Body Potential Fields. SODA 1995: 263-272 - [c34]S. Rao Kosaraju, Arthur L. Delcher:
Large-scale assembly of DNA strings and space-efficient construction of suffix trees. STOC 1995: 169-177 - 1994
- [j27]Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju:
Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. J. ACM 41(6): 1049-1088 (1994) - [c33]S. Rao Kosaraju:
Computation of Squares in a String (Preliminary Version). CPM 1994: 146-150 - [c32]S. Rao Kosaraju, James K. Park, Clifford Stein:
Long Tours and Short Superstrings (Preliminary Version). FOCS 1994: 166-177 - [c31]S. Rao Kosaraju:
An Optimal RAM Implementation of Catenable Min Double-ended Queues. SODA 1994: 195-203 - [c30]S. Rao Kosaraju:
Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version). STOC 1994: 310-316 - 1993
- [c29]Paul B. Callahan, S. Rao Kosaraju:
Faster Algorithms for Some Geometric Graph Problems in Higher Dimensions. SODA 1993: 291-300 - [c28]Ryan S. Borgstrom, S. Rao Kosaraju:
Comparison-based search in the presence of errors. STOC 1993: 130-136 - [e2]S. Rao Kosaraju, David S. Johnson, Alok Aggarwal:
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA. ACM 1993, ISBN 0-89791-591-7 [contents] - 1992
- [j26]Mikhail J. Atallah, S. Rao Kosaraju:
An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix. J. Algorithms 13(3): 394-413 (1992) - [c27]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). STOC 1992: 546-556 - [e1]S. Rao Kosaraju, Mike Fellows, Avi Wigderson, John A. Ellis:
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada. ACM 1992, ISBN 0-89791-511-9 [contents] - 1991
- [j25]Alok Aggarwal, J. Lawrence Carter, S. Rao Kosaraju:
Optimal Tradeoffs for Addition on Systolic Arrays. Algorithmica 6(1): 49-71 (1991) - [j24]Pankaj K. Agarwal, Alok Aggarwal, Boris Aronov, S. Rao Kosaraju, Baruch Schieber, Subhash Suri:
Computing external farthest neighbors for a simple polygon. Discret. Appl. Math. 31(2): 97-111 (1991) - [c26]David G. Heath, Simon Kasif, S. Rao Kosaraju, Steven Salzberg, Gregory F. Sullivan:
Learning Nested Concept Classes with Limited Storage. IJCAI 1991: 777-782 - [c25]Mikhail J. Atallah, S. Rao Kosaraju:
An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix. SODA 1991: 394-403 - 1990
- [c24]S. Rao Kosaraju, Arthur L. Delcher:
A Tree-Partitioning Technique with Applications to Expression Evaluation and Term Matching (Extended Abstract). FOCS 1990: 163-172 - [c23]S. Rao Kosaraju:
On Parallel Evaluation of Classes of Circuits. FSTTCS 1990: 232-237
1980 – 1989
- 1989
- [j23]Mikhail J. Atallah, S. Rao Kosaraju:
An Efficient Algorithm for Maxdominance, with Applications. Algorithmica 4(2): 221-236 (1989) - [c22]S. Rao Kosaraju:
Efficient Tree Pattern Matching (Preliminary Version). FOCS 1989: 178-183 - [c21]S. Rao Kosaraju:
Pipelining Computations in a Tree of Processors (Preliminary Version). FOCS 1989: 184-189 - [c20]Michael T. Goodrich, S. Rao Kosaraju:
Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation (Preliminary Version). FOCS 1989: 190-195 - [c19]Richard Beigel, S. Rao Kosaraju, Gregory F. Sullivan:
Locating Faults in a Constant Number of Parallel Testing Rounds. SPAA 1989: 189-198 - [c18]Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng:
Constructing Trees in Parallel. SPAA 1989: 421-431 - 1988
- [j22]Mikhail J. Atallah, Greg N. Frederickson, S. Rao Kosaraju:
Sorting with Efficient Use of Special-Purpose Sorters. Inf. Process. Lett. 27(1): 13-15 (1988) - [j21]S. Rao Kosaraju, Mikhail J. Atallah:
Optimal simulations between mesh-connected arrays of processors. J. ACM 35(3): 635-650 (1988) - [j20]Mikhail J. Atallah, S. Rao Kosaraju:
Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel. SIAM J. Comput. 17(5): 849-869 (1988) - [c17]Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju:
Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. AWOC 1988: 1-10 - [c16]S. Rao Kosaraju, Arthur L. Delcher:
Optimal Parallel Evaluation of Tree-Structured Computations by Raking. AWOC 1988: 101-110 - [c15]S. Rao Kosaraju, Gregory F. Sullivan:
Detecting Cycles in Dynamic Graphs in Polynomial Time (Preliminary Version). STOC 1988: 398-406 - 1986
- [j19]Vitit Kantabutra, S. Rao Kosaraju:
New Algorithms for Multilink Robot Arms. J. Comput. Syst. Sci. 32(1): 136-153 (1986) - [c14]Alok Aggarwal, S. Rao Kosaraju:
Optimal Tradeoffs for Addition on Systolic Arrays (Extended Abstract). Aegean Workshop on Computing 1986: 57-69 - [c13]S. Rao Kosaraju:
Parallel Evaluation of Division-Free Arithmetic Expressions. STOC 1986: 231-239 - [c12]S. Rao Kosaraju, Mikhail J. Atallah:
Optimal Simulations between Mesh-Connected Arrays of Processors (Preliminary Version). STOC 1986: 264-272 - 1985
- [j18]Mikhail J. Atallah, S. Rao Kosaraju:
A Generalized Dictionary Machine for VLSI. IEEE Trans. Computers 34(2): 151-155 (1985) - 1984
- [j17]Mikhail J. Atallah, S. Rao Kosaraju:
Graph Problems on a Mesh-Connected Processor Array. J. ACM 31(3): 649-667 (1984) - 1982
- [c11]S. Rao Kosaraju:
Decidability of Reachability in Vector Addition Systems (Preliminary Version). STOC 1982: 267-281 - [c10]Mikhail J. Atallah, S. Rao Kosaraju:
Graph Problems on a Mesh-Connected Processor Array (Preliminary Version). STOC 1982: 345-353 - 1981
- [j16]Mikhail J. Atallah, S. Rao Kosaraju:
An Adversary-Based Lower Bound for Sorting. Inf. Process. Lett. 13(2): 55-57 (1981) - [c9]S. Rao Kosaraju:
Localized Search in Sorted Lists. STOC 1981: 62-69 - 1980
- [j15]Paul F. Dietz, S. Rao Kosaraju:
Recognition of Topological Equivalence of Patterns by Array Automata. J. Comput. Syst. Sci. 20(1): 111-116 (1980)
1970 – 1979
- 1979
- [j14]Brenda S. Baker, S. Rao Kosaraju:
A Comparison of Multilevel break and next Statements. J. ACM 26(3): 555-566 (1979) - [c8]S. Rao Kosaraju:
On a Multidimensional Search Problem (Preliminary Version). STOC 1979: 67-73 - [c7]S. Rao Kosaraju:
Fast Parallel Processing Array Algorithms for some Graph Problems (Preliminary Version). STOC 1979: 231-236 - [c6]S. Rao Kosaraju:
Real-Time Simulation of Concatenable Double-Ended Queues by Double-Ended Queues (Preliminary Version). STOC 1979: 346-351 - 1978
- [j13]S. Rao Kosaraju:
Insertions and Deletions In One-Sided Height-Balanced Trees. Commun. ACM 21(3): 226-227 (1978) - 1977
- [j12]S. Rao Kosaraju:
On independent circuits of a digraph. J. Graph Theory 1(4): 379-382 (1977) - 1976
- [c5]S. Rao Kosaraju:
On Structuring Flowcharts (Preliminary Version). STOC 1976: 101-111 - 1975
- [j11]S. Rao Kosaraju:
Context-free Preserving Functions. Math. Syst. Theory 9(3): 193-197 (1975) - [j10]S. Rao Kosaraju:
Speed of Recognition of Context-Free Languages by Array Automata. SIAM J. Comput. 4(3): 331-340 (1975) - 1974
- [j9]S. Rao Kosaraju:
A Note on Probabilistic Input-Output Relations. Inf. Control. 26(2): 194-197 (1974) - [j8]S. Rao Kosaraju:
1-Way Stack Automaton with Jumps. J. Comput. Syst. Sci. 9(2): 164-176 (1974) - [j7]S. Rao Kosaraju:
Analysis of Structured Programs. J. Comput. Syst. Sci. 9(3): 232-255 (1974) - [j6]S. Rao Kosaraju:
Regularity preserving functions. SIGACT News 6(2): 16-17 (1974) - [j5]S. Rao Kosaraju:
Correction to "Regularity preserving functions". SIGACT News 6(3): 22 (1974) - [j4]S. Rao Kosaraju:
On Some Open Problems in the Theory of Cellular Automata. IEEE Trans. Computers 23(6): 561-565 (1974) - 1973
- [j3]S. Rao Kosaraju:
Probabilistic Automata-A Problem of Paz. Inf. Control. 23(1): 97-104 (1973) - [c4]S. Rao Kosaraju:
Limitations of Dijkstra's Semaphore Primitives and Petri Nets. SOSP 1973: 122-136 - [c3]S. Rao Kosaraju:
Analysis of Structured Programs. STOC 1973: 240-252 - 1972
- [j2]Aravind K. Joshi, S. Rao Kosaraju, H. M. Yamada:
String Adjunct Grammars: I. Local and Distributed Adjunction. Inf. Control. 21(2): 93-116 (1972) - [j1]Aravind K. Joshi, S. Rao Kosaraju, H. M. Yamada:
String Adjunct Grammars: II. Equational Representation, Null Symbols, and Linguistic Relevance. Inf. Control. 21(3): 235-260 (1972)
1960 – 1969
- 1969
- [c2]S. Rao Kosaraju:
Recognition of Context-Free and Stack Languages. SWAT 1969: 129-132 - [c1]Aravind K. Joshi, S. Rao Kosaraju, H. Yamada:
String Adjunct Grammars. SWAT 1969: 245-262
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
