The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pradip K. Srimani: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Shyamal K. Chowdhury, Pradip K. Srimani
    Worst Case Performance of Weighted Buddy Systems. [Citation Graph (1, 0)][DBLP]
    Acta Inf., 1987, v:24, n:5, pp:555-564 [Journal]
  2. Sujit Dey, Pradip K. Srimani
    Parallel VLSI computation of all shortest paths in a graph. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1988, pp:373-379 [Conf]
  3. Raj Sekhar Pamula, Pradip K. Srimani
    Checkpointing strategies for database systems. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1987, pp:88-97 [Conf]
  4. Bhabani P. Sinha, Pradip K. Srimani
    A new parallel multiplication algorithm and its VLSI implementation. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1988, pp:366-372 [Conf]
  5. Suchai Thanawastien, Pradip K. Srimani
    A class of modified single stage S/E networks. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1986, pp:147-154 [Conf]
  6. Yashwant K. Malaiya, Pradip K. Srimani
    An Introduction to Software Reliability Models. [Citation Graph (0, 0)][DBLP]
    Int. CMG Conference, 1991, pp:1237-1239 [Conf]
  7. Gheorghe Antonoiu, Pradip K. Srimani
    Distributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1997, pp:480-487 [Conf]
  8. Gheorghe Antonoiu, Pradip K. Srimani
    Mutual Exclusion Between Neighboring Nodes in a Tree That Stabilizes Using Read/Write Atomicity. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1998, pp:545-553 [Conf]
  9. Gheorghe Antonoiu, Pradip K. Srimani
    Mutual Exclusion Between Neighboring Nodes in an Arbitrary System Graph Tree That Stabilizes Using Read/Write Atomicity. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1999, pp:823-830 [Conf]
  10. Sandeep K. S. Gupta, Abdelmadjid Bouabdallah, Pradip K. Srimani
    Self-Stabilizing Protocol for Shortest Path Tree for Multi-cast Routing in Mobile Networks (Research Note). [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2000, pp:600-604 [Conf]
  11. Bhargab B. Bhattacharya, Suranjan Ghose, Bhabani P. Sinha, Pradip K. Srimani
    Heuristic Search Approach to Optimal Routing in a Distributed Architecture. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1984, pp:152-164 [Conf]
  12. Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
    Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph. [Citation Graph (0, 0)][DBLP]
    HiPC, 2003, pp:66-73 [Conf]
  13. Zhengnan Shi, Pradip K. Srimani
    An Efficient Distributed Protocol for Online Gossiping Problem. [Citation Graph (0, 0)][DBLP]
    IAT, 2005, pp:599-602 [Conf]
  14. Pradip K. Srimani
    Generalized Fault Tolerance Properties of Star Graphs. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:510-519 [Conf]
  15. Pradip K. Srimani
    Software Engineering and Information Technology - Introduction. [Citation Graph (0, 0)][DBLP]
    ICCI, 1993, pp:392- [Conf]
  16. Anurag Kahol, Ramandeep Singh Khurana, Sandeep K. S. Gupta, Pradip K. Srimani
    An Efficient Cache Maintenance Scheme for Mobile Environment. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2000, pp:530-537 [Conf]
  17. Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
    A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time. [Citation Graph (0, 0)][DBLP]
    ICDCS Workshops, 2003, pp:461-465 [Conf]
  18. Sandeep K. S. Gupta, Pradip K. Srimani
    Mobility Tolerant Maintenance of Multi-Cast Tree in Mobile Multi-Hop Radio Networks. [Citation Graph (0, 0)][DBLP]
    ICPP, 1999, pp:490-497 [Conf]
  19. Pradip K. Srimani
    Maximally Fault Tolerant Directed Network Graph With Sublogarithmic Diameter For Arbitrary Number of Nodes. [Citation Graph (0, 0)][DBLP]
    ICPP, 1993, pp:231-234 [Conf]
  20. Sumit Sur, Pradip K. Srimani
    A Fault-Tolerant Routing Algorithm for Star Graph Interconnection Network. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1991, pp:267-270 [Conf]
  21. Sandeep K. Gupta, Wang-Chien Lee, Pradip K. Srimani
    Message from the Chairs. [Citation Graph (0, 0)][DBLP]
    ICPP Workshops, 2000, pp:3- [Conf]
  22. Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
    Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:162- [Conf]
  23. Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
    A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Grap. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:240- [Conf]
  24. Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
    Fault Tolerant Algorithms for Orderings and Colorings. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  25. Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
    Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  26. Dianne R. Kumar, Walid A. Najjar, Pradip K. Srimani
    Performance Evaluation of a New Hardware Supported Multicast Scheme for K-ary N-cubes. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2001, pp:160- [Conf]
  27. Zhenyu Xu, Pradip K. Srimani
    Self-Stabilizing Anonymous Leader Election in a Tree. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  28. Wei Shi, Pradip K. Srimani
    Hyper Butterfly Network: A Scalable Optimally Fault Tolerant Architecture. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1998, pp:732-736 [Conf]
  29. Zhenyu Xu, Pradip K. Srimani
    Self-stabilizing distributed algorithms for graph alliances. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  30. S. Datta, R. K. Guha, B. Gupta, Pradip K. Srimani
    Revolving hierarchy in a hypercube distributed system. [Citation Graph (0, 0)][DBLP]
    ISCAS, 1993, pp:2537-2540 [Conf]
  31. Zhenyu Xu, Pradip K. Srimani
    Protocols for Sensor Networks Using COSMOS Model. [Citation Graph (0, 0)][DBLP]
    IWDC, 2005, pp:75-86 [Conf]
  32. Koushik Sinha, Pradip K. Srimani
    Broadcast and Gossiping Algorithms for Mobile Ad Hoc Networks Based on Breadth-First Traversal. [Citation Graph (0, 0)][DBLP]
    IWDC, 2004, pp:459-470 [Conf]
  33. Pradip K. Srimani, Bhabani P. Sinha
    Mobility Tolerant Broadcast in Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    IWDC, 2004, pp:435-446 [Conf]
  34. Zhenyu Xu, Stephen T. Hedetniemi, Wayne Goddard, Pradip K. Srimani
    A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph. [Citation Graph (0, 0)][DBLP]
    IWDC, 2003, pp:26-32 [Conf]
  35. Zhenyu Xu, Pradip K. Srimani
    Self-stabilizing Publish/Subscribe Protocol for P2P Networks. [Citation Graph (0, 0)][DBLP]
    IWDC, 2005, pp:129-140 [Conf]
  36. Jun Zheng, Emma Regentova, Pradip K. Srimani
    Dynamic Location Management with Personalized Location Area for Future PCS Networks. [Citation Graph (0, 0)][DBLP]
    IWDC, 2004, pp:495-501 [Conf]
  37. Sumit Khurana, Anurag Kahol, Sandeep K. S. Gupta, Pradip K. Srimani
    Performance Evaluation of Distributed Co-Ordination Function for IEEE 802.11 Wireless LAN Protocol in Presence of Mobile and Hidden Terminals. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 1999, pp:40-47 [Conf]
  38. Shahram Latifi, Pradip K. Srimani
    Wildcard Dimensions in Augmented Star and Bubble-Sort Networks. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 1995, pp:335-339 [Conf]
  39. Walid A. Najjar, Annette Lagman, Sumit Sur, Pradip K. Srimani
    Modeling Adaptive Routing in k-ary n-cube Networks. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 1994, pp:120-125 [Conf]
  40. James Zijun Wang, Zhidian Du, Pradip K. Srimani
    Network Cache Model for Wireless Proxy Caching. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 2005, pp:311-314 [Conf]
  41. Pradip K. Srimani
    CC-2001, Computer Science & Engineering Curricula for the Next Decade: A Status Report. [Citation Graph (0, 0)][DBLP]
    MSE, 1999, pp:100-0 [Conf]
  42. Wei Shi, Pradip K. Srimani
    Leader Election in Hyper-Butterfly Graphs. [Citation Graph (0, 0)][DBLP]
    NPC, 2004, pp:292-299 [Conf]
  43. Kent Fitzgerald, Shahram Latifi, Pradip K. Srimani
    Realiability Modeling of Star Graph Networks. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1999, pp:2328-2331 [Conf]
  44. Shahram Latifi, Yordan Rouskov, Pradip K. Srimani
    Fault Tolerant Routing in Star Graph Networks in the Forbidden Fault Model. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1997, pp:1605-1613 [Conf]
  45. Kalyan Ram Palgummi, Shahram Latifi, Pradip K. Srimani
    Routing in Star Graph Using Binary Labels. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1999, pp:2410-2416 [Conf]
  46. Zhengnan Shi, Pradip K. Srimani
    A New Adaptive Distributed Routing Protocol Using d-hop Dominating Sets for Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2004, pp:1049-1055 [Conf]
  47. L. Wang, S. Subramanian, Shahram Latifi, Pradip K. Srimani
    Distance Spectrum of Nodes in Star Graphs. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2002, pp:1591-1595 [Conf]
  48. Bhabani P. Sinha, Pradip K. Srimani
    An O(log n) Parallel Algorithm for Binary Multiplication and its VLSI implementation. [Citation Graph (0, 0)][DBLP]
    IEEE Real-Time Systems Symposium, 1987, pp:54-62 [Conf]
  49. John Impagliazzo, Esther A. Hughes, Richard J. LeBlanc, Timothy Lethbridge, Andrew D. McGettrick, Ann E. Kelley Sobel, Pradip K. Srimani, Mitchell D. Theys
    IEEE-CS/ACM computing curricula: computer engineering & software engineering volumes. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2004, pp:450-452 [Conf]
  50. John Impagliazzo, Robert H. Sloan, Andrew D. McGettrick, Pradip K. Srimani
    Computer engineering computing curricula. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2003, pp:355-356 [Conf]
  51. Annette Lagman, Walid A. Najjar, Sumit Sur, Pradip K. Srimani
    Evaluation of Idealized Adaptive Routing on k-ary n-cubes. [Citation Graph (0, 0)][DBLP]
    SPDP, 1993, pp:166-169 [Conf]
  52. Koushik Sinha, Pradip K. Srimani
    Broadcast Algorithms for Mobile Ad hoc Networks based on Depth-first Traversal. [Citation Graph (0, 0)][DBLP]
    Wireless Information Systems, 2004, pp:170-178 [Conf]
  53. Sandeep K. S. Gupta, Pradip K. Srimani
    An Adaptive Protocol for Reliable Multicast in Mobile Multi-hop Radio Networks. [Citation Graph (0, 0)][DBLP]
    WMCSA, 1999, pp:111-0 [Conf]
  54. Pradip K. Srimani, Zhenyu Xu
    Distributed Protocols for Defensive and Offensive Alliances in Network Graphs Using Self-Stabilization. [Citation Graph (0, 0)][DBLP]
    ICCTA, 2007, pp:27-31 [Conf]
  55. Sumit Sur, Pradip K. Srimani
    IEH Graphs. A Novel Generalization of Hypercube Graphs [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1995, v:32, n:6, pp:597-609 [Journal]
  56. L. Wang, S. Subramanian, Shahram Latifi, Pradip K. Srimani
    Distance distribution of nodes in star graphs. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2006, v:19, n:8, pp:780-784 [Journal]
  57. Sujit Dey, Pradip K. Srimani
    A New Parallel Sorting Algorithm and its Efficient VLSI Implementation. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1990, v:33, n:3, pp:241-246 [Journal]
  58. Sankar K. Pal, Pradip K. Srimani
    Neurocomputing: Motivations, Models, and Hybridization - Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    IEEE Computer, 1996, v:29, n:3, pp:24-28 [Journal]
  59. Pradip K. Srimani, Shivakant Mishra
    Performance evaluation of distributed mutual exclusion algorithms for computer networks. [Citation Graph (0, 0)][DBLP]
    Comput. Syst. Sci. Eng., 1990, v:5, n:2, pp:59-64 [Journal]
  60. Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
    Self-Stabilizing Algorithms For Orderings And Colorings. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:1, pp:19-36 [Journal]
  61. Zhenyu Xu, Pradip K. Srimani
    Self-stabilizing Anonymous Leader Election in a Tree. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:2, pp:323-336 [Journal]
  62. Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
    Maximal matching stabilizes in time O(m). [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:80, n:5, pp:221-223 [Journal]
  63. Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
    Linear time self-stabilizing colorings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:5, pp:251-255 [Journal]
  64. Yordan Rouskov, Pradip K. Srimani
    Fault Diameter of Star Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:5, pp:243-251 [Journal]
  65. Abhijit Sengupta, Subir Bandyopadhyay, Pradip K. Srimani
    On Identification of CR Property in File Organisation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:2, pp:93-96 [Journal]
  66. Pradip K. Srimani, Rachamallu L. N. Reddy
    Another Distributed Algorithm for Multiple Entries to a Critical Section. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:41, n:1, pp:51-57 [Journal]
  67. Premkumar Vadapalli, Pradip K. Srimani
    Trivalent Cayley Graphs for Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:6, pp:329-335 [Journal]
  68. Premkumar Vadapalli, Pradip K. Srimani
    Shortest Routing in Trivalent Cayley Graph Network. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:4, pp:183-188 [Journal]
  69. D. Murthy, Pradip K. Srimani
    Split sequence coalesced hashing. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 1988, v:13, n:2, pp:211-218 [Journal]
  70. Bhabani P. Sinha, Pradip K. Srimani, A. Guhathakurta, J. Duttagupta
    Application of associative memories in designing assemblers. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1981, v:24, n:3, pp:201-215 [Journal]
  71. Pradip K. Srimani
    Probabilistic analysis of output cost of a heuristic search algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1989, v:47, n:1, pp:53-62 [Journal]
  72. Pradip K. Srimani, Nanda De, Abhijit Sengupta, Subir Bandyopadhyay
    A new approach to single-fault-tolerant realization of synchronous sequential machines. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1982, v:26, n:3, pp:189-198 [Journal]
  73. Pradip K. Srimani, Bhabani P. Sinha
    Impossible pair constrained test path generation in a program. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1982, v:28, n:2, pp:87-103 [Journal]
  74. Sumit Sur, Pradip K. Srimani
    A self-stabilizing algorithm for coloring bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1993, v:69, n:3, pp:219-227 [Journal]
  75. A. Bagchi, Pradip K. Srimani
    Weighted Heuristic Search in Networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:4, pp:550-576 [Journal]
  76. Zhengnan Shi, Pradip K. Srimani
    An online distributed gossiping protocol for mobile networks. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2006, v:11, n:1, pp:87-97 [Journal]
  77. Gheorghe Antonoiu, Pradip K. Srimani
    A Self-Stabilizing Distributed Algorithm to Find the Median of a Tree Graph. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:1, pp:215-221 [Journal]
  78. Gheorghe Antonoiu, Pradip K. Srimani
    A Self-Stabilizing Leader Election Algorithm for Tree Graphs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:34, n:2, pp:227-232 [Journal]
  79. Sandeep K. S. Gupta, Pradip K. Srimani
    Cored-Based Tree with Forwarding Regions (CBT-FR); A Protocol for Reliable Multicasting in Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2001, v:61, n:9, pp:1249-1277 [Journal]
  80. Sandeep K. S. Gupta, Pradip K. Srimani
    Self-stabilizing multicast protocols for ad hoc networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2003, v:63, n:1, pp:87-96 [Journal]
  81. Anurag Kahol, Sumit Khurana, Sandeep K. S. Gupta, Pradip K. Srimani
    Adaptive Distributed Dynamic Channel Allocation for Wireless Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2001, v:61, n:7, pp:898-914 [Journal]
  82. Yordan Rouskov, Shahram Latifi, Pradip K. Srimani
    Conditional Fault Diameter of Star Graph Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:33, n:1, pp:91-97 [Journal]
  83. Wei Shi, Pradip K. Srimani
    Leader election in hierarchical star network. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2005, v:65, n:11, pp:1435-1442 [Journal]
  84. Sumit Sur, Pradip K. Srimani
    An Almost Regular Fault Tolerant Network with Arbitrary Number of Nodes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:26, n:1, pp:54-60 [Journal]
  85. Cheng-Zhong Xu, Hai Jin, Pradip K. Srimani
    Special issue on scalable web services and architecture. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2003, v:63, n:10, pp:913-915 [Journal]
  86. Wei Shi, Pradip K. Srimani
    Hierarchical star: a new two level interconnection network. [Citation Graph (0, 0)][DBLP]
    Journal of Systems Architecture, 2005, v:51, n:1, pp:1-14 [Journal]
  87. James M. Bieman, Pradip K. Srimani
    Guest editors' corner software engineering for distributed computing. [Citation Graph (0, 0)][DBLP]
    Journal of Systems and Software, 1996, v:33, n:3, pp:205-206 [Journal]
  88. James M. Bieman, Pradip K. Srimani
    Editor's corner : Applying specification, verification, and validation techniques. [Citation Graph (0, 0)][DBLP]
    Journal of Systems and Software, 1993, v:21, n:3, pp:199-200 [Journal]
  89. Naomi S. DeMent, Pradip K. Srimani
    A new algorithm for k mutual exclusions in distributed systems. [Citation Graph (0, 0)][DBLP]
    Journal of Systems and Software, 1994, v:26, n:2, pp:179-191 [Journal]
  90. Shivakant Mishra, Pradip K. Srimani
    Fault-tolerant mutual exclusion algorithms. [Citation Graph (0, 0)][DBLP]
    Journal of Systems and Software, 1990, v:11, n:2, pp:111-129 [Journal]
  91. James Zijun Wang, Zhidian Du, Pradip K. Srimani
    Cooperative proxy caching for wireless base stations. [Citation Graph (0, 0)][DBLP]
    Mobile Information Systems, 2007, v:3, n:1, pp:1-18 [Journal]
  92. Wei Shi, Abdelmadjid Bouabdallah, Pradip K. Srimani
    Leader election in oriented star graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:3, pp:169-179 [Journal]
  93. Gheorghe Antonoiu, Pradip K. Srimani
    Self-stabilizing depth-first multi-token circulation in tree networks. [Citation Graph (0, 0)][DBLP]
    Parallel Algorithms Appl., 2001, v:16, n:1, pp:17-35 [Journal]
  94. Mohammed Atiquzzaman, Pradip K. Srimani
    Parallel computing on clusters of workstations. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2000, v:26, n:2-3, pp:175-177 [Journal]
  95. Mario Cannataro, Domenico Talia, Pradip K. Srimani
    Parallel data intensive computing in scientific and commercial applications. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2002, v:28, n:5, pp:673-704 [Journal]
  96. Shahram Latifi, Pradip K. Srimani
    Wormhole Broadcast in Star Graph Networks. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1998, v:24, n:8, pp:1263-1276 [Journal]
  97. Wei Shi, Pradip K. Srimani
    A regular scalable fault tolerant interconnection network for distributed processing. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2001, v:27, n:14, pp:1897-1919 [Journal]
  98. Domenico Talia, Pradip K. Srimani
    Parallel data-intensive algorithms and applications (guest editorial). [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2002, v:28, n:5, pp:669-671 [Journal]
  99. Sumit Sur, Pradip K. Srimani
    A Self-Stabilizing Distributed Algorithm to Construct BFS Spanning Trees of a Symmetric Graph. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1992, v:2, n:, pp:171-179 [Journal]
  100. Pradip K. Srimani, Yashwant K. Malaiya
    Steps to Practical Reliability Meassurement - Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    IEEE Software, 1992, v:9, n:4, pp:10-12 [Journal]
  101. S. R. Das, C. R. Datta, Pradip K. Srimani, K. Mandal
    Comments on ``Derivation of Minimal Complete Sets of Test-Input Sequences Using Boolean Differences''. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1976, v:25, n:10, pp:1053-1056 [Journal]
  102. Dianne R. Kumar, Walid A. Najjar, Pradip K. Srimani
    A New Adaptive Hardware Tree-Based Multicast Routing in K-Ary N-Cubes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2001, v:50, n:7, pp:647-659 [Journal]
  103. Annette Lagman, Walid A. Najjar, Pradip K. Srimani
    An Analysis of Edge Fault Tolerance in Recursively Decomposable Regular Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1994, v:43, n:4, pp:470-475 [Journal]
  104. Shahram Latifi, Pradip K. Srimani
    Transposition Networks as a Class of Fault-Tolerant Robust Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:2, pp:230-238 [Journal]
  105. Bhabani P. Sinha, Bhargab B. Bhattacharya, Suranjan Ghose, Pradip K. Srimani
    A Parallel Algorithm to Compute the Shortest Paths and Diameter of a Graph and Its VLSI Implementation. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1986, v:35, n:11, pp:1000-1004 [Journal]
  106. Bhabani P. Sinha, Pradip K. Srimani
    Fast Parallel Algorithms for Binary Multiplication and Their Implementation on Systolic Architectures. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:3, pp:424-431 [Journal]
  107. Pradip K. Srimani, Wang-Chien Lee, Sandeep Kumar, Sandeep K. S. Gupta
    Guest Editorial: Special Section on Data Management Systems and Mobile Computing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2002, v:51, n:10, pp:1121-1123 [Journal]
  108. Suchai Thanawastien, Pradip K. Srimani
    The Universality of a Class of Modified Single-Stage Shuffle/Exchange Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1988, v:37, n:3, pp:348-352 [Journal]
  109. Sandeep K. S. Gupta, Pradip K. Srimani
    UpdateSearch: A New Dynamic Channel Allocation Scheme for Mobile Networks That Can Adjust to System Loads. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2000, v:17, n:1, pp:47-65 [Journal]
  110. Shahram Latifi, Myung Hoon Lee, Pradip K. Srimani
    Wormhole Broadcast in Hypercubes. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2000, v:15, n:2, pp:183-192 [Journal]
  111. Shahram Latifi, Pradip K. Srimani
    Sep: A Fixed Degree Regular Network for Massively Parallel Systems. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 1998, v:12, n:3, pp:277-291 [Journal]
  112. Koushik Sinha, Pradip K. Srimani
    Deterministic Broadcast and Gossiping Algorithms for Ad hoc Networks. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2006, v:37, n:2, pp:115-144 [Journal]
  113. Sandeep K. S. Gupta, Pradip K. Srimani
    Adaptive Core Selection and Migration Method for Multicast Routing in Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2003, v:14, n:1, pp:27-38 [Journal]
  114. Anurag Kahol, Sumit Khurana, Sandeep K. S. Gupta, Pradip K. Srimani
    A Strategy to Manage Cache Consistency in a Disconnected Distributed Environment. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2001, v:12, n:7, pp:686-700 [Journal]
  115. Hyosun Ko, Shahram Latifi, Pradip K. Srimani
    Near-Optimal Broadcast in All-Port Wormhole-Routed Hypercubes Using Error-Correcting Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2000, v:11, n:3, pp:247-260 [Journal]
  116. Premkumar Vadapalli, Pradip K. Srimani
    A New Family of Cayley Graph Interconnection Networks of Constant Degree Four. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1996, v:7, n:1, pp:26-32 [Journal]
  117. Yashwant K. Malaiya, Anneliese von Mayrhauser, Pradip K. Srimani
    An Examination of Fault Exposure Ratio. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1993, v:19, n:11, pp:1087-1094 [Journal]
  118. Domenico Talia, Pradip K. Srimani, Mehdi Jazayeri
    Guest Editor's Introduction: Special Issues on Architecture-Independent Languages and Software tools for Parallel Processing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 2000, v:26, n:3, pp:193-196 [Journal]
  119. Domenico Talia, Pradip K. Srimani, Mehdi Jazayeri
    Guest Editor's Introduction: Special Issues on Architecture-Independent Languages and Software tools for Parallel Processing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 2000, v:26, n:4, pp:289-292 [Journal]
  120. Yu-Chee Tseng, Sandeep K. S. Gupta, Wang-Chien Lee, Pradip K. Srimani
    Editorial. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 2003, v:9, n:2, pp:93-94 [Journal]
  121. Vasu Jolly, Naoto Kimura, Shahram Latifi, Pradip K. Srimani
    Loop detection in MPLS for wireless sensor networks. [Citation Graph (0, 0)][DBLP]
    Microprocessors and Microsystems, 2004, v:28, n:8, pp:439-445 [Journal]
  122. Pradip K. Srimani, Zhenyu Xu
    Self-Stabilizing Algorithms of Constructing Spanning Tree and Weakly Connected Minimal Dominating Set. [Citation Graph (0, 0)][DBLP]
    ICDCS Workshops, 2007, pp:3- [Conf]
  123. Pradip K. Srimani
    Self-stabilizing Distributed Algorithms for Networks. [Citation Graph (0, 0)][DBLP]
    ISPA, 2007, pp:1-2 [Conf]
  124. Sandeep K. S. Gupta, Pradip K. Srimani
    Distributed dynamic channel allocation in mobile networks: combining search and update. [Citation Graph (0, 0)][DBLP]
    IPCCC, 1999, pp:120-126 [Conf]

  125. An Efficient Method to Measure the Semantic Similarity of Ontologies. [Citation Graph (, )][DBLP]


  126. Super Star: a new optimally fault tolerant network architecture. [Citation Graph (, )][DBLP]


  127. Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space. [Citation Graph (, )][DBLP]


  128. Undergraduate database instruction with MeTube. [Citation Graph (, )][DBLP]


Search in 4.353secs, Finished in 4.361secs
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