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.
