ramachandran.jpeg

Vijaya Ramachandran

Blakemore Regents Professor of Computer Science
The University of Texas at Austin


Ph.D. Princeton University

Research Interests

My research interests are in algorithms and computational theory, primarily in the areas of graph algorithms, data structures, randomized algorithms, parallel algorithms and effective models for computation. The main focus of my current research is on designing efficient algorithms for the multicore computing environment.

You can access copies of recent papers of mine.

A complete listing of my publications is available in my vita.
[vita in Adobe pdf]

Research Opportunities

Current Graduate students: Send me email if you are interested in a CS395 independent research course with me.

Current Undergraduate students: Honors thesis projects are available in cache-efficient and multicore algorithms and other topics in data structures and algorithm design. Send me email with details on your background if you are interested in doing a thesis in these or other theoretical topics.

Prospective graduate students: Instructions and online application link can be found at the department's graduate admissions website. If you have interest in doing research with me, you are welcome to send me email detailing your background and your research interests. Note that admissions are determined by a committee.

No Summer Internships: I do not have summer internship opportunities available. I regret that I will be unable to respond personally to such requests.


Ph.D. Students and Postdoctoral Associates

Rezaul Alam Chowdhury, ``Cache-efficient Algorithms and Data Structures: Theory and Experimental Evaluation,'' Ph.D., University of Texas at Austin, August 2007.

Dan Fernholz, ``Sparse Random Graphs: Methods, Structure, and Heuristics,'' Ph.D., University of Texas at Austin, December 2007.

Ganeshkumar Ganapathy, ``Algorithms and Heuristics for Combinatorial Optimization in Phylogeny,'' Ph.D., University of Texas at Austin, August 2006.

Seth Pettie, ``On the Shortest Path and Minimum Spanning Tree Problems,'' Ph.D., University of Texas at Austin, August 2003.

Chung Keung Poon, Postdoctoral Associate, September 1995 to August 1996.

Philip D. MacKenzie , Postdoctoral Associate, September 1992 to August 1994. Co-supervised by Greg Plaxton.

Tsan-sheng Hsu , ``Graph Augmentation and Related Problems: Theory and Practice,'' Ph.D., University of Texas at Austin, December 1993.

Pierre Kelsen , ``Efficient Computation of Extremal Structures in Graphs and Hypergraphs,'' Ph.D., University of Illinois at Urbana-Champaign, Summer 1992.

Arkady Kanevsky, ``Vertex Connectivity of Graphs: Algorithms and Bounds,'' Ph.D., University of Illinois at Urbana-Champaign, Summer 1988.


Classes

FALL 2014:
CS388G: Algorithms: Techniques and Theory
CS398T

SPRING 2014: CS331H: Algorithms and Complexity (Honors)

FALL 2013:
CS388P: Parallel Algorithms
CS398T

SPRING 2013: CS378H: Algorithms and Complexity (Honors)

FALL 2012:
CS388P: Parallel Algorithms
CS398T

SPRING 2012: CS357H: Algorithms (Honors)

FALL 2011: CS388G: Algorithms: Techniques and Theory


Contact Information

Email: vlr "at" cs "dot" utexas "dot" edu
Phone:(512) 471-9554
Fax:(512) 471-8885
Office: GDC 4.422
Postal: Department of Computer Science
2317 Speedway, Stop D9500
The University of Texas at Austin
Austin, Texas 78712-1188