Current Research InterestsMy primary research interest is in algorithm design and analysis, and my currentresearch interests are in graph algorithms, parallel and distributed computing, and fine-grained complexity. Postscript and Adobe pdf files of some of my recent papers are available below. Most of my papers are alsoavailable from online copies of journals and conferences. Copyright Disclaimer The documents available from this site are provided as ameans to ensure timely dissemination of technical work on a non-commercialbasis. The electronic version of some of the worksavailable from this site may differ from the definitive published version.Papers appearing in journals and conference proceedings are protected bythe associated copyrights, and files posted here are for personal scholarlyuse only.Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder (ACM, Springer-Verlag, Elsevier, etc.). Permission to make digital or hard copies of part or all of these works for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage. Recent Papers Vijaya Ramachandran, Elaine Shi, ``Data oblivious algorithms formulticores,'' Proc. ACM SPAA, July 2021, pp. 373-384.arXiv:2008.00332, August 2020.[PDF file] Udit Agarwal, Vijaya Ramachandran, ``Faster Deterministic All Pairs Shortest Paths in Congest Model,'' Proc. ACM SPAA, July 2020, pp. 11-21. (Best paper nominee.) Udit Agarwal, Vijaya Ramachandran, ``Distributed weighted all pairs shortest paths through pipelining,'' Proc. IEEE IPDPS, May 2019.[PDF file]A round-efficient distributed betweenness centrality algorithmLoc Hoang, Matteo Pontecorvi, Roshan Dathathri, Gurbinder Gill, Bozhi You, Keshav Pingali, Vijaya RamachandranPPoPP '19 Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming, 2019A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) RoundsUdit Agarwal, Vijaya Ramachandran, Valerie King, Matteo PontecorviPODC '18 Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018Fine-grained complexity for sparse graphsUdit Agarwal, Vijaya RamachandranSTOC 2018 Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in GraphsRezaul A. Chowdhury, Vijaya RamachandranACM Transactions on Algorithms (TALG), 2018Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers: Extended AbstractRichard Cole, Vijaya RamachandranSPAA '17 Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017Resource Oblivious Sorting on MulticoresRichard Cole, Vijaya RamachandranACM Transactions on Parallel Computing (TOPC) - Special Issue on PPoPP 2015 and Regular Papers, 2017 Udit Agarwal, Vijaya Ramachandran,``Finding k simple paths and cycles,''Proc. Intl. Symp. on Algorithms and Computation (ISAAC), December 2016.[PDF file] Matteo Pontecorvi, Vijaya Ramachandran,``Fully dynamic betweenness centrality,''Proc. Intl. Symp. on Algorithms and Computation (ISAAC), December 2015.[PDF file] Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran,``Decremental all-pairs all shortest paths and betweenness centrality,''Proc. Intl. Symp. on Algorithms and Computation (ISAAC), December 2014.[PDF file] Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran,``Betweenness centrality --- Incremental and faster,''arXiv:1311.2147v3, 2013. Refereed conference version in Proc. Math. Foundations of Comp. Sci. (MFCS), August 2014. [PDF file]R.A. Chowdhury, V. Ramachandran, F. Silvestri, B. Blakeley,``Oblivious algorithms for multicores and network of processors''Jour. of Parallel and Distributed Processing, Vol 73, pp. 911-925, 2013.[PDF file]R. Cole and V. Ramachandran,``Analysis of randomized work-stealing with false sharing,''Proc 27th IPDPS, 2013.[PDF file]F. Ellen, V. Ramachandran, and P. Woelfel,``Efficient Fetch-and-Increment,''Proc. DISC 2012, LNCS 7611, pp. 16-30, 2012.[PDF file]R. Cole and V. Ramachandran,``Efficient resource oblivious algorithms for multicores with false sharing,''IPDPS 2012.[PDF file]A. Katti and V. Ramachandran,``Competitive cache replacement strategies for shared cache environments,''IPDPS 2012.[PDF file][A. Katti Masters Thesis]R. Cole and V. Ramachandran,``Revisiting the cache miss analysis of multithreaded algorithms,''LATIN 2012.[PDF file][full manuscript PDF]R. Cole and V. Ramachandran,``Resource-oblivious sorting on multicores,'' Proc. International Colloquium of Automata, Languages and Programming(ICALP), Track A,Springer LNCS Volume 6198, pp. 226-237, 2010.[PDF file] A universal construction for wait-free transaction friendly data structuresPhong Chuong, Faith Ellen, Vijaya RamachandranSPAA '10 Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures, 2010R. A. Chowdhury, V. Ramachandran,``The cache-oblivious Gaussian elimination paradigm: Theoreticalframework, parallelization and experimental evaluation.''Theory of Computing Systems, 47(1):878--919, 2010.Special Issue for SPAA 2007.[PDF file]Cache-Oblivious Dynamic Programming for BioinformaticsRezaul Alan Chowdhury, Hai-Son Le, Vijaya RamachandranIEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), 2010Parallelizing dynamic information flow trackingOlatunji Ruwase, Phillip B. Gibbons, Todd C. Mowry, Vijaya Ramachandran, Shimin Chen, Michael Kozuch, Michael RyanSPAA '08 Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, 2008`Cache-efficient dynamic programming algorithms for multicoresRezaul Alam Chowdhury, Vijaya RamachandranSPAA '08 Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, 2008Randomized minimum spanning tree algorithms using exponentially fewer random bitsSeth Pettie, Vijaya RamachandranACM Transactions on Algorithms (TALG), 2008G. Blelloch, R. A. Chowdhury, P. Gibbons, V. Ramachandran, S. Chen,M. Kozuch, ``Provably good multicore cache performance for divide-and-conqueralgorithms,'' Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA),pp. 501-510, 2008.[PDF file]Parallelizing dynamic information flow trackingOlatunji Ruwase, Phillip B. Gibbons, Todd C. Mowry, Vijaya Ramachandran, Shimin Chen, Michael Kozuch, Michael RyanSPAA '08 Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, 2008C. Demetrescu, M. Thorup, R. Chowdhury, V. Ramachandran,``Oracles for distances avoiding a failed node or link",SIAM Journal on Computing, vol. 37, no. 5, pp. 1299-1318, 2008.[PDF file]The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluationRezaul Alam Chowdhury, Vijaya RamachandranSPAA '07 Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, 2007D. Fernholz, V. Ramachandran,``The $k$-orientability thresholds for $G_n,p$.''Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 459-468, January 2007.[PDF file]`D. Fernholz, V. Ramachandran, ``The diameter of sparse random graphs,''Random Structures and Algorithms (RSA), vol. 31, no. 4, pp. 482-516, 2007.[PDF file] Selected Papers 2006 and Earlier Pattern Identification in BiogeographyGaneshkumar Ganapathy, Barbara Goodson, Robert Jansen, Hai-son Le, Vijaya Ramachandran, Tandy WarnowIEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), 2006R. A. Chowdhury, V. Ramachandran,``Cache-oblivious dynamic programming.''Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2006.[pdf file] S. Pettie, V. Ramachandran, ``A shortest path algorithm forreal-weighted undirected graphs,'' SIAM Journal on Computing,34(6):1398--1431, 2005.[PDF file] D. Fernholz, V. Ramachandran,"Cores and connectivity in sparse random graphs".Technical report TR04-13, 2004.[Postscript file] [PDF file] D. Fernholz, V. Ramachandran,"The giant $k$-core of a random graph with a specified degree sequence,"unpublished manuscript, November 2003.[Postscript file] [PDF file] R. A. Chowdhury, V. Ramachandran,"External-memory exact and approximate all-pairs shortest-paths inundirected graphs."Extended abstract in Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA),January 2005.[pdf file] Cache-oblivious shortest paths in graphs using buffer heapRezaul Alam Chowdhury, Vijaya RamachandranSPAA '04 Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, 2004 A. Prakash, A. Aziz, V. Ramachandran."Randomized Parallel Schedulers for Switch-Memory-Switch Routers:Analysis and Numerical Studies."Extended abstract in Proc. INFOCOM, March 2004.[PDF file] G. Ganapathy, V. Ramachandran, T. Warnow."On Contract-and-Refine Transformations Between Phylogenetic Trees."Extended abstract in Proc. ACM-SIAM SODA, January 2004.[Postscript file] [PDF file] V. Ramachandran, B.Grayson, M. Dahlin. "Emulations between QSM, BSP and LogP: A framework for general-purposeparallel algorithm design."Journal of Parallel and Distributed Computing, vol. 63, 2003, pp. 1175-1192.[PDF file] G. Ganapathy, V. Ramachandran, T. Warnow."Better Hill-Climbing Searches for Parsimony."Proc. Workshop on Algorithms for Bioinformatics (WABI), September 2003, Budapest, Hungary.A near optimal scheduler for switch-memory-switch routersAdnan Aziz, Amit Prakash, Vijaya RamachandranSPAA '03 Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, 2003 X. Zhang, C. Bajaj, V. Ramachandran."Isosurfaces:Parallel and out-of-core view-dependent isocontour visualization usingrandom data distribution."Extended abstract in Proc. Data Visualisation 2002, Eurographics/IEEE TCVFSymposium, Barcelona, Spain 2002, pp. 9-18. S. Pettie, V. Ramachandran, S. Srinath, ``Experimental evaluation ofa new shortest path algorithm,'' UTCS Technical Report TR-01-37, 2001.Proc. 4th Workshop on AlgorithmEngineering and Experiments (ALENEX02), January 2002.[Postscript file] [PDF file]An optimal minimum spanning tree algorithmSeth Pettie, Vijaya RamachandranJournal of the ACM (JACM), 2002 S. Pettie, V. Ramachandran, "A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest."SIAM Journal on Computing, vol. 31, no. 6, pp. 1879-1895, 2002.[PDF file] P. Gibbons, Y. Matias, V. Ramachandran. "Can ashared memory model serve as a bridging model for parallel computation?"Theory of Computing Systems Special Issue on papers from SPAA'97, vol. 32,no. 3, 1999, pp. 327-359.[PDF file] B.Grayson, M. Dahlin, V. Ramachandran. "Experimental evaluation of QSM:A simple shared-memory model."TR98-21, CS dept., Univ. of Texas at Austin, November 1998. (Summaryin Proc. IPPS/SPDP 1999.)[Postscript file] [PDF file] V. Ramachandran. "A general purposeshared-memory model for parallel computation."Algorithms for Parallel Processing, Volume 105, IMA Volumes inMathematics and its Applications, Springer-Verlag, 1999, pp. 1-17.[Postscript file] [PDF file] M. Adler, P. Gibbons, Y. Matias, V. Ramachandran."Modeling parallel bandwidth: Local vs.global restrictions."Algorithmica Special Issue on Coarse Grained Parallel Algorithms,vol. 24, no. 3-4, 1999, pp. 381-404.[Postscript file] [PDF file] P.B. Gibbons, Y. Matias, V. Ramachandran. "Thequeue-read queue-write asynchronous PRAM model."Theoretical Computer Science, vol. 196, 1998, pp. 3-29.[Postscript file] [PDF file] P.D. MacKenzie, V. Ramachandran."ERCW PRAMs and optical communication." Theoretical Computer Science, vol. 196,1998, pp. 153-180.[Postscript file] [PDF file] P. Gibbons, Y. Matias, V. Ramachandran."The QRQW PRAM:Accounting for contention in parallel algorithms." SIAM Journalon Computing, vol. 28, no. 2, pp. 733-769, 1999.[Postscript file] [PDF file]Computational bounds for fundamental problems on general-purpose parallel modelsPhilip D. MacKenzie, Vijaya RamachandranSPAA '98 Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, 1998 C. K. Poon, V. Ramachandran, "A randomized linear work EREW PRAM algorithm to find a minimum spanning forest." Algorithmica, vol. 35, no. 3, pp. 257-268, 2003. (Extended abstract in Proc. 8th Annual International Symposium on Algorithms and Computation (ISAAC '97), Springer-Verlag LNCS vol. 1530, December 1997, pp. 212-222.)
Data Structure Using C By Udit Agarwal Pdf Free
2ff7e9595c
Comments