| 2002 |
|---|
| 22 | Optimizing area and aspect ration in straight-line orthogonal tree drawings. Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia. Comput. Geom. (23): 153-162 (2002). Web SearchBibTeXDownload |
| 1997 |
|---|
| 21 | Emerging opportunities for theoretical computer science. Alfred V. Aho, David S. Johnson, Richard M. Karp, S. Rao Kosaraju, Catherine C. McGeoch, Christos H. Papadimitriou, Pavel A. Pevzner. SIGACT News (28): 65-74 (1997). Web SearchBibTeXDownload |
| 1996 |
|---|
| 20 | Optimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings. Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, Roberto Tamassia. Graph Drawing 1996, 63-75. Web SearchBibTeXDownload |
| 19 | Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation. Michael T. Goodrich, S. Rao Kosaraju. J. ACM (43): 331-361 (1996). Web SearchBibTeXDownload |
| 18 | Learning nested concept classes with limited storage. David G. Heath, Simon Kasif, S. Rao Kosaraju, Steven Salzberg, Gregory F. Sullivan. J. Exp. Theor. Artif. Intell. (8): 129-147 (1996). Cited by 6Web SearchBibTeXDownload |
| 1994 |
|---|
| 17 | Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju. J. ACM (41): 1049-1088 (1994). Web SearchBibTeXDownload |
| 1992 |
|---|
| 16 | An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix. Mikhail J. Atallah, S. Rao Kosaraju. J. Algorithms (13): 394-413 (1992). Web SearchBibTeXDownload |
| 1991 |
|---|
| 15 | Computing external farthest neighbors for a simple polygon. Pankaj K. Agarwal, Alok Aggarwal, Boris Aronov, S. Rao Kosaraju, Baruch Schieber, Subhash Suri. Discrete Applied Mathematics (31): 97-111 (1991). Web SearchBibTeXDownload |
| 14 | Learning Nested Concept Classes with Limited Storage. David G. Heath, Simon Kasif, S. Rao Kosaraju, Steven Salzberg, Gregory F. Sullivan. IJCAI 1991, 777-782. Web SearchBibTeX |
| 13 | An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix. Mikhail J. Atallah, S. Rao Kosaraju. SODA 1991, 394-403. Web SearchBibTeXDownload |
| 1989 |
|---|
| 12 | An Efficient Algorithm for Maxdominance, with Applications. Mikhail J. Atallah, S. Rao Kosaraju. Algorithmica (4): 221-236 (1989). Web SearchBibTeXDownload |
| 11 | Sorting on a Parallel Pointer Machine with Applications to Set Expression Evaluation (Preliminary Version). Michael T. Goodrich, S. Rao Kosaraju. FOCS 1989, 190-195. Web SearchBibTeXDownload |
| 10 | Constructing Trees in Parallel. Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng. SPAA 1989, 421-431. Web SearchBibTeXDownload |
| 1988 |
|---|
| 9 | Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju. AWOC 1988, 1-10. Web SearchBibTeXDownload |
| 8 | Sorting with Efficient Use of Special-Purpose Sorters. Mikhail J. Atallah, Greg N. Frederickson, S. Rao Kosaraju. Inf. Process. Lett. (27): 13-15 (1988). Web SearchBibTeXDownload |
| 7 | Optimal simulations between mesh-connected arrays of processors. S. Rao Kosaraju, Mikhail J. Atallah. J. ACM (35): 635-650 (1988). Web SearchBibTeXDownload |
| 6 | Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel. Mikhail J. Atallah, S. Rao Kosaraju. SIAM J. Comput. (17): 849-869 (1988). Web SearchBibTeXDownload |
| 1986 |
|---|
| 5 | Optimal Simulations between Mesh-Connected Arrays of Processors (Preliminary Version). S. Rao Kosaraju, Mikhail J. Atallah. STOC 1986, 264-272. Web SearchBibTeXDownload |
| 1985 |
|---|
| 4 | A Generalized Dictionary Machine for VLSI. Mikhail J. Atallah, S. Rao Kosaraju. IEEE Trans. Computers (34): 151-155 (1985). Web SearchBibTeXDownload |
| 1984 |
|---|
| 3 | Graph Problems on a Mesh-Connected Processor Array. Mikhail J. Atallah, S. Rao Kosaraju. J. ACM (31): 649-667 (1984). Web SearchBibTeXDownload |
| 1982 |
|---|
| 2 | Graph Problems on a Mesh-Connected Processor Array (Preliminary Version). Mikhail J. Atallah, S. Rao Kosaraju. STOC 1982, 345-353. Web SearchBibTeXDownload |
| 1981 |
|---|
| 1 | An Adversary-Based Lower Bound for Sorting. Mikhail J. Atallah, S. Rao Kosaraju. Inf. Process. Lett. (13): 55-57 (1981). Web SearchBibTeXDownload |
