Vijaya Ramachandran
Professor
Vijaya Ramachandran is the William Blakemore II Regents Professor In Computer Science. Her research interests are in theoretical computer science in the areas of algorithm design and analysis, data structures, graph theory and algorithms, and parallel computation. She received her Ph.D. from Princeton University.
Research
Research Areas:
Research Interests:
- Algorithm design and analysis
- Data structures
- Graph theory and algorithms
- Parallel and distributed algorithms
- Effective models for computation
Select Publications
. 2018. A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ (n 3/2) Rounds. ACM Symposium on Priciples of Distributed Computing (PODC).
. 2018. Fine-Grained Complexity for Sparse Graphs. ACM Symposium on Theory of Computing (STOC).
. 2018. Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs. ACM Transactions on Algorithms (TALG).
. 2017. Resource Oblivious Sorting on Multicores. ACM Transactions on Parallel Computing (TOPC).
. 2002. An Optimal Minimum Spanning Tree Algorithm. Journal of the ACM.
Contact Info
Vijaya Ramachandran
Professor, William Blakemore II Regents Professorship In Computer Sciences
(512) 471-9554
GDC 4.430