default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVijaya Ramachandran
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c82]Vignesh Manoharan
, Vijaya Ramachandran:
Computing Minimum Weight Cycle in the CONGEST Model. PODC 2024: 182-193- [c81]Vignesh Manoharan, Vijaya Ramachandran:
Computing Replacement Paths in the CONGEST Model. SIROCCO 2024: 420-437 - [i22]Vignesh Manoharan, Vijaya Ramachandran:
Distributed Distance Sensitivity Oracles. CoRR abs/2411.13728 (2024) - 2023
- [i21]Vignesh Manoharan, Vijaya Ramachandran:
Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model. CoRR abs/2308.08670 (2023) - [i20]Gerth Stølting Brodal, John Iacono, László Kozma, Vijaya Ramachandran, Justin Dallant:
Scalable Data Structures (Dagstuhl Seminar 23211). Dagstuhl Reports 13(5): 114-135 (2023) - 2022
- [c80]Vignesh Manoharan, Vijaya Ramachandran:
Brief Announcement: Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model. PODC 2022: 369-371 - [i19]Vignesh Manoharan, Vijaya Ramachandran:
Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model. CoRR abs/2205.14797 (2022) - 2021
- [c79]Vijaya Ramachandran, Elaine Shi:
Data Oblivious Algorithms for Multicores. SPAA 2021: 373-384 - [i18]Gerth Stølting Brodal, John Iacono, Markus E. Nebel, Vijaya Ramachandran:
Scalable Data Structures (Dagstuhl Seminar 21071). Dagstuhl Reports 11(1): 1-23 (2021) - 2020
- [c78]Udit Agarwal, Vijaya Ramachandran:
Faster Deterministic All Pairs Shortest Paths in Congest Model. SPAA 2020: 11-21 - [i17]Udit Agarwal, Vijaya Ramachandran:
Faster Deterministic All Pairs Shortest Paths in Congest Model. CoRR abs/2005.09588 (2020) - [i16]Vijaya Ramachandran, Elaine Shi:
Data Oblivious Algorithms for Multicores. CoRR abs/2008.00332 (2020) - [i15]Vijaya Ramachandran, Elaine Shi:
Data Oblivious Algorithms for Multicores. IACR Cryptol. ePrint Arch. 2020: 947 (2020)
2010 – 2019
- 2019
- [c77]Udit Agarwal, Vijaya Ramachandran:
Distributed Weighted All Pairs Shortest Paths Through Pipelining. IPDPS 2019: 23-32 - [c76]Loc Hoang, Matteo Pontecorvi, Roshan Dathathri, Gurbinder Gill, Bozhi You, Keshav Pingali, Vijaya Ramachandran:
A round-efficient distributed betweenness centrality algorithm. PPoPP 2019: 272-286 - 2018
- [j48]Valentin Polishchuk, Vijaya Ramachandran, Rezaul Alam Chowdhury:
Editorial: ALENEX 2017 Special Issue. ACM J. Exp. Algorithmics 23 (2018) - [j47]Rezaul Alam Chowdhury, Vijaya Ramachandran:
Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs. ACM Trans. Algorithms 14(1): 1:1-1:33 (2018) - [c75]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: 199-205 - [c74]Udit Agarwal, Vijaya Ramachandran:
Fine-grained complexity for sparse graphs. STOC 2018: 239-252 - [i14]Udit Agarwal, Vijaya Ramachandran, Valerie King, Matteo Pontecorvi:
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in O͠(n3/2) Rounds. CoRR abs/1804.05441 (2018) - [i13]Matteo Pontecorvi, Vijaya Ramachandran:
Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths. CoRR abs/1805.08124 (2018) - [i12]Udit Agarwal, Vijaya Ramachandran:
A Faster Deterministic Distributed Algorithm for Weighted APSP Through Pipelining. CoRR abs/1807.08824 (2018) - [i11]Udit Agarwal, Vijaya Ramachandran:
New and Simplified Distributed Algorithms for Weighted All Pairs Shortest Paths. CoRR abs/1810.08544 (2018) - 2017
- [j46]Richard Cole, Vijaya Ramachandran:
Resource Oblivious Sorting on Multicores. ACM Trans. Parallel Comput. 3(4): 23:1-23:31 (2017) - [c73]Richard Cole, Vijaya Ramachandran:
Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers: Extended Abstract. SPAA 2017: 351-362 - [e3]Sándor P. Fekete, Vijaya Ramachandran:
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2017, Barcelona, Spain, Hotel Porta Fira, January 17-18, 2017. SIAM 2017, ISBN 978-1-61197-476-8 [contents] - [i10]Richard Cole, Vijaya Ramachandran:
Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers. CoRR abs/1705.08350 (2017) - 2016
- [c72]Udit Agarwal, Vijaya Ramachandran:
Finding k Simple Shortest Paths and Cycles. ISAAC 2016: 8:1-8:12 - [r2]Vijaya Ramachandran:
Randomized Minimum Spanning Tree. Encyclopedia of Algorithms 2016: 1747-1750 - [i9]Udit Agarwal, Vijaya Ramachandran:
Fine-Grained Complexity and Conditional Hardness for Sparse Graphs. CoRR abs/1611.07008 (2016) - 2015
- [c71]Matteo Pontecorvi, Vijaya Ramachandran:
Fully Dynamic Betweenness Centrality. ISAAC 2015: 331-342 - [i8]Matteo Pontecorvi, Vijaya Ramachandran:
A Faster Algorithm for Fully Dynamic Betweenness Centrality. CoRR abs/1506.05783 (2015) - [i7]Richard Cole, Vijaya Ramachandran:
Resource Oblivious Sorting on Multicores. CoRR abs/1508.01504 (2015) - [i6]Udit Agarwal, Vijaya Ramachandran:
Finding $k$ Simple Shortest Paths and Cycles. CoRR abs/1512.02157 (2015) - 2014
- [c70]Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran:
Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality. ISAAC 2014: 766-778 - [c69]Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran:
Betweenness Centrality - Incremental and Faster. MFCS (2) 2014: 577-588 - [i5]Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran:
Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality. CoRR abs/1411.4073 (2014) - [i4]Matteo Pontecorvi, Vijaya Ramachandran:
Fully Dynamic All Pairs All Shortest Paths. CoRR abs/1412.3852 (2014) - 2013
- [j45]Rezaul Alam Chowdhury, Vijaya Ramachandran, Francesco Silvestri, Brandon Blakeley:
Oblivious algorithms for multicores and networks of processors. J. Parallel Distributed Comput. 73(7): 911-925 (2013) - [c68]Richard Cole, Vijaya Ramachandran:
Analysis of Randomized Work Stealing with False Sharing. IPDPS 2013: 985-998 - [i3]Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran:
Betweenness Centrality - Incremental and Faster. CoRR abs/1311.2147 (2013) - 2012
- [c67]Richard Cole, Vijaya Ramachandran:
Efficient Resource Oblivious Algorithms for Multicores with False Sharing. IPDPS 2012: 201-214 - [c66]Anil Kumar Katti, Vijaya Ramachandran:
Competitive Cache Replacement Strategies for Shared Cache Environments. IPDPS 2012: 215-226 - [c65]Richard Cole, Vijaya Ramachandran:
Revisiting the Cache Miss Analysis of Multithreaded Algorithms. LATIN 2012: 172-183 - [c64]Faith Ellen, Vijaya Ramachandran, Philipp Woelfel:
Efficient Fetch-and-Increment. DISC 2012: 16-30 - 2011
- [i2]Richard Cole, Vijaya Ramachandran:
Efficient Resource Oblivious Algorithms for Multicores. CoRR abs/1103.4071 (2011) - [i1]Richard Cole, Vijaya Ramachandran:
Analysis of Randomized Work Stealing with False Sharing. CoRR abs/1103.4142 (2011) - 2010
- [j44]Rezaul Alam Chowdhury, Vijaya Ramachandran:
The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation. Theory Comput. Syst. 47(4): 878-919 (2010) - [j43]Rezaul Alam Chowdhury, Hai-Son Le, Vijaya Ramachandran:
Cache-Oblivious Dynamic Programming for Bioinformatics. IEEE ACM Trans. Comput. Biol. Bioinform. 7(3): 495-510 (2010) - [c63]Richard Cole, Vijaya Ramachandran:
Resource Oblivious Sorting on Multicores. ICALP (1) 2010: 226-237 - [c62]Rezaul Alam Chowdhury, Francesco Silvestri, Brandon Blakeley, Vijaya Ramachandran:
Oblivious algorithms for multicores and network of processors. IPDPS 2010: 1-12 - [c61]Phong Chuong, Faith Ellen, Vijaya Ramachandran:
A universal construction for wait-free transaction friendly data structures. SPAA 2010: 335-344
2000 – 2009
- 2009
- [j42]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): 62-72 (2009) - 2008
- [j41]Camil Demetrescu, Mikkel Thorup, Rezaul Alam Chowdhury, Vijaya Ramachandran:
Oracles for Distances Avoiding a Failed Node or Link. SIAM J. Comput. 37(5): 1299-1318 (2008) - [j40]Seth Pettie, Vijaya Ramachandran:
Randomized minimum spanning tree algorithms using exponentially fewer random bits. ACM Trans. Algorithms 4(1): 5:1-5:27 (2008) - [c60]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: 377-388 - [c59]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: 501-510 - [c58]Olatunji Ruwase, Phillip B. Gibbons, Todd C. Mowry, Vijaya Ramachandran, Shimin Chen, Michael Kozuch, Michael P. Ryan:
Parallelizing dynamic information flow tracking. SPAA 2008: 35-45 - [c57]Rezaul Alam Chowdhury, Vijaya Ramachandran:
Cache-efficient dynamic programming algorithms for multicores. SPAA 2008: 207-216 - [r1]Vijaya Ramachandran:
Randomized Minimum Spanning Tree. Encyclopedia of Algorithms 2008 - 2007
- [j39]Daniel Fernholz, Vijaya Ramachandran:
The diameter of sparse random graphs. Random Struct. Algorithms 31(4): 482-516 (2007) - [c56]Vijaya Ramachandran:
Cache-Oblivious Computation: Algorithms and Experimental Evaluation. ICCTA 2007: 20-26 - [c55]Daniel Fernholz, Vijaya Ramachandran:
The k-orientability thresholds for Gn, p. SODA 2007: 459-468 - [c54]Rezaul Alam Chowdhury, Vijaya Ramachandran:
The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation. SPAA 2007: 71-80 - 2006
- [j38]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): 334-346 (2006) - [c53]Rezaul Alam Chowdhury, Vijaya Ramachandran:
Cache-oblivious dynamic programming. SODA 2006: 591-600 - [c52]Rezaul Alam Chowdhury, Vijaya Ramachandran:
The cache-oblivious gaussian elimination paradigm: theoretical framework and experimental evaluation. SPAA 2006: 236 - 2005
- [j37]Seth Pettie, Vijaya Ramachandran:
A Shortest Path Algorithm for Real-Weighted Undirected Graphs. SIAM J. Comput. 34(6): 1398-1431 (2005) - [c51]Rezaul Alam Chowdhury, Vijaya Ramachandran:
External-memory exact and approximate all-pairs shortest-paths in undirected graphs. SODA 2005: 735-744 - [c50]Ganeshkumar Ganapathy, Barbara Goodson, Robert K. Jansen, Vijaya Ramachandran, Tandy J. Warnow:
Pattern Identification in Biogeography. WABI 2005: 116-127 - 2004
- [c49]Amit Prakash, Adnan Aziz, Vijaya Ramachandran:
Randomized Parallel Schedulers for Switch-Memory-Switch Routers: Analysis and Numerical Studies. INFOCOM 2004: 2026-2037 - [c48]Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy J. Warnow:
On contract-and-refine transformations between phylogenetic trees. SODA 2004: 900-909 - [c47]Rezaul Alam Chowdhury, Vijaya Ramachandran:
Cache-oblivious shortest paths in graphs using buffer heap. SPAA 2004: 245-254 - 2003
- [j36]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): 1175-1192 (2003) - [c46]Adnan Aziz, Amit Prakash, Vijaya Ramachandran:
A near optimal scheduler for switch-memory-switch routers. SPAA 2003: 343-352 - [c45]Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy J. Warnow:
Better Hill-Climbing Searches for Parsimony. WABI 2003: 245-258 - 2002
- [j35]Madhukar R. Korupolu, Vijaya Ramachandran:
Quasi-Fully Dynamic Algorithms for Two-Connectivity and Cycle Equivalence. Algorithmica 33(2): 168-182 (2002) - [j34]Seth Pettie, Vijaya Ramachandran:
An optimal minimum spanning tree algorithm. J. ACM 49(1): 16-34 (2002) - [j33]Vijaya Ramachandran, Ramesh K. Sitaraman:
SPAA 1999 - Guest Editors' Foreword. Theory Comput. Syst. 35(2): 97 (2002) - [j32]Seth Pettie, Vijaya Ramachandran:
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest. SIAM J. Comput. 31(6): 1879-1895 (2002) - [c44]Seth Pettie, Vijaya Ramachandran, Srinath Sridhar:
Experimental Evaluation of a New Shortest Path Algorithm. ALENEX 2002: 126-142 - [c43]Rezaul Alam Chowdhury, Vijaya Ramachandran:
Improved Distance Oracles for Avoiding Link-Failure. ISAAC 2002: 523-534 - [c42]Seth Pettie, Vijaya Ramachandran:
Computing shortest paths with comparisons and additions. SODA 2002: 267-276 - [c41]Seth Pettie, Vijaya Ramachandran:
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms. SODA 2002: 713-722 - [c40]Xiaoyu Zhang, Chandrajit Bajaj, Vijaya Ramachandran:
Parallel and Out-of-core View-dependent Isocontour Visualization Using Random Data Distribution. VisSym 2002: 9-18 - 2001
- [c39]Vijaya Ramachandran:
Parallel Algorithm Design with Coarse-Grained Synchronization. International Conference on Computational Science (2) 2001: 619-627 - 2000
- [c38]Seth Pettie, Vijaya Ramachandran:
An Optimal Minimum Spanning Tree Algorithm. ICALP 2000: 49-60
1990 – 1999
- 1999
- [j31]Micah Adler, Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
Modeling Parallel Bandwidth: Local versus Global Restrictions. Algorithmica 24(3-4): 381-404 (1999) - [j30]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): 327-359 (1999) - [c37]Brian Grayson, Michael Dahlin, Vijaya Ramachandran:
Experimental Evaluation of QSM, a Simple Shared-Memory Model. IPPS/SPDP 1999: 130-136 - [c36]Seth Pettie, Vijaya Ramachandran:
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest. RANDOM-APPROX 1999: 233-244 - [c35]Vijaya Ramachandran, Brian Grayson, Michael Dahlin:
Emulations Between QSM, BSP, and LogP: A Framework for General-Purpose Parallel Algorithm Design. SODA 1999: 957-958 - [e2]Gary L. Miller, Vijaya Ramachandran:
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '99, Saint-Malo, France, June 27-30, 1999. ACM 1999, ISBN 1-58113-124-0 [contents] - 1998
- [j29]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): 733-769 (1998) - [j28]Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
The Queue-Read Queue-Write Asynchronous PRAM Model. Theor. Comput. Sci. 196(1-2): 3-29 (1998) - [j27]Philip D. MacKenzie, Vijaya Ramachandran:
ERCW PRAMs and Optical Communication. Theor. Comput. Sci. 196(1-2): 153-180 (1998) - [c34]Philip D. MacKenzie, Vijaya Ramachandran:
Computational Bounds for Fundamental Problems on General-Purpose Parallel Models. SPAA 1998: 152-163 - 1997
- [j26]Vijaya Ramachandran, Honghua Yang:
An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem. Algorithmica 18(3): 384-404 (1997) - [j25]Valerie King, Chung Keung Poon, Vijaya Ramachandran, Santanu Sinha:
An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification. Inf. Process. Lett. 62(3): 153-159 (1997) - [j24]Vijaya Ramachandran:
Parallel Algorithms for Reducible Flow Graphs. J. Algorithms 23(1): 1-31 (1997) - [c33]Madhukar R. Korupolu, Vijaya Ramachandran:
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems. ESA 1997: 326-340 - [c32]Vijaya Ramachandran:
QSM: A General Purpose Shared-Memory Model for Parallel Computation. FSTTCS 1997: 1-5 - [c31]Chung Keung Poon, Vijaya Ramachandran:
A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest. ISAAC 1997: 212-222 - [c30]Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
Can Shared-Memory Model Serve as a Bridging Model for Parallel Computation? SPAA 1997: 72-83 - [c29]Micah Adler, Phillip B. Gibbons, Vijaya Ramachandran, Yossi Matias:
Modeling Parallel Bandwidth: Local vs. Global Restrictions. SPAA 1997: 94-105 - 1996
- [j23]Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
Efficient Low-Contention Parallel Algorithms. J. Comput. Syst. Sci. 53(3): 417-442 (1996) - [j22]Vijaya Ramachandran, Honghua Yang:
An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem. SIAM J. Comput. 25(2): 312-339 (1996) - [j21]Tsan-sheng Hsu, Vijaya Ramachandran:
Efficient Massively Parallel Implementation of some Combinatorial Algorithms. Theor. Comput. Sci. 162(2): 297-322 (1996) - [c28]Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
The Queue-Read Queue-Write Asynchronous PRAM Model. Euro-Par, Vol. II 1996: 279-292 - [c27]Philip D. MacKenzie, Vijaya Ramachandran:
ERCW PRAMs and Optical Communication. Euro-Par, Vol. II 1996: 293-302 - [c26]Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
Asynchrony versus Bulk-Synchrony in QRQW PRAM model (Abstract). PODC 1996: 176 - 1995
- [j20]Pierre Kelsen, Vijaya Ramachandran:
On Finding Minimal Two-Connected Subgraphs. J. Algorithms 18(1): 1-49 (1995) - [j19]Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan:
Computing Minimal Spanning Subgraphs in Linear Time. SIAM J. Comput. 24(6): 1332-1358 (1995) - [c25]Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean:
Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing. IPPS 1995: 106-112 - 1994
- [j18]Vijaya Ramachandran, Honghua Yang:
Finding the Closed Partition of a Planar Graph. Algorithmica 11(5): 443-468 (1994) - [j17]Jerry L. Trahan, Vijaya Ramachandran, Michael C. Loui:
Parallel Random Access Machines with both Multiplication and Shifts. Inf. Comput. 110(1): 96-118 (1994) - [j16]Vijaya Ramachandran, John H. Reif:
Planarity Testing in Parallel. J. Comput. Syst. Sci. 49(3): 517-561 (1994) - [c24]Vijaya Ramachandran:
The Design and Evaluation of Parallel Algorithms (Abstract). ACM Conference on Computer Science 1994: 413 - [c23]Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean:
Parallel implementation of algorithms for finding connected components in graphs. Parallel Algorithms 1994: 23-41 - [c22]Vijaya Ramachandran, Honghua Yang:
An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem. SODA 1994: 622-631 - [c21]Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
The QRQW PRAM: Accounting for Contention in Parallel Algorithms. SODA 1994: 638-648 - [c20]Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran:
Efficient Low-Contention Parallel Algorithms. SPAA 1994: 236-247 - 1993
- [j15]Donald S. Fussell, Vijaya Ramachandran, Ramakrishna Thurimella:
Finding Triconnected Components by Local Replacement. SIAM J. Comput. 22(3): 587-616 (1993) - [j14]Tsan-sheng Hsu, Vijaya Ramachandran:
Finding a Smallest Augmentation to Biconnect a Graph. SIAM J. Comput. 22(5): 889-912 (1993) - [c19]Vijaya Ramachandran, Honghua Yang:
An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem. ESA 1993: 321-332 - [e1]Vijaya Ramachandran:
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 25-27 January 1993, Austin, Texas, USA. ACM/SIAM 1993, ISBN 0-89791-562-3 [contents] - 1992
- [j13]Gary L. Miller, Vijaya Ramachandran:
A new graph triconnectivity algorithm and its parallelization. Comb. 12(1): 53-76 (1992) - [j12]Jerry L. Trahan, Michael C. Loui, Vijaya Ramachandran:
Multiplication, Division and Shift Instructions in Parallel Random Access Machines. Theor. Comput. Sci. 100(1): 1-44 (1992) - [c18]Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean:
Implementation of Parallel Graph Algorithms on the MasPar. Computational Support for Discrete Mathematics 1992: 165-198 - [c17]Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan:
Computing Minimal Spanning Subgraphs in Linear Time. SODA 1992: 146-156 - 1991
- [j11]Phillip B. Gibbons, Richard M. Karp, Vijaya Ramachandran, Danny Soroker, Robert Endre Tarjan:
Transitive Compaction in Parallel via Branchings. J. Algorithms 12(1): 110-125 (1991) - [j10]Arkady Kanevsky, Vijaya Ramachandran:
Improved Algorithms for Graph Four-Connectivity. J. Comput. Syst. Sci. 42(3): 288-306 (1991) - [c16]Tsan-sheng Hsu, Vijaya Ramachandran:
A Linear Time Algorithm for Triconnectivity Augmentation (Extended Abstract). FOCS 1991: 548-559 - [c15]Tsan-sheng Hsu, Vijaya Ramachandran:
On Finding a Smallest Augmentation to Biconnect a Graph. ISA 1991: 326-335 - [c14]Pierre Kelsen, Vijaya Ramachandran:
On Finding Minimal 2-Connected Subgraphs. SODA 1991: 178-187 - [c13]Vijaya Ramachandran, Li-Chung Wang:
Parallel algorithm and complexity results for telephone link simulation. SPDP 1991: 378-385 - 1990
- [j9]George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran:
Linear Programming with Two Variables per Inequality in Poly-Log Time. SIAM J. Comput. 19(6): 1000-1010 (1990) - [j8]Vijaya Ramachandran:
A Minimax Arc Theorem for Reducible Flow Graphs. SIAM J. Discret. Math. 3(4): 554-560 (1990) - [c12]Faith E. Fich, Vijaya Ramachandran:
Lower Bounds for Parallel Computation on Linked Structures. SPAA 1990: 109-116 - [p1]Richard M. Karp, Vijaya Ramachandran:
Parallel Algorithms for Shared-Memory Machines. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 869-942
1980 – 1989
- 1989
- [c11]Jerry L. Trahan, Michael C. Loui, Vijaya Ramachandran:
The Power of Parallel Random Access Machines with Augmented Instruction Sets. SCT 1989: 97-103 - [c10]Vijaya Ramachandran, John H. Reif:
An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract). FOCS 1989: 282-287 - [c9]Donald S. Fussell, Vijaya Ramachandran, Ramakrishna Thurimella:
Finding Triconnected Components by Local Replacements. ICALP 1989: 379-393 - [c8]Vijaya Ramachandran:
A Framework for Parallel Graph Algorithm Design. Optimal Algorithms 1989: 33-40 - 1988
- [j7]Paul Czerwinski, Vijaya Ramachandran:
Optimal VLSI Graph Embeddings in Variable Aspect Ratio Rectangles. Algorithmica 3: 487-510 (1988) - [j6]Vijaya Ramachandran:
Finding a Minimum Feedback Arc Set in Reducible Flow Graphs. J. Algorithms 9(3): 299-313 (1988) - [j5]Gary L. Miller, Vijaya Ramachandran, Erich L. Kaltofen:
Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits. SIAM J. Comput. 17(4): 687-695 (1988) - [c7]Vijaya Ramachandran, Uzi Vishkin:
Efficient Parallel Triconnectivity in Logarithmic Time. AWOC 1988: 33-42 - 1987
- [j4]Vijaya Ramachandran:
The complexity of minimum cut and maximum flow problems in an acyclic network. Networks 17(4): 387-392 (1987) - [c6]Arkady Kanevsky, Vijaya Ramachandran:
Improved Algorithms for Graph Four-Connectivity. FOCS 1987: 252-259 - [c5]Gary L. Miller, Vijaya Ramachandran:
A New Graph Triconnectivity Algorithm and Its Parallelization. STOC 1987: 335-344 - 1986
- [j3]Vijaya Ramachandran:
On driving many long wires in a VLSI layout. J. ACM 33(4): 687-701 (1986) - [j2]Vijaya Ramachandran:
Algorithmic Aspects of MOS VLSI Switch-Level Simulation with Race Detection. IEEE Trans. Computers 35(5): 462-475 (1986) - [c4]Gary L. Miller, Vijaya Ramachandran, Erich L. Kaltofen:
Efficient Parallel Evaluation of Straight-line Code and Arithmetric Circuits. Aegean Workshop on Computing 1986: 236-245 - [c3]George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran:
Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version). STOC 1986: 196-205 - 1983
- [j1]Vijaya Ramachandran:
Single Residue Error Correction in Residue Number Systems. IEEE Trans. Computers 32(5): 504-507 (1983) - [c2]Vijaya Ramachandran:
An improved switch-level simulator for MOS circuits. DAC 1983: 293-299 - 1982
- [c1]Vijaya Ramachandran:
On Driving Many Long Lines in a VLSI Layout. FOCS 1982: 369-378
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-02 18:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
