dblp.uni-trier.dewww.uni-trier.de

S. Rao Kosaraju Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

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

Coauthor Index

1Pankaj K. Agarwal [44]
2Alok Aggarwal [29] [44] [45] [69]
3Boris Aronov [44]
4Mikhail J. Atallah [20] [22] [24] [25] [27] [30] [31] [32] [35] [36] [37] [46] [48] [52]
5Brenda S. Baker [15]
6Richard Beigel [38]
7Ankur Bhargava [78] [79]
8Leslie G. Biesecker [67] [68]
9Ryan S. Borgstrom [50] [72]
10Paul B. Callahan [49] [51] [58] [60]
11Michael R. Capalbo [73]
12J. Lawrence Carter [45]
13Timothy M. Chan [66] [77]
14Arthur L. Delcher [34] [43] [57] [59] [65]
15Paul F. Dietz [19]
16Greg N. Frederickson [32]
17Michael T. Goodrich [35] [39] [52] [64] [66] [77]
18David G. Heath [47] [63]
19Aravind K. Joshi [1] [3] [4]
20Vitit Kantabutra [26]
21Simon Kasif [47] [63]
22Lawrence L. Larmore [37]
23Giovanni Manzini [71]
24Gary L. Miller [37]
25James K. Park [55]
26Mihai Pop [69] [70]
27Teresa M. Przytycka [72]
28Steven Salzberg (Steven L. Salzberg) [47] [63]
29Alejandro A. Schäffer [67] [68]
30Baruch Schieber [44]
31Clifford Stein [55]
32Gregory F. Sullivan [33] [38] [47] [63]
33Subhash Suri [44]
34Roberto Tamassia [66] [77]
35Shang-Hua Teng [37]
36H. Yamada [1]
37H. M. Yamada [3] [4]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)