Skip to content

Vijaya Ramachandran

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

63

Venues

19

Active years

1982–2025

Best venue rank

A*

Where they publish

Papers

63 indexed papers, newest first.

YearVenueTitleAuthors
2025SPAABrief Announcement: Algorithms for Distance Sensitivity Oracles on the PRAM.Vignesh Manoharan, Vijaya Ramachandran
2025SIROCCODistributed Distance Sensitivity Oracles.Vignesh Manoharan, Vijaya Ramachandran
2024PODCComputing Minimum Weight Cycle in the CONGEST Model.Vignesh Manoharan, Vijaya Ramachandran
2024SIROCCOComputing Replacement Paths in the CONGEST Model.Vignesh Manoharan, Vijaya Ramachandran
2022PODCBrief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model.Vignesh Manoharan, Vijaya Ramachandran
2021SPAAData Oblivious Algorithms for Multicores.Vijaya Ramachandran, Elaine Shi
2020SPAAFaster Deterministic All Pairs Shortest Paths in Congest Model.Udit Agarwal, Vijaya Ramachandran
2019PPoPPA round-efficient distributed betweenness centrality algorithm.Loc Hoang, Matteo Pontecorvi, Roshan Dathathri, Gurbinder Gill, Bozhi You, Keshav Pingali, Vijaya Ramachandran
2018PODCA Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in (n 3/2 ) Rounds.Udit Agarwal, Vijaya Ramachandran, Valerie King, Matteo Pontecorvi
2018STOCFine-grained complexity for sparse graphs.Udit Agarwal, Vijaya Ramachandran
2017SPAABounding Cache Miss Costs of Multithreaded Computations Under General Schedulers: Extended Abstract.Richard Cole, Vijaya Ramachandran
2016ISAACFinding k Simple Shortest Paths and Cycles.Udit Agarwal, Vijaya Ramachandran
2015ISAACFully Dynamic Betweenness Centrality.Matteo Pontecorvi, Vijaya Ramachandran
2014ISAACDecremental All-Pairs ALL Shortest Paths and Betweenness Centrality.Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
2014MFCSBetweenness Centrality - Incremental and Faster.Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
2012LATINRevisiting the Cache Miss Analysis of Multithreaded Algorithms.Richard Cole, Vijaya Ramachandran
2010ICALPResource Oblivious Sorting on Multicores.Richard Cole, Vijaya Ramachandran
2010SPAAA universal construction for wait-free transaction friendly data structures.Phong Chuong, Faith Ellen, Vijaya Ramachandran
2008ISCAFlexible Hardware Acceleration for Instruction-Grain Program Monitoring.Shimin Chen, Michael Kozuch, Theodoros Strigkos, Babak Falsafi, Phillip B. Gibbons, Todd C. Mowry, Vijaya Ramachandran, Olatunji Ruwase, Michael P. Ryan, Evangelos Vlachos
2008SODAProvably good multicore cache performance for divide-and-conquer algorithms.Guy E. Blelloch, Rezaul Alam Chowdhury, Phillip B. Gibbons, Vijaya Ramachandran, Shimin Chen, Michael Kozuch
2008SPAACache-efficient dynamic programming algorithms for multicores.Rezaul Alam Chowdhury, Vijaya Ramachandran
2008SPAAParallelizing dynamic information flow tracking.Olatunji Ruwase, Phillip B. Gibbons, Todd C. Mowry, Vijaya Ramachandran, Shimin Chen, Michael Kozuch, Michael P. Ryan
2007SODATheDaniel Fernholz, Vijaya Ramachandran
2007SPAAThe cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation.Rezaul Alam Chowdhury, Vijaya Ramachandran
2006SODACache-oblivious dynamic programming.Rezaul Alam Chowdhury, Vijaya Ramachandran
2006SPAAThe cache-oblivious gaussian elimination paradigm: theoretical framework and experimental evaluation.Rezaul Alam Chowdhury, Vijaya Ramachandran
2005SODAExternal-memory exact and approximate all-pairs shortest-paths in undirected graphs.Rezaul Alam Chowdhury, Vijaya Ramachandran
2005WABIPattern Identification in Biogeography.Ganeshkumar Ganapathy, Barbara Goodson, Robert K. Jansen, Vijaya Ramachandran, Tandy J. Warnow
2004INFOCOMRandomized Parallel Schedulers for Switch-Memory-Switch Routers: Analysis and Numerical Studies.Amit Prakash, Adnan Aziz, Vijaya Ramachandran
2004SODAOn contract-and-refine transformations between phylogenetic trees.Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy J. Warnow
2004SPAACache-oblivious shortest paths in graphs using buffer heap.Rezaul Alam Chowdhury, Vijaya Ramachandran
2003SPAAA near optimal scheduler for switch-memory-switch routers.Adnan Aziz, Amit Prakash, Vijaya Ramachandran
2003WABIBetter Hill-Climbing Searches for Parsimony.Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy J. Warnow
2002ALENEXExperimental Evaluation of a New Shortest Path Algorithm.Seth Pettie, Vijaya Ramachandran, Srinath Sridhar
2002ISAACImproved Distance Oracles for Avoiding Link-Failure.Rezaul Alam Chowdhury, Vijaya Ramachandran
2002SODAComputing shortest paths with comparisons and additions.Seth Pettie, Vijaya Ramachandran
2002SODAMinimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms.Seth Pettie, Vijaya Ramachandran
2001ICCSParallel Algorithm Design with Coarse-Grained Synchronization.Vijaya Ramachandran
2000ICALPAn Optimal Minimum Spanning Tree Algorithm.Seth Pettie, Vijaya Ramachandran
1999SODAEmulations Between QSM, BSP, and LogP: A Framework for General-Purpose Parallel Algorithm Design.Vijaya Ramachandran, Brian Grayson, Michael Dahlin
1998SPAAComputational Bounds for Fundamental Problems on General-Purpose Parallel Models.Philip D. MacKenzie, Vijaya Ramachandran
1997ESAQuasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems.Madhukar R. Korupolu, Vijaya Ramachandran
1997ISAACA Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest.Chung Keung Poon, Vijaya Ramachandran
1997SPAAModeling Parallel Bandwidth: Local vs. Global Restrictions.Micah Adler, Phillip B. Gibbons, Vijaya Ramachandran, Yossi Matias
1997SPAACan Shared-Memory Model Serve as a Bridging Model for Parallel Computation?Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
1996EuroParThe Queue-Read Queue-Write Asynchronous PRAM Model.Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
1996EuroParERCW PRAMs and Optical Communication.Philip D. MacKenzie, Vijaya Ramachandran
1996PODCAsynchrony versus Bulk-Synchrony in QRQW PRAM model (Abstract).Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
1994SODAThe QRQW PRAM: Accounting for Contention in Parallel Algorithms.Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
1994SODAAn Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem.Vijaya Ramachandran, Honghua Yang
1994SPAAEfficient Low-Contention Parallel Algorithms.Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
1993ESAAn Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem.Vijaya Ramachandran, Honghua Yang
1992SODAComputing Minimal Spanning Subgraphs in Linear Time.Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan
1991FOCSA Linear Time Algorithm for Triconnectivity Augmentation (Extended Abstract)Tsan-sheng Hsu, Vijaya Ramachandran
1991SODAOn Finding Minimal 2-Connected Subgraphs.Pierre Kelsen, Vijaya Ramachandran
1990SPAALower Bounds for Parallel Computation on Linked Structures.Faith E. Fich, Vijaya Ramachandran
1989FOCSAn Optimal Parallel Algorithm for Graph Planarity (Extended Abstract)Vijaya Ramachandran, John H. Reif
1989ICALPFinding Triconnected Components by Local Replacements.Donald S. Fussell, Vijaya Ramachandran, Ramakrishna Thurimella
1987FOCSImproved Algorithms for Graph Four-ConnectivityArkady Kanevsky, Vijaya Ramachandran
1987STOCA New Graph Triconnectivity Algorithm and Its ParallelizationGary L. Miller, Vijaya Ramachandran
1986STOCLinear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version)George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran
1983DACAn improved switch-level simulator for MOS circuits.Vijaya Ramachandran
1982FOCSOn Driving Many Long Lines in a VLSI LayoutVijaya Ramachandran