Vijaya Ramachandran

161 papers A* 29A 10B 26C 2Misc 1Journal 71Unranked 19

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Algorithms for Distance Sensitivity Oracles and other Graph Problems on the PRAM. CoRR Vignesh Manoharan, Vijaya Ramachandran
2025	B	`conf`	Brief Announcement: Algorithms for Distance Sensitivity Oracles on the PRAM. SPAA Vignesh Manoharan, Vijaya Ramachandran
2025	B	`conf`	Distributed Distance Sensitivity Oracles. SIROCCO Vignesh Manoharan, Vijaya Ramachandran
2024	A*	`conf`	Computing Minimum Weight Cycle in the CONGEST Model. PODC Vignesh Manoharan, Vijaya Ramachandran
2024	B	`conf`	Computing Replacement Paths in the CONGEST Model. SIROCCO Vignesh Manoharan, Vijaya Ramachandran
2024	J	`jnl`	Distributed Distance Sensitivity Oracles. CoRR Vignesh Manoharan, Vijaya Ramachandran
2023	J	`jnl`	Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model. CoRR Vignesh Manoharan, Vijaya Ramachandran
2023	J	`jnl`	Scalable Data Structures (Dagstuhl Seminar 23211). Dagstuhl Reports Gerth Stølting Brodal, John Iacono, László Kozma, Vijaya Ramachandran, Justin Dallant
2022	A*	`conf`	Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model. PODC Vignesh Manoharan, Vijaya Ramachandran
2022	J	`jnl`	Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model. CoRR Vignesh Manoharan, Vijaya Ramachandran
2021	B	`conf`	Data Oblivious Algorithms for Multicores. SPAA Vijaya Ramachandran, Elaine Shi
2021	J	`jnl`	Scalable Data Structures (Dagstuhl Seminar 21071). Dagstuhl Reports Gerth Stølting Brodal, John Iacono, Markus E. Nebel, Vijaya Ramachandran
2020	J	`jnl`	Data Oblivious Algorithms for Multicores. CoRR Vijaya Ramachandran, Elaine Shi
2020	J	`jnl`	Data Oblivious Algorithms for Multicores. IACR Cryptol. ePrint Arch. Vijaya Ramachandran, Elaine Shi
2020	B	`conf`	Faster Deterministic All Pairs Shortest Paths in Congest Model. SPAA Udit Agarwal, Vijaya Ramachandran
2020	J	`jnl`	Faster Deterministic All Pairs Shortest Paths in Congest Model. CoRR Udit Agarwal, Vijaya Ramachandran
2019	B	`conf`	A round-efficient distributed betweenness centrality algorithm. PPoPP Loc Hoang, Matteo Pontecorvi, Roshan Dathathri, Gurbinder Gill, Bozhi You, Keshav Pingali, Vijaya Ramachandran
2019	A	`conf`	Distributed Weighted All Pairs Shortest Paths Through Pipelining. IPDPS Udit Agarwal, Vijaya Ramachandran
2018	J	`jnl`	A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in O͠(n CoRR Udit Agarwal, Vijaya Ramachandran, Valerie King, Matteo Pontecorvi
2018	A*	`conf`	A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds. PODC Udit Agarwal, Vijaya Ramachandran, Valerie King, Matteo Pontecorvi
2018	J	`jnl`	A Faster Deterministic Distributed Algorithm for Weighted APSP Through Pipelining. CoRR Udit Agarwal, Vijaya Ramachandran
2018	J	`jnl`	Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs. ACM Trans. Algorithms Rezaul Alam Chowdhury, Vijaya Ramachandran
2018	J	`jnl`	Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths. CoRR Matteo Pontecorvi, Vijaya Ramachandran
2018	J	`jnl`	Editorial: ALENEX 2017 Special Issue. ACM J. Exp. Algorithmics Valentin Polishchuk, Vijaya Ramachandran, Rezaul Alam Chowdhury
2018	A*	`conf`	Fine-grained complexity for sparse graphs. STOC Udit Agarwal, Vijaya Ramachandran
2018	J	`jnl`	New and Simplified Distributed Algorithms for Weighted All Pairs Shortest Paths. CoRR Udit Agarwal, Vijaya Ramachandran
2017	J	`jnl`	Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers. CoRR Richard Cole, Vijaya Ramachandran
2017	B	`conf`	Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers: Extended Abstract. SPAA Richard Cole, Vijaya Ramachandran
2017	A	`ed.`	Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2017, Barcelona, Spain, Hotel Porta Fira, January 17-18, 2017. ALENEX Sándor P. Fekete, Vijaya Ramachandran
2017	J	`jnl`	Resource Oblivious Sorting on Multicores. ACM Trans. Parallel Comput. Richard Cole, Vijaya Ramachandran
2016	B	`conf`	Finding k Simple Shortest Paths and Cycles. ISAAC Udit Agarwal, Vijaya Ramachandran
2016	J	`jnl`	Fine-Grained Complexity and Conditional Hardness for Sparse Graphs. CoRR Udit Agarwal, Vijaya Ramachandran
2016	—	`ch.`	Randomized Minimum Spanning Tree. Encyclopedia of Algorithms Vijaya Ramachandran
2015	J	`jnl`	A Faster Algorithm for Fully Dynamic Betweenness Centrality. CoRR Matteo Pontecorvi, Vijaya Ramachandran
2015	J	`jnl`	Finding $k$ Simple Shortest Paths and Cycles. CoRR Udit Agarwal, Vijaya Ramachandran
2015	B	`conf`	Fully Dynamic Betweenness Centrality. ISAAC Matteo Pontecorvi, Vijaya Ramachandran
2015	J	`jnl`	Resource Oblivious Sorting on Multicores. CoRR Richard Cole, Vijaya Ramachandran
2014	—	`conf`	Betweenness Centrality - Incremental and Faster. MFCS (2) Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
2014	B	`conf`	Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality. ISAAC Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
2014	J	`jnl`	Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality. CoRR Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
2014	J	`jnl`	Fully Dynamic All Pairs All Shortest Paths. CoRR Matteo Pontecorvi, Vijaya Ramachandran
2013	A	`conf`	Analysis of Randomized Work Stealing with False Sharing. IPDPS Richard Cole, Vijaya Ramachandran
2013	J	`jnl`	Betweenness Centrality - Incremental and Faster. CoRR Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran
2013	J	`jnl`	Oblivious algorithms for multicores and networks of processors. J. Parallel Distributed Comput. Rezaul Alam Chowdhury, Vijaya Ramachandran, Francesco Silvestri, Brandon Blakeley
2012	A	`conf`	Competitive Cache Replacement Strategies for Shared Cache Environments. IPDPS Anil Kumar Katti, Vijaya Ramachandran
2012	A	`conf`	Efficient Fetch-and-Increment. DISC Faith Ellen, Vijaya Ramachandran, Philipp Woelfel
2012	A	`conf`	Efficient Resource Oblivious Algorithms for Multicores with False Sharing. IPDPS Richard Cole, Vijaya Ramachandran
2012	B	`conf`	Revisiting the Cache Miss Analysis of Multithreaded Algorithms. LATIN Richard Cole, Vijaya Ramachandran
2011	J	`jnl`	Analysis of Randomized Work Stealing with False Sharing CoRR Richard Cole, Vijaya Ramachandran
2011	J	`jnl`	Efficient Resource Oblivious Algorithms for Multicores CoRR Richard Cole, Vijaya Ramachandran
2010	B	`conf`	A universal construction for wait-free transaction friendly data structures. SPAA Phong Chuong, Faith Ellen, Vijaya Ramachandran
2010	J	`jnl`	Cache-Oblivious Dynamic Programming for Bioinformatics. IEEE ACM Trans. Comput. Biol. Bioinform. Rezaul Alam Chowdhury, Hai-Son Le, Vijaya Ramachandran
2010	A	`conf`	Oblivious algorithms for multicores and network of processors. IPDPS Rezaul Alam Chowdhury, Francesco Silvestri, Brandon Blakeley, Vijaya Ramachandran
2010	—	`conf`	Resource Oblivious Sorting on Multicores. ICALP (1) Richard Cole, Vijaya Ramachandran
2010	J	`jnl`	The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation. Theory Comput. Syst. Rezaul Alam Chowdhury, Vijaya Ramachandran
2009	J	`jnl`	Flexible Hardware Acceleration for Instruction-Grain Lifeguards. IEEE Micro Shimin Chen, Michael Kozuch, Phillip B. Gibbons, Michael P. Ryan, Theodoros Strigkos, Todd C. Mowry, Olatunji Ruwase, Evangelos Vlachos, Babak Falsafi, Vijaya Ramachandran
2008	B	`conf`	Cache-efficient dynamic programming algorithms for multicores. SPAA Rezaul Alam Chowdhury, Vijaya Ramachandran
2008	A*	`conf`	Flexible Hardware Acceleration for Instruction-Grain Program Monitoring. ISCA Shimin Chen, Michael Kozuch, Theodoros Strigkos, Babak Falsafi, Phillip B. Gibbons, Todd C. Mowry, Vijaya Ramachandran, Olatunji Ruwase, Michael P. Ryan, Evangelos Vlachos
2008	J	`jnl`	Oracles for Distances Avoiding a Failed Node or Link. SIAM J. Comput. Camil Demetrescu, Mikkel Thorup, Rezaul Alam Chowdhury, Vijaya Ramachandran
2008	B	`conf`	Parallelizing dynamic information flow tracking. SPAA Olatunji Ruwase, Phillip B. Gibbons, Todd C. Mowry, Vijaya Ramachandran, Shimin Chen, Michael Kozuch, Michael P. Ryan
2008	A*	`conf`	Provably good multicore cache performance for divide-and-conquer algorithms. SODA Guy E. Blelloch, Rezaul Alam Chowdhury, Phillip B. Gibbons, Vijaya Ramachandran, Shimin Chen, Michael Kozuch
2008	—	`ch.`	Randomized Minimum Spanning Tree. Encyclopedia of Algorithms Vijaya Ramachandran
2008	J	`jnl`	Randomized minimum spanning tree algorithms using exponentially fewer random bits. ACM Trans. Algorithms Seth Pettie, Vijaya Ramachandran
2007	—	`conf`	Cache-Oblivious Computation: Algorithms and Experimental Evaluation. ICCTA Vijaya Ramachandran
2007	A*	`conf`	The SODA Daniel Fernholz, Vijaya Ramachandran
2007	B	`conf`	The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation. SPAA Rezaul Alam Chowdhury, Vijaya Ramachandran
2007	J	`jnl`	The diameter of sparse random graphs. Random Struct. Algorithms Daniel Fernholz, Vijaya Ramachandran
2006	A*	`conf`	Cache-oblivious dynamic programming. SODA Rezaul Alam Chowdhury, Vijaya Ramachandran
2006	J	`jnl`	Pattern Identification in Biogeography. IEEE ACM Trans. Comput. Biol. Bioinform. Ganeshkumar Ganapathy, Barbara Goodson, Robert K. Jansen, Hai-Son Le, Vijaya Ramachandran, Tandy J. Warnow
2006	B	`conf`	The cache-oblivious gaussian elimination paradigm: theoretical framework and experimental evaluation. SPAA Rezaul Alam Chowdhury, Vijaya Ramachandran
2005	J	`jnl`	A Shortest Path Algorithm for Real-Weighted Undirected Graphs. SIAM J. Comput. Seth Pettie, Vijaya Ramachandran
2005	A*	`conf`	External-memory exact and approximate all-pairs shortest-paths in undirected graphs. SODA Rezaul Alam Chowdhury, Vijaya Ramachandran
2005	C	`conf`	Pattern Identification in Biogeography. WABI Ganeshkumar Ganapathy, Barbara Goodson, Robert K. Jansen, Vijaya Ramachandran, Tandy J. Warnow
2004	B	`conf`	Cache-oblivious shortest paths in graphs using buffer heap. SPAA Rezaul Alam Chowdhury, Vijaya Ramachandran
2004	A*	`conf`	On contract-and-refine transformations between phylogenetic trees. SODA Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy J. Warnow
2004	A*	`conf`	Randomized Parallel Schedulers for Switch-Memory-Switch Routers: Analysis and Numerical Studies. INFOCOM Amit Prakash, Adnan Aziz, Vijaya Ramachandran
2003	B	`conf`	A near optimal scheduler for switch-memory-switch routers. SPAA Adnan Aziz, Amit Prakash, Vijaya Ramachandran
2003	C	`conf`	Better Hill-Climbing Searches for Parsimony. WABI Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy J. Warnow
2003	J	`jnl`	Emulations between QSM, BSP and LogP: a framework for general-purpose parallel algorithm design. J. Parallel Distributed Comput. Vijaya Ramachandran, Brian Grayson, Michael Dahlin
2002	J	`jnl`	A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest. SIAM J. Comput. Seth Pettie, Vijaya Ramachandran
2002	J	`jnl`	An optimal minimum spanning tree algorithm. J. ACM Seth Pettie, Vijaya Ramachandran
2002	A*	`conf`	Computing shortest paths with comparisons and additions. SODA Seth Pettie, Vijaya Ramachandran
2002	A	`conf`	Experimental Evaluation of a New Shortest Path Algorithm. ALENEX Seth Pettie, Vijaya Ramachandran, Srinath Sridhar
2002	B	`conf`	Improved Distance Oracles for Avoiding Link-Failure. ISAAC Rezaul Alam Chowdhury, Vijaya Ramachandran
2002	A*	`conf`	Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms. SODA Seth Pettie, Vijaya Ramachandran
2002	—	`conf`	Parallel and Out-of-core View-dependent Isocontour Visualization Using Random Data Distribution. VisSym Xiaoyu Zhang, Chandrajit Bajaj, Vijaya Ramachandran
2002	J	`jnl`	Quasi-Fully Dynamic Algorithms for Two-Connectivity and Cycle Equivalence. Algorithmica Madhukar R. Korupolu, Vijaya Ramachandran
2002	J	`jnl`	SPAA 1999 - Guest Editors' Foreword. Theory Comput. Syst. Vijaya Ramachandran, Ramesh K. Sitaraman
2001	Misc	`conf`	Parallel Algorithm Design with Coarse-Grained Synchronization. International Conference on Computational Science (2) Vijaya Ramachandran
2000	A*	`conf`	An Optimal Minimum Spanning Tree Algorithm. ICALP Seth Pettie, Vijaya Ramachandran
1999	—	`conf`	A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest. RANDOM-APPROX Seth Pettie, Vijaya Ramachandran
1999	J	`jnl`	Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation? Theory Comput. Syst. Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
1999	A*	`conf`	Emulations Between QSM, BSP, and LogP: A Framework for General-Purpose Parallel Algorithm Design. SODA Vijaya Ramachandran, Brian Grayson, Michael Dahlin
1999	—	`conf`	Experimental Evaluation of QSM, a Simple Shared-Memory Model. IPPS/SPDP Brian Grayson, Michael Dahlin, Vijaya Ramachandran
1999	J	`jnl`	Modeling Parallel Bandwidth: Local versus Global Restrictions. Algorithmica Micah Adler, Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
1999	B	`ed.`	Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '99, Saint-Malo, France, June 27-30, 1999 SPAA Gary L. Miller, Vijaya Ramachandran
1998	B	`conf`	Computational Bounds for Fundamental Problems on General-Purpose Parallel Models. SPAA Philip D. MacKenzie, Vijaya Ramachandran
1998	J	`jnl`	ERCW PRAMs and Optical Communication. Theor. Comput. Sci. Philip D. MacKenzie, Vijaya Ramachandran
1998	J	`jnl`	The Queue-Read Queue-Write Asynchronous PRAM Model. Theor. Comput. Sci. Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
1998	J	`jnl`	The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms. SIAM J. Comput. Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
1997	B	`conf`	A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest. ISAAC Chung Keung Poon, Vijaya Ramachandran
1997	J	`jnl`	An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem. Algorithmica Vijaya Ramachandran, Honghua Yang
1997	J	`jnl`	An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification. Inf. Process. Lett. Valerie King, Chung Keung Poon, Vijaya Ramachandran, Santanu Sinha
1997	B	`conf`	Can Shared-Memory Model Serve as a Bridging Model for Parallel Computation? SPAA Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
1997	B	`conf`	Modeling Parallel Bandwidth: Local vs. Global Restrictions. SPAA Micah Adler, Phillip B. Gibbons, Vijaya Ramachandran, Yossi Matias
1997	J	`jnl`	Parallel Algorithms for Reducible Flow Graphs. J. Algorithms Vijaya Ramachandran
1997	—	`conf`	QSM: A General Purpose Shared-Memory Model for Parallel Computation. FSTTCS Vijaya Ramachandran
1997	A	`conf`	Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems. ESA Madhukar R. Korupolu, Vijaya Ramachandran
1996	J	`jnl`	An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem. SIAM J. Comput. Vijaya Ramachandran, Honghua Yang
1996	A*	`conf`	Asynchrony versus Bulk-Synchrony in QRQW PRAM model (Abstract). PODC Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
1996	—	`conf`	ERCW PRAMs and Optical Communication. Euro-Par, Vol. II Philip D. MacKenzie, Vijaya Ramachandran
1996	J	`jnl`	Efficient Low-Contention Parallel Algorithms. J. Comput. Syst. Sci. Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
1996	J	`jnl`	Efficient Massively Parallel Implementation of some Combinatorial Algorithms. Theor. Comput. Sci. Tsan-sheng Hsu, Vijaya Ramachandran
1996	—	`conf`	The Queue-Read Queue-Write Asynchronous PRAM Model. Euro-Par, Vol. II Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
1995	J	`jnl`	Computing Minimal Spanning Subgraphs in Linear Time. SIAM J. Comput. Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan
1995	—	`conf`	Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing. IPPS Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean
1995	J	`jnl`	On Finding Minimal Two-Connected Subgraphs. J. Algorithms Pierre Kelsen, Vijaya Ramachandran
1994	A*	`conf`	An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem. SODA Vijaya Ramachandran, Honghua Yang
1994	B	`conf`	Efficient Low-Contention Parallel Algorithms. SPAA Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
1994	J	`jnl`	Finding the Closed Partition of a Planar Graph. Algorithmica Vijaya Ramachandran, Honghua Yang
1994	J	`jnl`	Parallel Random Access Machines with both Multiplication and Shifts Inf. Comput. Jerry L. Trahan, Vijaya Ramachandran, Michael C. Loui
1994	—	`conf`	Parallel implementation of algorithms for finding connected components in graphs. Parallel Algorithms Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean
1994	J	`jnl`	Planarity Testing in Parallel. J. Comput. Syst. Sci. Vijaya Ramachandran, John H. Reif
1994	—	`conf`	The Design and Evaluation of Parallel Algorithms (Abstract). ACM Conference on Computer Science Vijaya Ramachandran
1994	A*	`conf`	The QRQW PRAM: Accounting for Contention in Parallel Algorithms. SODA Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
1993	A	`conf`	An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem. ESA Vijaya Ramachandran, Honghua Yang
1993	J	`jnl`	Finding Triconnected Components by Local Replacement. SIAM J. Comput. Donald S. Fussell, Vijaya Ramachandran, Ramakrishna Thurimella
1993	J	`jnl`	Finding a Smallest Augmentation to Biconnect a Graph. SIAM J. Comput. Tsan-sheng Hsu, Vijaya Ramachandran
1993	A*	`ed.`	Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 25-27 January 1993, Austin, Texas, USA. SODA Vijaya Ramachandran
1992	J	`jnl`	A new graph triconnectivity algorithm and its parallelization. Comb. Gary L. Miller, Vijaya Ramachandran
1992	A*	`conf`	Computing Minimal Spanning Subgraphs in Linear Time. SODA Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan
1992	—	`conf`	Implementation of Parallel Graph Algorithms on the MasPar. Computational Support for Discrete Mathematics Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean
1992	J	`jnl`	Multiplication, Division and Shift Instructions in Parallel Random Access Machines. Theor. Comput. Sci. Jerry L. Trahan, Michael C. Loui, Vijaya Ramachandran
1991	A*	`conf`	A Linear Time Algorithm for Triconnectivity Augmentation (Extended Abstract) FOCS Tsan-sheng Hsu, Vijaya Ramachandran
1991	J	`jnl`	Improved Algorithms for Graph Four-Connectivity. J. Comput. Syst. Sci. Arkady Kanevsky, Vijaya Ramachandran
1991	A*	`conf`	On Finding Minimal 2-Connected Subgraphs. SODA Pierre Kelsen, Vijaya Ramachandran
1991	—	`conf`	On Finding a Smallest Augmentation to Biconnect a Graph. ISA Tsan-sheng Hsu, Vijaya Ramachandran
1991	—	`conf`	Parallel algorithm and complexity results for telephone link simulation. SPDP Vijaya Ramachandran, Li-Chung Wang
1991	J	`jnl`	Transitive Compaction in Parallel via Branchings. J. Algorithms Phillip B. Gibbons, Richard M. Karp, Vijaya Ramachandran, Danny Soroker, Robert Endre Tarjan
1990	J	`jnl`	A Minimax Arc Theorem for Reducible Flow Graphs. SIAM J. Discret. Math. Vijaya Ramachandran
1990	J	`jnl`	Linear Programming with Two Variables per Inequality in Poly-Log Time. SIAM J. Comput. George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran
1990	B	`conf`	Lower Bounds for Parallel Computation on Linked Structures. SPAA Faith E. Fich, Vijaya Ramachandran
1990	—	`ch.`	Parallel Algorithms for Shared-Memory Machines. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) Richard M. Karp, Vijaya Ramachandran
1989	—	`conf`	A Framework for Parallel Graph Algorithm Design. Optimal Algorithms Vijaya Ramachandran
1989	A*	`conf`	An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract) FOCS Vijaya Ramachandran, John H. Reif
1989	A*	`conf`	Finding Triconnected Components by Local Replacements. ICALP Donald S. Fussell, Vijaya Ramachandran, Ramakrishna Thurimella
1989	—	`conf`	The Power of Parallel Random Access Machines with Augmented Instruction Sets. SCT Jerry L. Trahan, Michael C. Loui, Vijaya Ramachandran
1988	J	`jnl`	Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits. SIAM J. Comput. Gary L. Miller, Vijaya Ramachandran, Erich L. Kaltofen
1988	—	`conf`	Efficient Parallel Triconnectivity in Logarithmic Time. AWOC Vijaya Ramachandran, Uzi Vishkin
1988	J	`jnl`	Finding a Minimum Feedback Arc Set in Reducible Flow Graphs. J. Algorithms Vijaya Ramachandran
1988	J	`jnl`	Optimal VLSI Graph Embeddings in Variable Aspect Ratio Rectangles. Algorithmica Paul Czerwinski, Vijaya Ramachandran
1987	A*	`conf`	A New Graph Triconnectivity Algorithm and Its Parallelization STOC Gary L. Miller, Vijaya Ramachandran
1987	A*	`conf`	Improved Algorithms for Graph Four-Connectivity FOCS Arkady Kanevsky, Vijaya Ramachandran
1987	J	`jnl`	The complexity of minimum cut and maximum flow problems in an acyclic network. Networks Vijaya Ramachandran
1986	J	`jnl`	Algorithmic Aspects of MOS VLSI Switch-Level Simulation with Race Detection. IEEE Trans. Computers Vijaya Ramachandran
1986	—	`conf`	Efficient Parallel Evaluation of Straight-line Code and Arithmetric Circuits. Aegean Workshop on Computing Gary L. Miller, Vijaya Ramachandran, Erich L. Kaltofen
1986	A*	`conf`	Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version) STOC George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran
1986	J	`jnl`	On driving many long wires in a VLSI layout. J. ACM Vijaya Ramachandran
1983	A*	`conf`	An improved switch-level simulator for MOS circuits. DAC Vijaya Ramachandran
1983	J	`jnl`	Single Residue Error Correction in Residue Number Systems. IEEE Trans. Computers Vijaya Ramachandran
1982	A*	`conf`	On Driving Many Long Lines in a VLSI Layout FOCS Vijaya Ramachandran