☰

Vijaya Ramachandran - Publications

Affiliations: 
Computer Sciences University of Texas at Austin, Austin, Texas, U.S.A. 
Area:
Computer Science, Mathematics
Tree Info Similar researchers PubMed Report error

48 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2018 Chowdhury RA, Ramachandran V. Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs Acm Transactions On Algorithms. 14: 1-33. DOI: 10.1145/3147172  0.502
2017 Cole R, Ramachandran V. Resource Oblivious Sorting on Multicores Acm Transactions On Parallel Computing. 3: 1-31. DOI: 10.1145/3040221  0.419
2015 Pontecorvi M, Ramachandran V. Fully dynamic betweenness centrality Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9472: 331-342. DOI: 10.1007/978-3-662-48971-0_29  0.483
2014 Nasre M, Pontecorvi M, Ramachandran V. Betweenness centrality - Incremental and faster Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8635: 577-588. DOI: 10.1007/978-3-662-44465-8_49  0.52
2014 Nasre M, Pontecorvi M, Ramachandran V. Decremental all-pairs ALL shortest paths and betweenness centrality Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8889: 766-778. DOI: 10.1007/978-3-319-13075-0_60  0.517
2013 Cole R, Ramachandran V. Analysis of randomized work stealing with false sharing Proceedings - Ieee 27th International Parallel and Distributed Processing Symposium, Ipdps 2013. 985-998. DOI: 10.1109/IPDPS.2013.86  0.462
2013 Chowdhury RA, Ramachandran V, Silvestri F, Blakeley B. Oblivious algorithms for multicores and networks of processors Journal of Parallel and Distributed Computing. 73: 911-925. DOI: 10.1016/J.Jpdc.2013.04.008  0.519
2010 Chowdhury RA, Le HS, Ramachandran V. Cache-oblivious dynamic programming for bioinformatics. Ieee/Acm Transactions On Computational Biology and Bioinformatics / Ieee, Acm. 7: 495-510. PMID 20671320 DOI: 10.1109/Tcbb.2008.94  0.512
2010 Chowdhury RA, Silvestri F, Blakeley B, Ramachandran V. Oblivious algorithms for multicores and network of processors Proceedings of the 2010 Ieee International Symposium On Parallel and Distributed Processing, Ipdps 2010. DOI: 10.1109/IPDPS.2010.5470354  0.334
2010 Chowdhury RA, Ramachandran V. The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation Theory of Computing Systems \/ Mathematical Systems Theory. 47: 878-919. DOI: 10.1007/S00224-010-9273-8  0.428
2008 Pettie S, Ramachandran V. Randomized minimum spanning tree algorithms using exponentially fewer random bits Acm Transactions On Algorithms. 4. DOI: 10.1145/1328911.1328916  0.714
2008 Demetrescu C, Thorup M, Chowdhury RA, Ramachandran V. Oracles for Distances Avoiding a Failed Node or Link Siam Journal On Computing. 37: 1299-1318. DOI: 10.1137/S0097539705429847  0.448
2007 Ramachandran V. Cache-oblivious computation: Algorithms and experimental evaluation Proceedings - International Conference On Computing: Theory and Applications, Iccta 2007. 20-25. DOI: 10.1109/ICCTA.2007.34  0.464
2006 Ganapathy G, Goodson B, Jansen R, Le HS, Ramachandran V, Warnow T. Pattern identification in biogeography. Ieee/Acm Transactions On Computational Biology and Bioinformatics / Ieee, Acm. 3: 334-46. PMID 17085843 DOI: 10.1109/Tcbb.2006.57  0.402
2005 Pettie S, Ramachandran V. A Shortest Path Algorithm for Real-Weighted Undirected Graphs Siam Journal On Computing. 34: 1398-1431. DOI: 10.1137/S0097539702419650  0.705
2003 Ramachandran V, Grayson B, Dahlin M. Emulations between QSM, BSP and LogP: A framework for general-purpose parallel algorithm design Journal of Parallel and Distributed Computing. 63: 1175-1192. DOI: 10.1016/J.Jpdc.2003.04.001  0.519
2003 Poon CK, Ramachandran V. A randomized linear-work EREW PRAM algorithm to find a minimum spanning forest Algorithmica. 35: 257-268. DOI: 10.1007/S00453-002-0998-X  0.596
2002 Pettie S, Ramachandran V. An optimal minimum spanning tree algorithm Journal of the Acm. 49: 16-34. DOI: 10.1145/505241.505243  0.682
2002 Pettie S, Ramachandran V. A randomized time-work optimal parallel algorithm for finding a minimum spanning forest Siam Journal On Computing. 31: 1879-1895. DOI: 10.1137/S0097539700371065  0.703
2002 Korupolu MR, Ramachandran V. Quasi-Fully Dynamic Algorithms for Two-Connectivity and Cycle Equivalence Algorithmica. 33: 168-182. DOI: 10.1007/S00453-001-0108-5  0.557
2001 Chen K, Ramachandran V. A space-effcient randomized DNA algorithm for k-SAT Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2054: 199-208. DOI: 10.1007/3-540-44992-2_13  0.384
1999 Gibbons PB, Matias Y, Ramachandran V. The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms Siam Journal On Computing. 28: 733-769. DOI: 10.1137/S009753979427491  0.403
1999 Adler M, Gibbons PB, Matias Y, Ramachandran V. Modeling Parallel Bandwidth: Local versus Global Restrictions Algorithmica. 24: 381-404. DOI: 10.1007/Pl00008269  0.415
1997 King V, Poon CK, Ramachandran V, Sinha S. An optimal EREW PRAM algorithm for minimum spanning tree verification Information Processing Letters. 62: 153-159. DOI: 10.1016/S0020-0190(97)00050-1  0.622
1997 Ramachandran V, Yang H. An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem Algorithmica. 18: 384-404. DOI: 10.1007/Pl00009162  0.481
1997 Ramachandran V. Parallel Algorithms for Reducible Flow Graphs Journal of Algorithms. 23: 1-31. DOI: 10.1006/Jagm.1996.0820  0.554
1996 Ramachandran V, Yang H. An Efficient Parallel Algorithm for the General Planar MonotoneCircuit Value Problem Siam Journal On Computing. 25: 312-339. DOI: 10.1137/S0097539793260775  0.547
1996 Hsu T, Ramachandran V. Efficient massively parallel implementation of some combinatorial algorithms Theoretical Computer Science. 162: 297-322. DOI: 10.1016/0304-3975(96)00034-5  0.421
1996 Gibbons PB, Matias Y, Ramachandran V. Efficient Low-Contention Parallel Algorithms Journal of Computer and System Sciences. 53: 417-442. DOI: 10.1006/jcss.1996.0079  0.402
1995 Han X, Kelsen P, Ramachandran V, Tarjan R. Computing Minimal Spanning Subgraphs in Linear Time Siam Journal On Computing. 24: 1332-1358. DOI: 10.1137/S0097539791224509  0.598
1995 Kelsen P, Ramachandran V. On Finding Minimal Two-Connected Subgraphs Journal of Algorithms. 18: 1-49. DOI: 10.1006/Jagm.1995.1001  0.519
1994 Ramachandran V, Reif J. Planarity testing in parallel Journal of Computer and System Sciences. 49: 517-561. DOI: 10.1016/S0022-0000(05)80070-4  0.449
1994 Ramachandran V, Yang H. Finding the closed partition of a planar graph Algorithmica. 11: 443-468. DOI: 10.1007/Bf01293266  0.58
1994 Trahan JL, Ramachandran V, Loui MC. Parallel Random Access Machines with both Multiplication and Shifts Information and Computation. 110: 96-118. DOI: 10.1006/Inco.1994.1025  0.321
1993 Ramachandran V. Randomization in parallel algorithms Statistical Science. 8: 65-69. DOI: 10.1214/ss/1177011085  0.455
1993 Hsu T, Ramachandran V. Finding a smallest augmentation to biconnect a graph Siam Journal On Computing. 22: 889-912. DOI: 10.1137/0222056  0.601
1993 Fussell D, Ramachandran V, Thurimella R. Finding Triconnected Components by Local Replacement Siam Journal On Computing. 22: 587-616. DOI: 10.1137/0222040  0.593
1992 Buss S, Cook S, Gupta A, Ramachandran V. An optimal parallel algorithm for formula evaluation Siam Journal On Computing. 21: 755-780. DOI: 10.1137/0221046  0.456
1992 Trahan JL, Loui MC, Ramachandran V. Multiplication, division, and shift instructions in parallel random access machines Theoretical Computer Science. 100: 1-44. DOI: 10.1016/0304-3975(92)90362-J  0.325
1992 Miller GL, Ramachandran V. A new graph triconnectivity algorithm and its parallelization Combinatorica. 12: 53-76. DOI: 10.1007/Bf01191205  0.584
1991 Gibbons P, Karp R, Ramachandran V, Soroker D, Tarjan R. Transitive compaction in parallel via branchings Journal of Algorithms. 12: 110-125. DOI: 10.1016/0196-6774(91)90026-U  0.577
1991 Kanevsky A, Ramachandran V. Improved algorithms for graph four- connectivity Journal of Computer and System Sciences. 42: 288-306. DOI: 10.1016/0022-0000(91)90004-O  0.561
1990 Lueker GS, Megiddo N, Ramachandran V. Linear programming with two variables per inequality in poly-log time Siam Journal On Computing. 19: 1000-1010. DOI: 10.1137/0219068  0.455
1989 Ramachandran V. A Framework for Parallel Graph Algorithm Design Lecture Notes in Computer Science. 401: 33-40. DOI: 10.1007/3-540-51859-2_5  0.54
1988 Miller GL, Ramachandran V, Kaltofen E. Efficient parallel evaluation of straight-line code and arithmetic circuits Siam Journal On Computing. 17: 687-695. DOI: 10.1137/0217044  0.468
1988 Ramachandran V. Finding a minimum feedback arc set in reducible flow graphs Journal of Algorithms. 9: 299-313. DOI: 10.1016/0196-6774(88)90022-3  0.494
1988 Shankar N, Ramachandran V. Efficient parallel circuits and algorithms for division Information Processing Letters. 29: 307-313. DOI: 10.1016/0020-0190(88)90230-X  0.506
1988 Czerwinski P, Ramachandran V. Optimal VLSI graph embeddings in variable aspect ratio rectangles Algorithmica. 3: 487-510. DOI: 10.1007/Bf01762128  0.359
Show low-probability matches.