2026 Vijaya Ramachandran: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	45	7291	7080	3180	3060	188	7017

Research.com Recognitions

1989 - IEEE Fellow For contributions to theory of multivariable networks with applications to two-dimensional digital filters.

Overview

Vijaya Ramachandran is affiliated with The University of Texas at Austin in the United States. Their research contributions span multiple fields and subfields within computer science and electrical engineering.

Their main field of study is Computer Science, with publications covering various subfields such as:

Electrical and Electronic Engineering
Computational Theory and Mathematics
Computer Networks and Communications
Hardware and Architecture
Signal Processing

Ramachandran's work addresses a range of topics, including:

Advanced Optical Network Technologies
Advanced Graph Theory Research
Interconnection Networks and Systems
Parallel Computing and Optimization Techniques
Data Management and Algorithms

Their recent papers include:

Scalable Data Structures (Dagstuhl Seminar 21071), 2021, published at Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Distributed Distance Sensitivity Oracles, 2024, published on arXiv (Cornell University)

Frequent co-authors in their research collaborations are:

Vignesh Manoharan
Gerth Stølting Brodal
John Iacono
Markus E. Nebel

The primary publication venues for their work include:

Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
arXiv (Cornell University)

In recognition of their contributions to the field, Vijaya Ramachandran was named an IEEE Fellow in 1989, cited for work on the theory of multivariable networks with applications to two-dimensional digital filters.

Best Publications

Parallel algorithms for shared-memory machines

Richard M. Karp;Vijaya Ramachandran

940
Citations
An optimal minimum spanning tree algorithm

Seth Pettie;Vijaya Ramachandran

442
Citations
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms

Phillip B. Gibbons;Yossi Matias;Vijaya Ramachandran

210
Citations
Flexible Hardware Acceleration for Instruction-Grain Program Monitoring

Shimin Chen;Michael Kozuch;Theodoros Strigkos;Babak Falsafi

196
Citations
Provably good multicore cache performance for divide-and-conquer algorithms

Guy E. Blelloch;Rezaul A. Chowdhury;Phillip B. Gibbons;Vijaya Ramachandran

147
Citations
Efficient parallel evaluation of straight-line code and arithmetic circuits

Gary L. Miller;Vijaya Ramachandran;Erich Kaltofen

134
Citations
Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation?

Phillip B. Gibbons;Yossi Matias;Vijaya Ramachandran

133
Citations
Design principles of policy languages for path vector protocols

Timothy G. Griffin;Aaron D. Jaggard;Vijay Ramachandran

127
Citations
Oracles for Distances Avoiding a Failed Node or Link

Camil Demetrescu;Mikkel Thorup;Rezaul Alam Chowdhury;Vijaya Ramachandran

127
Citations
An optimal parallel algorithm for formula evaluation

S. Buss;S. Cook;A. Gupta;V. Ramachandran

123
Citations
Oblivious algorithms for multicores and networks of processors

Rezaul Alam Chowdhury;Vijaya Ramachandran;Francesco Silvestri;Brandon Blakeley

123
Citations
Oblivious algorithms for multicores and network of processors

Rezaul Alam Chowdhury;Francesco Silvestri;Brandon Blakeley;Vijaya Ramachandran

117
Citations
Finding a smallest augmentation to biconnect a graph

Tsan-Sheng Hsu;Vijaya Ramachandran

116
Citations
Cache-efficient dynamic programming algorithms for multicores

Rezaul Alam Chowdhury;Vijaya Ramachandran

112
Citations
A linear time algorithm for triconnectivity augmentation

T.-S. Hsu;V. Ramachandran

109
Citations
Cache-oblivious dynamic programming

Rezaul Alam Chowdhury;Vijaya Ramachandran

103
Citations
Can shared-memory model serve as a bridging model for parallel computation?

Phillip B. Gibbons;Yossi Matias;Vijaya Ramachandran

96
Citations
The k-orientability thresholds for Gn, p

Daniel Fernholz;Vijaya Ramachandran

95
Citations
The QRQW PRAM: accounting for contention in parallel algorithms

Phillip B. Gibbons;Yossi Matias;Vijaya Ramachandran

94
Citations
The diameter of sparse random graphs

Daniel Fernholz;Vijaya Ramachandran

94
Citations
Parallelizing dynamic information flow tracking

Olatunji Ruwase;Phillip B. Gibbons;Todd C. Mowry;Vijaya Ramachandran

91
Citations
A Shortest Path Algorithm for Real-Weighted Undirected Graphs

Seth Pettie;Vijaya Ramachandran

88
Citations

Frequent Co-Authors

Phillip B. Gibbons Carnegie Mellon University

Seth Pettie University of Michigan–Ann Arbor

Yossi Matias Google (United States)

Richard Cole New York University

Tandy Warnow University of Illinois at Urbana-Champaign

Gary L. Miller Carnegie Mellon University

Robert E. Tarjan Princeton University

Richard M. Karp University of California, Berkeley

Michael Kozuch Intel (United States)

Todd C. Mowry Carnegie Mellon University

External Links

Personal website of Vijaya Ramachandran Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens up a diverse range of online degree options and career trajectories. Many students wonder, what masters program should i do after their undergraduate studies. Fields like data science, artificial intelligence, and cybersecurity continue to be in high demand for graduate degrees.

For those just starting their higher education journey, online associate degree programs offer a flexible and cost-effective entry point. These programs can build foundational skills and often provide a pathway to further studies or entry-level roles in tech.

Budget is a concern for many students. Fortunately, the cheapest online colleges make computer science education accessible without incurring heavy debt. Flexible online options allow you to balance work, family, and learning.

Lastly, if your academic record isn’t perfect, don’t be discouraged. There are college with low gpa admission policies, giving many more students a chance to pursue a tech career. With the right program, you can transform your passion into a rewarding future.