Vijaya Ramachandran

ORCID

Publication Activity (10 Years)

Years Active: 1982-2024
Publications (10 Years): 27

Top Venues

Publications

Vignesh Manoharan, Vijaya Ramachandran
Computing Minimum Weight Cycle in the CONGEST Model. PODC (2024)
Vignesh Manoharan, Vijaya Ramachandran
Computing Replacement Paths in the CONGEST Model. SIROCCO (2024)
Vignesh Manoharan, Vijaya Ramachandran
Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model. CoRR (2023)
Gerth Stølting Brodal, John Iacono, László Kozma, Vijaya Ramachandran, Justin Dallant
Scalable Data Structures (Dagstuhl Seminar 23211). Dagstuhl Reports 13 (5) (2023)
Vignesh Manoharan, Vijaya Ramachandran
Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model. CoRR (2022)
Vignesh Manoharan, Vijaya Ramachandran
Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model. PODC (2022)
Vijaya Ramachandran, Elaine Shi
Data Oblivious Algorithms for Multicores. SPAA (2021)
Gerth Stølting Brodal, John Iacono, Markus E. Nebel, Vijaya Ramachandran
Scalable Data Structures (Dagstuhl Seminar 21071). Dagstuhl Reports 11 (1) (2021)
Vijaya Ramachandran, Elaine Shi
Data Oblivious Algorithms for Multicores. IACR Cryptol. ePrint Arch. 2020 (2020)
Udit Agarwal, Vijaya Ramachandran
Faster Deterministic All Pairs Shortest Paths in Congest Model. CoRR (2020)
Udit Agarwal, Vijaya Ramachandran
Faster Deterministic All Pairs Shortest Paths in Congest Model. SPAA (2020)
Vijaya Ramachandran, Elaine Shi
Data Oblivious Algorithms for Multicores. CoRR (2020)
Udit Agarwal, Vijaya Ramachandran
Distributed Weighted All Pairs Shortest Paths Through Pipelining. IPDPS (2019)
Loc Hoang, Matteo Pontecorvi, Roshan Dathathri, Gurbinder Gill, Bozhi You, Keshav Pingali, Vijaya Ramachandran
A round-efficient distributed betweenness centrality algorithm. PPoPP (2019)
Rezaul Alam Chowdhury, Vijaya Ramachandran
Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs. ACM Trans. Algorithms 14 (1) (2018)
Matteo Pontecorvi, Vijaya Ramachandran
Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths. CoRR (2018)
Udit Agarwal, Vijaya Ramachandran
A Faster Deterministic Distributed Algorithm for Weighted APSP Through Pipelining. CoRR (2018)
Udit Agarwal, Vijaya Ramachandran
New and Simplified Distributed Algorithms for Weighted All Pairs Shortest Paths. CoRR (2018)
Udit Agarwal, Vijaya Ramachandran
Fine-grained complexity for sparse graphs. STOC (2018)
Valentin Polischchuk, Vijaya Ramachandran, Rezaul Alam Chowdhury
Editorial: ALENEX 2017 Special Issue. ACM J. Exp. Algorithmics 23 (2018)
Udit Agarwal, Vijaya Ramachandran, Valerie King, Matteo Pontecorvi
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds. PODC (2018)
Udit Agarwal, Vijaya Ramachandran, Valerie King, Matteo Pontecorvi
) Rounds. CoRR (2018)
Richard Cole, Vijaya Ramachandran
Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers: Extended Abstract. SPAA (2017)
Richard Cole, Vijaya Ramachandran
Resource Oblivious Sorting on Multicores. ACM Trans. Parallel Comput. 3 (4) (2017)
Richard Cole, Vijaya Ramachandran
Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers. CoRR (2017)
Udit Agarwal, Vijaya Ramachandran
Finding k Simple Shortest Paths and Cycles. ISAAC (2016)
Udit Agarwal, Vijaya Ramachandran
Fine-Grained Complexity and Conditional Hardness for Sparse Graphs. CoRR (2016)
Matteo Pontecorvi, Vijaya Ramachandran
Fully Dynamic Betweenness Centrality. ISAAC (2015)
Richard Cole, Vijaya Ramachandran
Resource Oblivious Sorting on Multicores. CoRR (2015)
Udit Agarwal, Vijaya Ramachandran
Finding $k$ Simple Shortest Paths and Cycles. CoRR (2015)
Matteo Pontecorvi, Vijaya Ramachandran
A Faster Algorithm for Fully Dynamic Betweenness Centrality. CoRR (2015)
Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality. CoRR (2014)
Matteo Pontecorvi, Vijaya Ramachandran
Fully Dynamic All Pairs All Shortest Paths. CoRR (2014)
Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality. ISAAC (2014)
Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
Betweenness Centrality - Incremental and Faster. MFCS (2) (2014)
Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
Betweenness Centrality - Incremental and Faster. CoRR (2013)
Richard Cole, Vijaya Ramachandran
Analysis of Randomized Work Stealing with False Sharing. IPDPS (2013)
Rezaul Alam Chowdhury, Vijaya Ramachandran, Francesco Silvestri, Brandon Blakeley
Oblivious algorithms for multicores and networks of processors. J. Parallel Distributed Comput. 73 (7) (2013)
Anil Kumar Katti, Vijaya Ramachandran
Competitive Cache Replacement Strategies for Shared Cache Environments. IPDPS (2012)
Faith Ellen, Vijaya Ramachandran, Philipp Woelfel
Efficient Fetch-and-Increment. DISC (2012)
Richard Cole, Vijaya Ramachandran
Revisiting the Cache Miss Analysis of Multithreaded Algorithms. LATIN (2012)
Richard Cole, Vijaya Ramachandran
Efficient Resource Oblivious Algorithms for Multicores with False Sharing. IPDPS (2012)
Richard Cole, Vijaya Ramachandran
Analysis of Randomized Work Stealing with False Sharing CoRR (2011)
Richard Cole, Vijaya Ramachandran
Efficient Resource Oblivious Algorithms for Multicores CoRR (2011)
Rezaul Alam Chowdhury, Francesco Silvestri, Brandon Blakeley, Vijaya Ramachandran
Oblivious algorithms for multicores and network of processors. IPDPS (2010)
Phong Chuong, Faith Ellen, Vijaya Ramachandran
A universal construction for wait-free transaction friendly data structures. SPAA (2010)
Rezaul Alam Chowdhury, Vijaya Ramachandran
The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation. Theory Comput. Syst. 47 (4) (2010)
Rezaul Alam Chowdhury, Hai-Son Le, Vijaya Ramachandran
Cache-Oblivious Dynamic Programming for Bioinformatics. IEEE ACM Trans. Comput. Biol. Bioinform. 7 (3) (2010)
Richard Cole, Vijaya Ramachandran
Resource Oblivious Sorting on Multicores. ICALP (1) (2010)
Shimin Chen, Michael Kozuch, Phillip B. Gibbons, Michael P. Ryan, Theodoros Strigkos, Todd C. Mowry, Olatunji Ruwase, Evangelos Vlachos, Babak Falsafi, Vijaya Ramachandran
Flexible Hardware Acceleration for Instruction-Grain Lifeguards. IEEE Micro 29 (1) (2009)
Olatunji Ruwase, Phillip B. Gibbons, Todd C. Mowry, Vijaya Ramachandran, Shimin Chen, Michael Kozuch, Michael P. Ryan
Parallelizing dynamic information flow tracking. SPAA (2008)
Guy E. Blelloch, Rezaul Alam Chowdhury, Phillip B. Gibbons, Vijaya Ramachandran, Shimin Chen, Michael Kozuch
Provably good multicore cache performance for divide-and-conquer algorithms. SODA (2008)
Shimin Chen, Michael Kozuch, Theodoros Strigkos, Babak Falsafi, Phillip B. Gibbons, Todd C. Mowry, Vijaya Ramachandran, Olatunji Ruwase, Michael P. Ryan, Evangelos Vlachos
Flexible Hardware Acceleration for Instruction-Grain Program Monitoring. ISCA (2008)
Camil Demetrescu, Mikkel Thorup, Rezaul Alam Chowdhury, Vijaya Ramachandran
Oracles for Distances Avoiding a Failed Node or Link. SIAM J. Comput. 37 (5) (2008)
Seth Pettie, Vijaya Ramachandran
Randomized minimum spanning tree algorithms using exponentially fewer random bits. ACM Trans. Algorithms 4 (1) (2008)
Rezaul Alam Chowdhury, Vijaya Ramachandran
Cache-efficient dynamic programming algorithms for multicores. SPAA (2008)
Vijaya Ramachandran
Cache-Oblivious Computation: Algorithms and Experimental Evaluation. ICCTA (2007)
Daniel Fernholz, Vijaya Ramachandran
The diameter of sparse random graphs. Random Struct. Algorithms 31 (4) (2007)
Daniel Fernholz, Vijaya Ramachandran
. SODA (2007)
Rezaul Alam Chowdhury, Vijaya Ramachandran
The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation. SPAA (2007)
Rezaul Alam Chowdhury, Vijaya Ramachandran
The cache-oblivious gaussian elimination paradigm: theoretical framework and experimental evaluation. SPAA (2006)
Ganeshkumar Ganapathy, Barbara Goodson, Robert K. Jansen, Hai-Son Le, Vijaya Ramachandran, Tandy J. Warnow
Pattern Identification in Biogeography. IEEE ACM Trans. Comput. Biol. Bioinform. 3 (4) (2006)
Rezaul Alam Chowdhury, Vijaya Ramachandran
Cache-oblivious dynamic programming. SODA (2006)
Rezaul Alam Chowdhury, Vijaya Ramachandran
External-memory exact and approximate all-pairs shortest-paths in undirected graphs. SODA (2005)
Seth Pettie, Vijaya Ramachandran
A Shortest Path Algorithm for Real-Weighted Undirected Graphs. SIAM J. Comput. 34 (6) (2005)
Ganeshkumar Ganapathy, Barbara Goodson, Robert K. Jansen, Vijaya Ramachandran, Tandy J. Warnow
Pattern Identification in Biogeography. WABI (2005)
Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy J. Warnow
On contract-and-refine transformations between phylogenetic trees. SODA (2004)
Rezaul Alam Chowdhury, Vijaya Ramachandran
Cache-oblivious shortest paths in graphs using buffer heap. SPAA (2004)
Amit Prakash, Adnan Aziz, Vijaya Ramachandran
Randomized Parallel Schedulers for Switch-Memory-Switch Routers: Analysis and Numerical Studies. INFOCOM (2004)
Vijaya Ramachandran, Brian Grayson, Michael Dahlin
Emulations between QSM, BSP and LogP: a framework for general-purpose parallel algorithm design. J. Parallel Distributed Comput. 63 (12) (2003)
Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy J. Warnow
Better Hill-Climbing Searches for Parsimony. WABI (2003)
Adnan Aziz, Amit Prakash, Vijaya Ramachandran
A near optimal scheduler for switch-memory-switch routers. SPAA (2003)
Seth Pettie, Vijaya Ramachandran
An optimal minimum spanning tree algorithm. J. ACM 49 (1) (2002)
Xiaoyu Zhang, Chandrajit Bajaj, Vijaya Ramachandran
Parallel and Out-of-core View-dependent Isocontour Visualization Using Random Data Distribution. VisSym (2002)
Seth Pettie, Vijaya Ramachandran, Srinath Sridhar
Experimental Evaluation of a New Shortest Path Algorithm. ALENEX (2002)
Seth Pettie, Vijaya Ramachandran
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms. SODA (2002)
Seth Pettie, Vijaya Ramachandran
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest. SIAM J. Comput. 31 (6) (2002)
Rezaul Alam Chowdhury, Vijaya Ramachandran
Improved Distance Oracles for Avoiding Link-Failure. ISAAC (2002)
Vijaya Ramachandran, Ramesh K. Sitaraman
SPAA 1999 - Guest Editors' Foreword. Theory Comput. Syst. 35 (2) (2002)
Seth Pettie, Vijaya Ramachandran
Computing shortest paths with comparisons and additions. SODA (2002)
Madhukar R. Korupolu, Vijaya Ramachandran
Quasi-Fully Dynamic Algorithms for Two-Connectivity and Cycle Equivalence. Algorithmica 33 (2) (2002)
Vijaya Ramachandran
Parallel Algorithm Design with Coarse-Grained Synchronization. International Conference on Computational Science (2) (2001)
Seth Pettie, Vijaya Ramachandran
An Optimal Minimum Spanning Tree Algorithm. ICALP (2000)
Brian Grayson, Michael Dahlin, Vijaya Ramachandran
Experimental Evaluation of QSM, a Simple Shared-Memory Model. IPPS/SPDP (1999)
Vijaya Ramachandran, Brian Grayson, Michael Dahlin
Emulations Between QSM, BSP, and LogP: A Framework for General-Purpose Parallel Algorithm Design. SODA (1999)
Seth Pettie, Vijaya Ramachandran
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest. RANDOM-APPROX (1999)
Micah Adler, Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
Modeling Parallel Bandwidth: Local versus Global Restrictions. Algorithmica 24 (3-4) (1999)
Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation? Theory Comput. Syst. 32 (3) (1999)
Philip D. MacKenzie, Vijaya Ramachandran
ERCW PRAMs and Optical Communication. Theor. Comput. Sci. 196 (1-2) (1998)
Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms. SIAM J. Comput. 28 (2) (1998)
Philip D. MacKenzie, Vijaya Ramachandran
Computational Bounds for Fundamental Problems on General-Purpose Parallel Models. SPAA (1998)
Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
The Queue-Read Queue-Write Asynchronous PRAM Model. Theor. Comput. Sci. 196 (1-2) (1998)
Madhukar R. Korupolu, Vijaya Ramachandran
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems. ESA (1997)
Micah Adler, Phillip B. Gibbons, Vijaya Ramachandran, Yossi Matias
Modeling Parallel Bandwidth: Local vs. Global Restrictions. SPAA (1997)
Valerie King, Chung Keung Poon, Vijaya Ramachandran, Santanu Sinha
An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification. Inf. Process. Lett. 62 (3) (1997)
Vijaya Ramachandran
QSM: A General Purpose Shared-Memory Model for Parallel Computation. FSTTCS (1997)
Vijaya Ramachandran, Honghua Yang
An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem. Algorithmica 18 (3) (1997)
Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
Can Shared-Memory Model Serve as a Bridging Model for Parallel Computation? SPAA (1997)
Chung Keung Poon, Vijaya Ramachandran
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest. ISAAC (1997)
Vijaya Ramachandran
Parallel Algorithms for Reducible Flow Graphs. J. Algorithms 23 (1) (1997)

Vijaya Ramachandran.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Vijaya Ramachandran