dblp.uni-trier.dewww.uni-trier.de

Vijaya Ramachandran

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
96EEShimin Chen, Michael Kozuch, Theodoros Strigkos, Babak Falsafi, Phillip B. Gibbons, Todd C. Mowry, Vijaya Ramachandran, Olatunji Ruwase, Michael Ryan, Evangelos Vlachos: Flexible Hardware Acceleration for Instruction-Grain Program Monitoring. ISCA 2008: 377-388
95EEGuy 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
94EERezaul Alam Chowdhury, Vijaya Ramachandran: Cache-efficient dynamic programming algorithms for multicores. SPAA 2008: 207-216
93EEOlatunji Ruwase, Phillip B. Gibbons, Todd C. Mowry, Vijaya Ramachandran, Shimin Chen, Michael Kozuch, Michael Ryan: Parallelizing dynamic information flow tracking. SPAA 2008: 35-45
92EEVijaya Ramachandran: Randomized Minimum Spanning Tree. Encyclopedia of Algorithms 2008
91EESeth Pettie, Vijaya Ramachandran: Randomized minimum spanning tree algorithms using exponentially fewer random bits. ACM Transactions on Algorithms 4(1): (2008)
90EECamil 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)
2007
89EEVijaya Ramachandran: Cache-Oblivious Computation: Algorithms and Experimental Evaluation. ICCTA 2007: 20-26
88EEDaniel Fernholz, Vijaya Ramachandran: The k-orientability thresholds for Gn, p. SODA 2007: 459-468
87EERezaul Alam Chowdhury, Vijaya Ramachandran: The cache-oblivious gaussian elimination paradigm: theoretical framework, parallelization and experimental evaluation. SPAA 2007: 71-80
86EEDaniel Fernholz, Vijaya Ramachandran: The diameter of sparse random graphs. Random Struct. Algorithms 31(4): 482-516 (2007)
2006
85EERezaul Alam Chowdhury, Vijaya Ramachandran: Cache-oblivious dynamic programming. SODA 2006: 591-600
84EERezaul Alam Chowdhury, Vijaya Ramachandran: The cache-oblivious gaussian elimination paradigm: theoretical framework and experimental evaluation. SPAA 2006: 236
83EEGaneshkumar Ganapathy, Barbara Goodson, Robert K. Jansen, Hai-son Le, Vijaya Ramachandran, Tandy Warnow: Pattern Identification in Biogeography. IEEE/ACM Trans. Comput. Biology Bioinform. 3(4): 334-346 (2006)
2005
82EERezaul Alam Chowdhury, Vijaya Ramachandran: External-memory exact and approximate all-pairs shortest-paths in undirected graphs. SODA 2005: 735-744
81EEGaneshkumar Ganapathy, Barbara Goodson, Robert K. Jansen, Vijaya Ramachandran, Tandy Warnow: Pattern Identification in Biogeography. WABI 2005: 116-127
80EESeth Pettie, Vijaya Ramachandran: A Shortest Path Algorithm for Real-Weighted Undirected Graphs. SIAM J. Comput. 34(6): 1398-1431 (2005)
2004
79EEAmit Prakash, Adnan Aziz, Vijaya Ramachandran: Randomized Parallel Schedulers for Switch-Memory-Switch Routers: Analysis and Numerical Studies. INFOCOM 2004
78EEGaneshkumar Ganapathy, Vijaya Ramachandran, Tandy Warnow: On contract-and-refine transformations between phylogenetic trees. SODA 2004: 900-909
77EERezaul Alam Chowdhury, Vijaya Ramachandran: Cache-oblivious shortest paths in graphs using buffer heap. SPAA 2004: 245-254
2003
76EEAdnan Aziz, Amit Prakash, Vijaya Ramachandran: A near optimal scheduler for switch-memory-switch routers. SPAA 2003: 343-352
75EEGaneshkumar Ganapathy, Vijaya Ramachandran, Tandy Warnow: Better Hill-Climbing Searches for Parsimony. WABI 2003: 245-258
74EEVijaya Ramachandran, Brian Grayson, Michael Dahlin: Emulations between QSM, BSP and LogP: a framework for general-purpose parallel algorithm design. J. Parallel Distrib. Comput. 63(12): 1175-1192 (2003)
2002
73EESeth Pettie, Vijaya Ramachandran, Srinath Sridhar: Experimental Evaluation of a New Shortest Path Algorithm. ALENEX 2002: 126-142
72EERezaul Alam Chowdhury, Vijaya Ramachandran: Improved Distance Oracles for Avoiding Link-Failure. ISAAC 2002: 523-534
71EESeth Pettie, Vijaya Ramachandran: Computing shortest paths with comparisons and additions. SODA 2002: 267-276
70EESeth Pettie, Vijaya Ramachandran: Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms. SODA 2002: 713-722
69EEMadhukar R. Korupolu, Vijaya Ramachandran: Quasi-Fully Dynamic Algorithms for Two-Connectivity and Cycle Equivalence. Algorithmica 33(2): 168-182 (2002)
68EESeth Pettie, Vijaya Ramachandran: An optimal minimum spanning tree algorithm. J. ACM 49(1): 16-34 (2002)
67EESeth Pettie, Vijaya Ramachandran: A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest. SIAM J. Comput. 31(6): 1879-1895 (2002)
66EEVijaya Ramachandran, Ramesh K. Sitaraman: SPAA 1999 - Guest Editors' Foreword. Theory Comput. Syst. 35(2): 97 (2002)
2001
65EEVijaya Ramachandran: Parallel Algorithm Design with Coarse-Grained Synchronization. International Conference on Computational Science (2) 2001: 619-627
2000
64EESeth Pettie, Vijaya Ramachandran: An Optimal Minimum Spanning Tree Algorithm. ICALP 2000: 49-60
1999
63EEBrian Grayson, Michael Dahlin, Vijaya Ramachandran: Experimental Evaluation of QSM, a Simple Shared-Memory Model. IPPS/SPDP 1999: 130-
62 Seth Pettie, Vijaya Ramachandran: A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest. RANDOM-APPROX 1999: 233-244
61EEVijaya Ramachandran, Brian Grayson, Michael Dahlin: Emulations Between QSM, BSP, and LogP: A Framework for General-Purpose Parallel Algorithm Design. SODA 1999: 957-958
60EEMicah Adler, Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran: Modeling Parallel Bandwidth: Local versus Global Restrictions. Algorithmica 24(3-4): 381-404 (1999)
59EEPhillip 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)
1998
58EEPhilip D. MacKenzie, Vijaya Ramachandran: Computational Bounds for Fundamental Problems on General-Purpose Parallel Models. SPAA 1998: 152-163
57 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)
56EEPhilip D. MacKenzie, Vijaya Ramachandran: ERCW PRAMs and Optical Communication. Theor. Comput. Sci. 196(1-2): 153-180 (1998)
55EEPhillip B. Gibbons, Yossi Matias, Vijaya Ramachandran: The Queue-Read Queue-Write Asynchronous PRAM Model. Theor. Comput. Sci. 196(1-2): 3-29 (1998)
1997
54 Madhukar R. Korupolu, Vijaya Ramachandran: Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems. ESA 1997: 326-340
53EEVijaya Ramachandran: QSM: A General Purpose Shared-Memory Model for Parallel Computation. FSTTCS 1997: 1-5
52 Chung Keung Poon, Vijaya Ramachandran: A Randomized Linear Work EREW PRAM Algorithm to Find a Minimum Spanning Forest. ISAAC 1997: 212-222
51EEPhillip B. Gibbons, Yossi Matias, Vijaya Ramachandran: Can Shared-Memory Model Serve as a Bridging Model for Parallel Computation? SPAA 1997: 72-83
50EEMicah Adler, Phillip B. Gibbons, Vijaya Ramachandran, Yossi Matias: Modeling Parallel Bandwidth: Local vs. Global Restrictions. SPAA 1997: 94-105
49 Vijaya Ramachandran, Honghua Yang: An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem. Algorithmica 18(3): 384-404 (1997)
48EEValerie 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)
47 Vijaya Ramachandran: Parallel Algorithms for Reducible Flow Graphs. J. Algorithms 23(1): 1-31 (1997)
1996
46 Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran: The Queue-Read Queue-Write Asynchronous PRAM Model. Euro-Par, Vol. II 1996: 279-292
45 Philip D. MacKenzie, Vijaya Ramachandran: ERCW PRAMs and Optical Communication. Euro-Par, Vol. II 1996: 293-302
44 Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran: Asynchrony versus Bulk-Synchrony in QRQW PRAM model (Abstract). PODC 1996: 176
43 Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran: Efficient Low-Contention Parallel Algorithms. J. Comput. Syst. Sci. 53(3): 417-442 (1996)
42 Vijaya Ramachandran, Honghua Yang: An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem. SIAM J. Comput. 25(2): 312-339 (1996)
41EETsan-sheng Hsu, Vijaya Ramachandran: Efficient Massively Parallel Implementation of some Combinatorial Algorithms. Theor. Comput. Sci. 162(2): 297-322 (1996)
1995
40EETsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean: Implementation of parallel graph algorithms on a massively parallel SIMD computer with virtual processing. IPPS 1995: 106-112
39 Pierre Kelsen, Vijaya Ramachandran: On Finding Minimal Two-Connected Subgraphs. J. Algorithms 18(1): 1-49 (1995)
38 Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan: Computing Minimal Spanning Subgraphs in Linear Time. SIAM J. Comput. 24(6): 1332-1358 (1995)
1994
37EEVijaya Ramachandran: The Design and Evaluation of Parallel Algorithms (Abstract). ACM Conference on Computer Science 1994: 413
36 Vijaya Ramachandran, Honghua Yang: An Efficient Parallel Algorithm for the General Planar Monotone Circuit Value Problem. SODA 1994: 622-631
35 Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran: The QRQW PRAM: Accounting for Contention in Parallel Algorithms. SODA 1994: 638-648
34EEPhillip B. Gibbons, Yossi Matias, Vijaya Ramachandran: Efficient Low-Contention Parallel Algorithms. SPAA 1994: 236-247
33 Vijaya Ramachandran, Honghua Yang: Finding the Closed Partition of a Planar Graph. Algorithmica 11(5): 443-468 (1994)
32 Jerry L. Trahan, Vijaya Ramachandran, Michael C. Loui: Parallel Random Access Machines with both Multiplication and Shifts Inf. Comput. 110(1): 96-118 (1994)
31 Vijaya Ramachandran, John H. Reif: Planarity Testing in Parallel. J. Comput. Syst. Sci. 49(3): 517-561 (1994)
1993
30 Vijaya Ramachandran, Honghua Yang: An Efficient Parallel Algorithm for the Layered Planar Monotone Circuit Value Problem. ESA 1993: 321-332
29 Donald S. Fussell, Vijaya Ramachandran, Ramakrishna Thurimella: Finding Triconnected Components by Local Replacement. SIAM J. Comput. 22(3): 587-616 (1993)
28 Tsan-sheng Hsu, Vijaya Ramachandran: Finding a Smallest Augmentation to Biconnect a Graph. SIAM J. Comput. 22(5): 889-912 (1993)
1992
27EEXiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, Robert Endre Tarjan: Computing Minimal Spanning Subgraphs in Linear Time. SODA 1992: 146-156
26 Gary L. Miller, Vijaya Ramachandran: A new graph triconnectivity algorithm and its parallelization. Combinatorica 12(1): 53-76 (1992)
25 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)
1991
24 Tsan-sheng Hsu, Vijaya Ramachandran: A Linear Time Algorithm for Triconnectivity Augmentation (Extended Abstract) FOCS 1991: 548-559
23 Tsan-sheng Hsu, Vijaya Ramachandran: On Finding a Smallest Augmentation to Biconnect a Graph. ISA 1991: 326-335
22 Pierre Kelsen, Vijaya Ramachandran: On Finding Minimal 2-Connected Subgraphs. SODA 1991: 178-187
21 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)
20 Arkady Kanevsky, Vijaya Ramachandran: Improved Algorithms for Graph Four-Connectivity. J. Comput. Syst. Sci. 42(3): 288-306 (1991)
1990
19 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
18 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)
17 Vijaya Ramachandran: A Minimax Arc Theorem for Reducible Flow Graphs. SIAM J. Discrete Math. 3(4): 554-560 (1990)
1989
16 Vijaya Ramachandran, John H. Reif: An Optimal Parallel Algorithm for Graph Planarity (Extended Abstract) FOCS 1989: 282-287
15 Donald S. Fussell, Vijaya Ramachandran, Ramakrishna Thurimella: Finding Triconnected Components by Local Replacements. ICALP 1989: 379-393
14 Vijaya Ramachandran: A Framework for Parallel Graph Algorithm Design. Optimal Algorithms 1989: 33-40
13 Jerry L. Trahan, Michael C. Loui, Vijaya Ramachandran: The Power of Parallel Random Access Machines with Augmented Instruction Sets. Structure in Complexity Theory Conference 1989: 97-103
1988
12 Vijaya Ramachandran, Uzi Vishkin: Efficient Parallel Triconnectivity in Logarithmic Time. AWOC 1988: 33-42
11 Paul Czerwinski, Vijaya Ramachandran: Optimal VLSI Graph Embeddings in Variable Aspect Ratio Rectangles. Algorithmica 3: 487-510 (1988)
10 Vijaya Ramachandran: Finding a Minimum Feedback Arc Set in Reducible Flow Graphs. J. Algorithms 9(3): 299-313 (1988)
9 Gary L. Miller, Vijaya Ramachandran, Erich Kaltofen: Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits. SIAM J. Comput. 17(4): 687-695 (1988)
1987
8 Arkady Kanevsky, Vijaya Ramachandran: Improved Algorithms for Graph Four-Connectivity FOCS 1987: 252-259
7 Gary L. Miller, Vijaya Ramachandran: A New Graph Triconnectivity Algorithm and Its Parallelization STOC 1987: 335-344
1986
6 Gary L. Miller, Vijaya Ramachandran, Erich Kaltofen: Efficient Parallel Evaluation of Straight-line Code and Arithmetric Circuits. Aegean Workshop on Computing 1986: 236-245
5 George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran: Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version) STOC 1986: 196-205
4 Vijaya Ramachandran: Algorithmic Aspects of MOS VLSI Switch-Level Simulation with Race Detection. IEEE Trans. Computers 35(5): 462-475 (1986)
3EEVijaya Ramachandran: On driving many long wires in a VLSI layout. J. ACM 33(4): 687-701 (1986)
1983
2 Vijaya Ramachandran: Single Residue Error Correction in Residue Number Systems. IEEE Trans. Computers 32(5): 504-507 (1983)
1982
1 Vijaya Ramachandran: On Driving Many Long Lines in a VLSI Layout FOCS 1982: 369-378

Coauthor Index

1Micah Adler [50] [60]
2Adnan Aziz [76] [79]
3Guy E. Blelloch [95]
4Shimin Chen [93] [95] [96]
5Rezaul Alam Chowdhury [72] [77] [82] [84] [85] [87] [90] [94] [95]
6Paul Czerwinski [11]
7Michael Dahlin [61] [63] [74]
8Nathaniel Dean [40]
9Camil Demetrescu [90]
10Babak Falsafi [96]
11Daniel Fernholz [86] [88]
12Donald S. Fussell [15] [29]
13Ganeshkumar Ganapathy [75] [78] [81] [83]
14Phillip B. Gibbons [21] [34] [35] [43] [44] [46] [50] [51] [55] [57] [59] [60] [93] [95] [96]
15Barbara Goodson [81] [83]
16Brian Grayson [61] [63] [74]
17Xiaofeng Han [27] [38]
18Tsan-sheng Hsu [23] [24] [28] [40] [41]
19Robert K. Jansen [81] [83]
20Erich Kaltofen [6] [9]
21Arkady Kanevsky [8] [20]
22Richard M. Karp [19] [21]
23Pierre Kelsen [22] [27] [38] [39]
24Valerie King [48]
25Madhukar R. Korupolu [54] [69]
26Michael Kozuch [93] [95] [96]
27Hai-son Le [83]
28Michael C. Loui [13] [25] [32]
29George S. Lueker [5] [18]
30Philip D. MacKenzie [45] [56] [58]
31Yossi Matias [34] [35] [43] [44] [46] [50] [51] [55] [57] [59] [60]
32Nimrod Megiddo [5] [18]
33Gary L. Miller [6] [7] [9] [26]
34Todd C. Mowry [93] [96]
35Seth Pettie [62] [64] [67] [68] [70] [71] [73] [80] [91]
36Chung Keung Poon [48] [52]
37Amit Prakash [76] [79]
38John H. Reif [16] [31]
39Olatunji Ruwase [93] [96]
40Michael Ryan [93] [96]
41Santanu Sinha [48]
42Ramesh K. Sitaraman [66]
43Danny Soroker [21]
44Srinath Sridhar [73]
45Theodoros Strigkos [96]
46Robert Endre Tarjan [21] [27] [38]
47Mikkel Thorup [90]
48Ramakrishna Thurimella (Ramki Thurimella) [15] [29]
49Jerry L. Trahan [13] [25] [32]
50Uzi Vishkin [12]
51Evangelos Vlachos [96]
52Tandy Warnow [75] [78] [81] [83]
53Hannah Honghua Yang (Honghua Yang) [30] [33] [36] [42] [49]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)