Vijaya Ramachandran
Professor
Office:
GDC 4.422
Phone:
(512) 471-9554
Email:
vlr [at] cs [dot] utexas [dot] edu
Homepage:
http://www.cs.utexas.edu/~vlr/ Research:
Ramachandran's research interests are in theoretical computer science, in the area of algorithms and data structures, especially with reference to graph algorithms and parallel algorithms. A major focus of her current research is on algorithms for multicore computing.
UTCS Research Areas:
Selected Publications:
- R. Cole and V. Ramachandran, "Resource-oblivious sorting on multicores," Proc. International Colloquium of Automata, Languages and Programming (ICALP), Track A, Springer LNCS Volume 6198, pp. 226-237, 2010.
- R. A. Chowdhury, V. Ramachandran, "The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and experimental evaluation." Theory of Computing Systems, 47(1):878-919, 2010.
- R.A. Chowdhury, H. Le, V. Ramachandran, "Cache-oblivious Dynamic Programming for Bioinformatics," IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), 7(3):495-510, 2010.
- S. Pettie, V. Ramachandran, "An optimal minimum spanning tree algorithm," Journal of the ACM, 49(1):16-34, 2002.
- V. Ramachandran, J.H. Reif, "Planarity testing in parallel," Journal of Computer and Systems Sciences, 49:517-561, 1994.
Professional Activities:
- ACM Transactions on Algorithms: Associate Editor
- Past editorial board member of Journal of the ACM, SIAM Journal on Computing, Information Processing Letters and SIAM Journal on Discrete Mathematics
- Program Chair, ACM Symposium on Parallel Algorithms and Architectures (SPAA), San Malo, France, 1999.
- Program Chair, ACM-SIAM Symposium on Discrete Algorithms (SODA), Austin, TX, 1993.
- Program Co-chair, IEEE Symposium on Parallel and Distributed Processing (SPDP), Dallas, TX, 1991.
