The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Vijaya Ramachandran: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  88. Resource Oblivious Sorting on Multicores. [Citation Graph (, )][DBLP]


  89. Flexible Hardware Acceleration for Instruction-Grain Program Monitoring. [Citation Graph (, )][DBLP]


  90. Provably good multicore cache performance for divide-and-conquer algorithms. [Citation Graph (, )][DBLP]


  91. Cache-efficient dynamic programming algorithms for multicores. [Citation Graph (, )][DBLP]


  92. Parallelizing dynamic information flow tracking. [Citation Graph (, )][DBLP]


  93. A universal construction for wait-free transaction friendly data structures. [Citation Graph (, )][DBLP]


  94. Parallel algorithm and complexity results for telephone link simulation. [Citation Graph (, )][DBLP]


Search in 0.096secs, Finished in 0.101secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002