Biblio

Export 9 results:
Sort by:
Filters: Author is Sriram V. Pemmaraju  [Clear All Filters]
2004
Heath, L. S., C. J. Ribbens, and S. V. Pemmaraju, "Processor-Efficient Sparse Matrix-Vector Multiplication", Computers and Mathematics with Applications , vol. 48, pp. pp. 589-608. , 2004.
1999
Heath, L. S., S. V. Pemmaraju, and A. Trenk, "Stack and Queue Layouts of Directed Acyclic Graphs: Part I,", SIAM Journal on Computing , vol. 28, pp. pp. 1510-1539. , 1999.
Heath, L. S., and S. V. Pemmaraju, "Stack and Queue Layouts of Directed Acyclic Graphs: Part II", SIAM Journal on Computing , vol. 28, pp. pp. 1588-1626, 1999.
1997
Heath, L. S., and S. V. Pemmaraju, "Stack and Queue Layouts of Posets,", SIAM Journal on Discrete Mathematics , vol. 10, pp. pp. 599-625. , 1997.
1995
Heath, L. S., and S. V. Pemmaraju, "Recognizing Leveled-Planar Dags in Linear Time", Proceedings of Graph Drawing '95, vol. 1027: Springer, pp. pp. 300-311. , 1995.
1994
Pemmaraju, S. V., and C. A. Shaffer, "Analysis of the worst case space complexity of a PR quadtree", Inf. Process. Lett., vol. 49, no. 5, Amsterdam, The Netherlands, The Netherlands, Elsevier North-Holland, Inc., pp. 263–267, 1994.
1993
Heath, L. S., S. V. Pemmaraju, and A. Trenk, "Stack and Queue Layouts of Directed Acyclic Graphs", Planar Graphs , Providence, Rhode Island, American Mathematical Society, pp. pp. 5-1, 1993.
1992
Pemmaraju, S. V., and C. A. Shaffer, Analysis of the Worst Case Space Complexity of a PR Quadtree, , Blacksburg, VA, USA, Virginia Polytechnic Institute && State University, 1992.