On Driving Many Long Lines in a VLSI Layout - Vijaya Ramachandran (FOCS, 1982)

An improved switch-level simulator for MOS circuits. - Vijaya Ramachandran (DAC, 1983)

Single Residue Error Correction in Residue Number Systems. - Vijaya Ramachandran (IEEE Trans. Computers, 1983)

Efficient Parallel Evaluation of Straight-line Code and Arithmetric Circuits. - Gary L. Miller; Vijaya Ramachandran; Erich L. Kaltofen (Aegean Workshop on Computing, 1986)

Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version) - George S. Lueker; Nimrod Megiddo; Vijaya Ramachandran (STOC, 1986)

On driving many long wires in a VLSI layout. - Vijaya Ramachandran (J. ACM, 1986)

Algorithmic Aspects of MOS VLSI Switch-Level Simulation with Race Detection. - Vijaya Ramachandran (IEEE Trans. Computers, 1986)

Improved Algorithms for Graph Four-Connectivity - Arkady Kanevsky; Vijaya Ramachandran (FOCS, 1987)

A New Graph Triconnectivity Algorithm and Its Parallelization - Gary L. Miller; Vijaya Ramachandran (STOC, 1987)

The complexity of minimum cut and maximum flow problems in an acyclic network. - Vijaya Ramachandran (Networks, 1987)

Efficient Parallel Triconnectivity in Logarithmic Time. - Vijaya Ramachandran; Uzi Vishkin (AWOC, 1988)

Optimal VLSI Graph Embeddings in Variable Aspect Ratio Rectangles. - Paul Czerwinski; Vijaya Ramachandran (Algorithmica, 1988)

Finding a Minimum Feedback Arc Set in Reducible Flow Graphs. - Vijaya Ramachandran (J. Algorithms, 1988)

Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits. - Gary L. Miller; Vijaya Ramachandran; Erich L. Kaltofen (SIAM J. Comput., 1988)

The Power of Parallel Random Access Machines with Augmented Instruction Sets. - Jerry L. Trahan; Michael C. Loui; Vijaya Ramachandran (SCT, 1989)

An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract) - Vijaya Ramachandran; John H. Reif (FOCS, 1989)

Finding Triconnected Components by Local Replacements. - Donald S. Fussell; Vijaya Ramachandran; Ramakrishna Thurimella (ICALP, 1989)

A Framework for Parallel Graph Algorithm Design. - Vijaya Ramachandran (Optimal Algorithms, 1989)

Parallel Algorithms for Shared-Memory Machines. - Richard M. Karp; Vijaya Ramachandran (Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), 1990)

Lower Bounds for Parallel Computation on Linked Structures. - Faith E. Fich; Vijaya Ramachandran (SPAA, 1990)

Linear Programming with Two Variables per Inequality in Poly-Log Time. - George S. Lueker; Nimrod Megiddo; Vijaya Ramachandran (SIAM J. Comput., 1990)

A Minimax Arc Theorem for Reducible Flow Graphs. - Vijaya Ramachandran (SIAM J. Discret. Math., 1990)

A Linear Time Algorithm for Triconnectivity Augmentation (Extended Abstract) - Tsan-sheng Hsu; Vijaya Ramachandran (FOCS, 1991)

On Finding a Smallest Augmentation to Biconnect a Graph. - Tsan-sheng Hsu; Vijaya Ramachandran (ISA, 1991)

On Finding Minimal 2-Connected Subgraphs. - Pierre Kelsen; Vijaya Ramachandran (SODA, 1991)

Parallel algorithm and complexity results for telephone link simulation. - Vijaya Ramachandran; Li-Chung Wang (SPDP, 1991)

Transitive Compaction in Parallel via Branchings. - Phillip B. Gibbons; Richard M. Karp; Vijaya Ramachandran; Danny Soroker; Robert Endre Tarjan (J. Algorithms, 1991)

Implementation of Parallel Graph Algorithms on the MasPar. - Tsan-sheng Hsu; Vijaya Ramachandran; Nathaniel Dean (Computational Support for Discrete Mathematics, 1992)

Computing Minimal Spanning Subgraphs in Linear Time. - Xiaofeng Han; Pierre Kelsen; Vijaya Ramachandran; Robert Endre Tarjan (SODA, 1992)

Multiplication, Division and Shift Instructions in Parallel Random Access Machines. - Jerry L. Trahan; Michael C. Loui; Vijaya Ramachandran (Theor. Comput. Sci., 1992)

An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem. - Vijaya Ramachandran; Honghua Yang (ESA, 1993)

Finding Triconnected Components by Local Replacement. - Donald S. Fussell; Vijaya Ramachandran; Ramakrishna Thurimella (SIAM J. Comput., 1993)

The Design and Evaluation of Parallel Algorithms (Abstract). - Vijaya Ramachandran (ACM Conference on Computer Science, 1994)

Parallel implementation of algorithms for finding connected components in graphs. - Tsan-sheng Hsu; Vijaya Ramachandran; Nathaniel Dean (Parallel Algorithms, 1994)

The QRQW PRAM: Accounting for Contention in Parallel Algorithms. - Phillip B. Gibbons; Yossi Matias; Vijaya Ramachandran (SODA, 1994)

An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem. - Vijaya Ramachandran; Honghua Yang (SODA, 1994)

Efficient Low-Contention Parallel Algorithms. - Phillip B. Gibbons; Yossi Matias; Vijaya Ramachandran (SPAA, 1994)

Finding the Closed Partition of a Planar Graph. - Vijaya Ramachandran; Honghua Yang (Algorithmica, 1994)

Planarity Testing in Parallel. - Vijaya Ramachandran; John H. Reif (J. Comput. Syst. Sci., 1994)

Parallel Random Access Machines with both Multiplication and Shifts - Jerry L. Trahan; Vijaya Ramachandran; Michael C. Loui (Inf. Comput., 1994)

Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing. - Tsan-sheng Hsu; Vijaya Ramachandran; Nathaniel Dean (IPPS, 1995)

On Finding Minimal Two-Connected Subgraphs. - Pierre Kelsen; Vijaya Ramachandran (J. Algorithms, 1995)

The Queue-Read Queue-Write Asynchronous PRAM Model. - Phillip B. Gibbons; Yossi Matias; Vijaya Ramachandran (Euro-Par, Vol. II, 1996)

ERCW PRAMs and Optical Communication. - Philip D. MacKenzie; Vijaya Ramachandran (Euro-Par, Vol. II, 1996)

Asynchrony versus Bulk-Synchrony in QRQW PRAM model (Abstract). - Phillip B. Gibbons; Yossi Matias; Vijaya Ramachandran (PODC, 1996)

Efficient Massively Parallel Implementation of some Combinatorial Algorithms. - Tsan-sheng Hsu; Vijaya Ramachandran (Theor. Comput. Sci., 1996)

Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems. - Madhukar R. Korupolu; Vijaya Ramachandran (ESA, 1997)

QSM: A General Purpose Shared-Memory Model for Parallel Computation. - Vijaya Ramachandran (FSTTCS, 1997)

A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest. - Chung Keung Poon; Vijaya Ramachandran (ISAAC, 1997)

Modeling Parallel Bandwidth: Local vs. Global Restrictions. - Micah Adler; Phillip B. Gibbons; Vijaya Ramachandran; Yossi Matias (SPAA, 1997)

Can Shared-Memory Model Serve as a Bridging Model for Parallel Computation? - Phillip B. Gibbons; Yossi Matias; Vijaya Ramachandran (SPAA, 1997)

An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification. - Valerie King; Chung Keung Poon; Vijaya Ramachandran; Santanu Sinha (Inf. Process. Lett., 1997)

Parallel Algorithms for Reducible Flow Graphs. - Vijaya Ramachandran (J. Algorithms, 1997)

Computational Bounds for Fundamental Problems on General-Purpose Parallel Models. - Philip D. MacKenzie; Vijaya Ramachandran (SPAA, 1998)

The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms. - Phillip B. Gibbons; Yossi Matias; Vijaya Ramachandran (SIAM J. Comput., 1998)

Experimental Evaluation of QSM, a Simple Shared-Memory Model. - Brian Grayson; Michael Dahlin; Vijaya Ramachandran (IPPS/SPDP, 1999)

A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest. - Seth Pettie; Vijaya Ramachandran (RANDOM-APPROX, 1999)

Emulations Between QSM, BSP, and LogP: A Framework for General-Purpose Parallel Algorithm Design. - Vijaya Ramachandran; Brian Grayson; Michael Dahlin (SODA, 1999)

Modeling Parallel Bandwidth: Local versus Global Restrictions. - Micah Adler; Phillip B. Gibbons; Yossi Matias; Vijaya Ramachandran (Algorithmica, 1999)

An Optimal Minimum Spanning Tree Algorithm. - Seth Pettie; Vijaya Ramachandran (ICALP, 2000)

Parallel Algorithm Design with Coarse-Grained Synchronization. - Vijaya Ramachandran (International Conference on Computational Science (2), 2001)

Experimental Evaluation of a New Shortest Path Algorithm. - Seth Pettie; Vijaya Ramachandran; Srinath Sridhar 001 (ALENEX, 2002)

Improved Distance Oracles for Avoiding Link-Failure. - Rezaul Alam Chowdhury; Vijaya Ramachandran (ISAAC, 2002)

Computing shortest paths with comparisons and additions. - Seth Pettie; Vijaya Ramachandran (SODA, 2002)

Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms. - Seth Pettie; Vijaya Ramachandran (SODA, 2002)

Parallel and Out-of-core View-dependent Isocontour Visualization Using Random Data Distribution. - Xiaoyu Zhang 011; Chandrajit Bajaj; Vijaya Ramachandran (VisSym, 2002)

Quasi-Fully Dynamic Algorithms for Two-Connectivity and Cycle Equivalence. - Madhukar R. Korupolu; Vijaya Ramachandran (Algorithmica, 2002)

SPAA 1999 - Guest Editors' Foreword. - Vijaya Ramachandran; Ramesh K. Sitaraman (Theory Comput. Syst., 2002)

A near optimal scheduler for switch-memory-switch routers. - Adnan Aziz; Amit Prakash; Vijaya Ramachandran (SPAA, 2003)

Better Hill-Climbing Searches for Parsimony. - Ganeshkumar Ganapathy; Vijaya Ramachandran; Tandy J. Warnow (WABI, 2003)

Randomized Parallel Schedulers for Switch-Memory-Switch Routers: Analysis and Numerical Studies. - Amit Prakash; Adnan Aziz; Vijaya Ramachandran (INFOCOM, 2004)

On contract-and-refine transformations between phylogenetic trees. - Ganeshkumar Ganapathy; Vijaya Ramachandran; Tandy J. Warnow (SODA, 2004)

Cache-oblivious shortest paths in graphs using buffer heap. - Rezaul Alam Chowdhury; Vijaya Ramachandran (SPAA, 2004)

External-memory exact and approximate all-pairs shortest-paths in undirected graphs. - Rezaul Alam Chowdhury; Vijaya Ramachandran (SODA, 2005)

Pattern Identification in Biogeography. - Ganeshkumar Ganapathy; Barbara Goodson; Robert K. Jansen; Vijaya Ramachandran; Tandy J. Warnow (WABI, 2005)

A Shortest Path Algorithm for Real-Weighted Undirected Graphs. - Seth Pettie; Vijaya Ramachandran (SIAM J. Comput., 2005)

Cache-oblivious dynamic programming. - Rezaul Alam Chowdhury; Vijaya Ramachandran (SODA, 2006)

The cache-oblivious gaussian elimination paradigm: theoretical framework and experimental evaluation. - Rezaul Alam Chowdhury; Vijaya Ramachandran (SPAA, 2006)

Pattern Identification in Biogeography. - Ganeshkumar Ganapathy; Barbara Goodson; Robert K. Jansen; Hai-Son Le; Vijaya Ramachandran; Tandy J. Warnow (IEEE ACM Trans. Comput. Biol. Bioinform., 2006)

Cache-Oblivious Computation: Algorithms and Experimental Evaluation. - Vijaya Ramachandran (ICCTA, 2007)

The k-orientability thresholds for Gn, p. - Daniel Fernholz; Vijaya Ramachandran (SODA, 2007)

The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation. - Rezaul Alam Chowdhury; Vijaya Ramachandran (SPAA, 2007)

The diameter of sparse random graphs. - Daniel Fernholz; Vijaya Ramachandran (Random Struct. Algorithms, 2007)

Flexible 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 (ISCA, 2008)

Provably good multicore cache performance for divide-and-conquer algorithms. - Guy E. Blelloch; Rezaul Alam Chowdhury; Phillip B. Gibbons; Vijaya Ramachandran; Shimin Chen; Michael Kozuch (SODA, 2008)

Cache-efficient dynamic programming algorithms for multicores. - Rezaul Alam Chowdhury; Vijaya Ramachandran (SPAA, 2008)

Parallelizing dynamic information flow tracking. - Olatunji Ruwase; Phillip B. Gibbons; Todd C. Mowry; Vijaya Ramachandran; Shimin Chen; Michael Kozuch; Michael P. Ryan (SPAA, 2008)

Oracles for Distances Avoiding a Failed Node or Link. - Camil Demetrescu; Mikkel Thorup; Rezaul Alam Chowdhury; Vijaya Ramachandran (SIAM J. Comput., 2008)

Randomized minimum spanning tree algorithms using exponentially fewer random bits. - Seth Pettie; Vijaya Ramachandran (ACM Trans. Algorithms, 2008)

Randomized Minimum Spanning Tree. - Vijaya Ramachandran (Encyclopedia of Algorithms, 2008)

Flexible Hardware Acceleration for Instruction-Grain Lifeguards. - Shimin Chen; Michael Kozuch; Phillip B. Gibbons; Michael P. Ryan; Theodoros Strigkos; Todd C. Mowry; Olatunji Ruwase; Evangelos Vlachos; Babak Falsafi; Vijaya Ramachandran (IEEE Micro, 2009)

Resource Oblivious Sorting on Multicores. - Richard Cole 001; Vijaya Ramachandran (ICALP (1), 2010)

Oblivious algorithms for multicores and network of processors. - Rezaul Alam Chowdhury; Francesco Silvestri 001; Brandon Blakeley; Vijaya Ramachandran (IPDPS, 2010)

A universal construction for wait-free transaction friendly data structures. - Phong Chuong; Faith Ellen; Vijaya Ramachandran (SPAA, 2010)

Cache-Oblivious Dynamic Programming for Bioinformatics. - Rezaul Alam Chowdhury; Hai-Son Le; Vijaya Ramachandran (IEEE ACM Trans. Comput. Biol. Bioinform., 2010)

Efficient Resource Oblivious Algorithms for Multicores - Richard Cole 001; Vijaya Ramachandran (CoRR, 2011)

Efficient Resource Oblivious Algorithms for Multicores with False Sharing. - Richard Cole 001; Vijaya Ramachandran (IPDPS, 2012)

Competitive Cache Replacement Strategies for Shared Cache Environments. - Anil Kumar Katti; Vijaya Ramachandran (IPDPS, 2012)

Revisiting the Cache Miss Analysis of Multithreaded Algorithms. - Richard Cole 001; Vijaya Ramachandran (LATIN, 2012)

Efficient Fetch-and-Increment. - Faith Ellen; Vijaya Ramachandran; Philipp Woelfel (DISC, 2012)

Analysis of Randomized Work Stealing with False Sharing. - Richard Cole 001; Vijaya Ramachandran (IPDPS, 2013)

Oblivious algorithms for multicores and networks of processors. - Rezaul Alam Chowdhury; Vijaya Ramachandran; Francesco Silvestri 001; Brandon Blakeley (J. Parallel Distributed Comput., 2013)

Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality. - Meghana Nasre; Matteo Pontecorvi; Vijaya Ramachandran (ISAAC, 2014)

Betweenness Centrality - Incremental and Faster. - Meghana Nasre; Matteo Pontecorvi; Vijaya Ramachandran (MFCS (2), 2014)

Fully Dynamic All Pairs All Shortest Paths. - Matteo Pontecorvi; Vijaya Ramachandran (CoRR, 2014)

Fully Dynamic Betweenness Centrality. - Matteo Pontecorvi; Vijaya Ramachandran (ISAAC, 2015)

A Faster Algorithm for Fully Dynamic Betweenness Centrality. - Matteo Pontecorvi; Vijaya Ramachandran (CoRR, 2015)

Finding k Simple Shortest Paths and Cycles. - Udit Agarwal; Vijaya Ramachandran (ISAAC, 2016)

Fine-Grained Complexity and Conditional Hardness for Sparse Graphs. - Udit Agarwal; Vijaya Ramachandran (CoRR, 2016)

Randomized Minimum Spanning Tree. - Vijaya Ramachandran (Encyclopedia of Algorithms, 2016)

Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers: Extended Abstract. - Richard Cole 001; Vijaya Ramachandran (SPAA, 2017)

Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers. - Richard Cole 001; Vijaya Ramachandran (CoRR, 2017)

A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds. - Udit Agarwal; Vijaya Ramachandran; Valerie King; Matteo Pontecorvi (PODC, 2018)

Fine-grained complexity for sparse graphs. - Udit Agarwal; Vijaya Ramachandran (STOC, 2018)

A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in O͠(n3/2) Rounds. - Udit Agarwal; Vijaya Ramachandran; Valerie King; Matteo Pontecorvi (CoRR, 2018)

Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths. - Matteo Pontecorvi; Vijaya Ramachandran (CoRR, 2018)

A Faster Deterministic Distributed Algorithm for Weighted APSP Through Pipelining. - Udit Agarwal; Vijaya Ramachandran (CoRR, 2018)

New and Simplified Distributed Algorithms for Weighted All Pairs Shortest Paths. - Udit Agarwal; Vijaya Ramachandran (CoRR, 2018)

Editorial: ALENEX 2017 Special Issue. - Valentin Polishchuk; Vijaya Ramachandran; Rezaul Alam Chowdhury (ACM J. Exp. Algorithmics, 2018)

Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs. - Rezaul Alam Chowdhury; Vijaya Ramachandran (ACM Trans. Algorithms, 2018)

Distributed Weighted All Pairs Shortest Paths Through Pipelining. - Udit Agarwal; Vijaya Ramachandran (IPDPS, 2019)

A round-efficient distributed betweenness centrality algorithm. - Loc Hoang; Matteo Pontecorvi; Roshan Dathathri; Gurbinder Gill; Bozhi You; Keshav Pingali; Vijaya Ramachandran (PPoPP, 2019)

Faster Deterministic All Pairs Shortest Paths in Congest Model. - Udit Agarwal; Vijaya Ramachandran (SPAA, 2020)

Data Oblivious Algorithms for Multicores. - Vijaya Ramachandran; Elaine Shi (SPAA, 2021)

Scalable Data Structures (Dagstuhl Seminar 21071). - Gerth Stølting Brodal; John Iacono; Markus E. Nebel; Vijaya Ramachandran (Dagstuhl Reports, 2021)

Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model. - Vignesh Manoharan; Vijaya Ramachandran (PODC, 2022)

Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model. - Vignesh Manoharan; Vijaya Ramachandran (CoRR, 2022)

Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model. - Vignesh Manoharan; Vijaya Ramachandran (CoRR, 2023)

Scalable Data Structures (Dagstuhl Seminar 23211). - Gerth Stølting Brodal; John Iacono; László Kozma 002; Vijaya Ramachandran; Justin Dallant (Dagstuhl Reports, 2023)

Computing Minimum Weight Cycle in the CONGEST Model. - Vignesh Manoharan; Vijaya Ramachandran (PODC, 2024)

Computing Replacement Paths in the CONGEST Model. - Vignesh Manoharan; Vijaya Ramachandran (SIROCCO, 2024)

Distributed Distance Sensitivity Oracles. - Vignesh Manoharan; Vijaya Ramachandran (SIROCCO, 2025)

Brief Announcement: Algorithms for Distance Sensitivity Oracles on the PRAM. - Vignesh Manoharan; Vijaya Ramachandran (SPAA, 2025)