H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 37 Citations 5,570 121 World Ranking 5386 National Ranking 2637

Research.com Recognitions

Awards & Achievements

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

Overview

What is she best known for?

The fields of study she is best known for:

  • Algorithm
  • Operating system
  • Combinatorics

Vijaya Ramachandran mainly focuses on Combinatorics, Discrete mathematics, Parallel computing, Parallel algorithm and Algorithm. The Discrete mathematics study combines topics in areas such as Shortest path problem and Degree. Her work carried out in the field of Parallel computing brings together such families of science as Sorting and Schedule.

Her Parallel algorithm study combines topics from a wide range of disciplines, such as Queue, Theory of computing and Arithmetic circuits. Her study in Algorithm is interdisciplinary in nature, drawing from both Strength of a graph, Cache-oblivious algorithm, Graph bandwidth and Cache. Her biological study spans a wide range of topics, including Queueing theory and Massively parallel.

Her most cited work include:

  • Parallel algorithms for shared-memory machines (319 citations)
  • Parallel Algorithms for Shared-Memory Machines. (281 citations)
  • An optimal minimum spanning tree algorithm (206 citations)

What are the main themes of her work throughout her whole career to date?

Her main research concerns Combinatorics, Discrete mathematics, Parallel computing, Algorithm and Parallel algorithm. She focuses mostly in the field of Discrete mathematics, narrowing it down to matters related to Graph and, in some cases, Undirected graph. Vijaya Ramachandran has researched Parallel computing in several fields, including Sorting and Work stealing.

Vijaya Ramachandran has included themes like Schedule and Graph in her Algorithm study. Her work on Ear decomposition as part of general Parallel algorithm research is frequently linked to Monotone polygon, bridging the gap between disciplines. Vijaya Ramachandran has included themes like Block and Multi-core processor in her Cache study.

She most often published in these fields:

  • Combinatorics (38.95%)
  • Discrete mathematics (28.49%)
  • Parallel computing (27.91%)

What were the highlights of her more recent work (between 2010-2020)?

  • Combinatorics (38.95%)
  • Shortest path problem (13.37%)
  • Directed graph (10.47%)

In recent papers she was focusing on the following fields of study:

Vijaya Ramachandran mainly investigates Combinatorics, Shortest path problem, Directed graph, Cache and Parallel computing. Her research in Combinatorics intersects with topics in Distributed algorithm and Discrete mathematics. Her work focuses on many connections between Discrete mathematics and other disciplines, such as Floyd–Warshall algorithm, that overlap with her field of interest in Yen's algorithm.

Her Cache study combines topics in areas such as Sorting and Algorithm. Her Parallel computing research is multidisciplinary, relying on both Block, Work stealing and Integer. Her research integrates issues of Heap and Shared memory in her study of Cache-oblivious algorithm.

Between 2010 and 2020, her most popular works were:

  • Oblivious algorithms for multicores and networks of processors (40 citations)
  • Betweenness Centrality - Incremental and Faster (36 citations)
  • Designing and Developing S100P Inhibitor 5-Methyl Cromolyn for Pancreatic Cancer Therapy (31 citations)

In her most recent research, the most cited papers focused on:

  • Algorithm
  • Operating system
  • Combinatorics

The scientist’s investigation covers issues in Cache, Parallel computing, False sharing, Algorithm and List ranking. Her Cache research incorporates themes from Vertex, Bounded function, Incremental algorithm and Dense graph. Her Parallel computing study frequently draws connections to adjacent fields such as Sorting.

Her Algorithm research includes elements of Schedule, Graph analytics and Block. Her work in List ranking addresses issues such as Connected component, which are connected to fields such as Multi-core processor. Her Cache-oblivious algorithm study integrates concerns from other disciplines, such as Cache pollution, Smart Cache and Shared memory.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Top Publications

Parallel algorithms for shared-memory machines

Richard M. Karp;Vijaya Ramachandran.
Handbook of theoretical computer science (vol. A) (1991)

502 Citations

An optimal minimum spanning tree algorithm

Seth Pettie;Vijaya Ramachandran.
Journal of the ACM (2002)

366 Citations

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

Phillip B. Gibbons;Yossi Matias;Vijaya Ramachandran.
SIAM Journal on Computing (1999)

201 Citations

Flexible Hardware Acceleration for Instruction-Grain Program Monitoring

Shimin Chen;Michael Kozuch;Theodoros Strigkos;Babak Falsafi.
international symposium on computer architecture (2008)

178 Citations

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

Guy E. Blelloch;Rezaul A. Chowdhury;Phillip B. Gibbons;Vijaya Ramachandran.
symposium on discrete algorithms (2008)

143 Citations

Efficient parallel evaluation of straight-line code and arithmetic circuits

Gary L. Miller;Vijaya Ramachandran;Erich Kaltofen.
SIAM Journal on Computing (1988)

134 Citations

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

Phillip B. Gibbons;Yossi Matias;Vijaya Ramachandran.
Theory of Computing Systems / Mathematical Systems Theory (1999)

130 Citations

An optimal parallel algorithm for formula evaluation

S. Buss;S. Cook;A. Gupta;V. Ramachandran.
SIAM Journal on Computing (1992)

120 Citations

Finding a smallest augmentation to biconnect a graph

Tsan-Sheng Hsu;Vijaya Ramachandran.
SIAM Journal on Computing (1993)

116 Citations

Oblivious algorithms for multicores and networks of processors

Rezaul Alam Chowdhury;Vijaya Ramachandran;Francesco Silvestri;Brandon Blakeley.
Journal of Parallel and Distributed Computing (2013)

114 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Vijaya Ramachandran

Guy E. Blelloch

Guy E. Blelloch

Carnegie Mellon University

Publications: 47

Phillip B. Gibbons

Phillip B. Gibbons

Carnegie Mellon University

Publications: 30

Uzi Vishkin

Uzi Vishkin

University of Maryland, College Park

Publications: 29

Seth Pettie

Seth Pettie

University of Michigan–Ann Arbor

Publications: 18

David A. Bader

David A. Bader

New Jersey Institute of Technology

Publications: 17

Yossi Matias

Yossi Matias

Google (United States)

Publications: 15

Sun-Yuan Hsieh

Sun-Yuan Hsieh

National Cheng Kung University

Publications: 14

Michael T. Goodrich

Michael T. Goodrich

University of California, Irvine

Publications: 14

Michael A. Bender

Michael A. Bender

Stony Brook University

Publications: 13

Eric Allender

Eric Allender

Rutgers, The State University of New Jersey

Publications: 13

Samir Khuller

Samir Khuller

Northwestern University

Publications: 13

Uri Zwick

Uri Zwick

Tel Aviv University

Publications: 12

Remco van der Hofstad

Remco van der Hofstad

Eindhoven University of Technology

Publications: 12

Ming-Yang Kao

Ming-Yang Kao

Northwestern University

Publications: 12

Robert E. Tarjan

Robert E. Tarjan

Princeton University

Publications: 11

Something went wrong. Please try again later.