Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Home Page

* | 2008 | |
---|---|---|

135 | EE | James Zijun Wang, Farha Ali, Pradip K. Srimani: An Efficient Method to Measure the Semantic Similarity of Ontologies. GPC 2008: 447-458 |

134 | EE | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space. ICDCN 2008: 182-190 |

133 | EE | Koushik Sinha, Suranjan Ghose, Pradip K. Srimani: Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks. J. Parallel Distrib. Comput. 68(7): 922-938 (2008) |

132 | EE | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu: Self-Stabilizing Graph Protocols. Parallel Processing Letters 18(1): 189-199 (2008) |

2007 | ||

131 | EE | Pradip K. Srimani, Zhenyu Xu: Distributed Protocols for Defensive and Offensive Alliances in Network Graphs Using Self-Stabilization. ICCTA 2007: 27-31 |

130 | EE | Pradip K. Srimani, Zhenyu Xu: Self-Stabilizing Algorithms of Constructing Spanning Tree and Weakly Connected Minimal Dominating Set. ICDCS Workshops 2007: 3 |

129 | EE | Pradip K. Srimani: Self-stabilizing Distributed Algorithms for Networks. ISPA 2007: 1-2 |

128 | EE | James Zijun Wang, Zhidian Du, Pradip K. Srimani: Cooperative proxy caching for wireless base stations. Mobile Information Systems 3(1): 1-18 (2007) |

2006 | ||

127 | EE | Zhenyu Xu, Pradip K. Srimani: Self-stabilizing distributed algorithms for graph alliances. IPDPS 2006 |

126 | EE | L. Wang, S. Subramanian, Shahram Latifi, Pradip K. Srimani: Distance distribution of nodes in star graphs. Appl. Math. Lett. 19(8): 780-784 (2006) |

125 | EE | Zhenyu Xu, Pradip K. Srimani: Self-stabilizing Anonymous Leader Election in a Tree. Int. J. Found. Comput. Sci. 17(2): 323-336 (2006) |

124 | EE | Zhengnan Shi, Pradip K. Srimani: An online distributed gossiping protocol for mobile networks. J. Comb. Optim. 11(1): 87-97 (2006) |

123 | EE | Koushik Sinha, Pradip K. Srimani: Deterministic Broadcast and Gossiping Algorithms for Ad hoc Networks. The Journal of Supercomputing 37(2): 115-144 (2006) |

2005 | ||

122 | EE | Zhengnan Shi, Pradip K. Srimani: An Efficient Distributed Protocol for Online Gossiping Problem. IAT 2005: 599-602 |

121 | EE | Zhenyu Xu, Pradip K. Srimani: Self-Stabilizing Anonymous Leader Election in a Tree. IPDPS 2005 |

120 | EE | Zhenyu Xu, Pradip K. Srimani: Self-stabilizing Publish/Subscribe Protocol for P2P Networks. IWDC 2005: 129-140 |

119 | EE | Zhenyu Xu, Pradip K. Srimani: Protocols for Sensor Networks Using COSMOS Model. IWDC 2005: 75-86 |

118 | EE | James Zijun Wang, Zhidian Du, Pradip K. Srimani: Network Cache Model for Wireless Proxy Caching. MASCOTS 2005: 311-314 |

117 | EE | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Self-Stabilizing Global Optimization Algorithms for Large Network Graphs. IJDSN 1(3&4): 329-344 (2005) |

116 | EE | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Self-Stabilizing Algorithms For Orderings And Colorings. Int. J. Found. Comput. Sci. 16(1): 19-36 (2005) |

115 | EE | Wei Shi, Pradip K. Srimani: Leader election in hierarchical star network. J. Parallel Distrib. Comput. 65(11): 1435-1442 (2005) |

114 | EE | Wei Shi, Pradip K. Srimani: Hierarchical star: a new two level interconnection network. Journal of Systems Architecture 51(1): 1-14 (2005) |

113 | EE | Wei Shi, Abdelmadjid Bouabdallah, Pradip K. Srimani: Leader election in oriented star graphs. Networks 45(3): 169-179 (2005) |

2004 | ||

112 | EE | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Fault Tolerant Algorithms for Orderings and Colorings. IPDPS 2004 |

111 | EE | Pradip K. Srimani, Bhabani P. Sinha: Mobility Tolerant Broadcast in Mobile Ad Hoc Networks. IWDC 2004: 435-446 |

110 | EE | Koushik Sinha, Pradip K. Srimani: Broadcast and Gossiping Algorithms for Mobile Ad Hoc Networks Based on Breadth-First Traversal. IWDC 2004: 459-470 |

109 | EE | Jun Zheng, Emma Regentova, Pradip K. Srimani: Dynamic Location Management with Personalized Location Area for Future PCS Networks. IWDC 2004: 495-501 |

108 | EE | Wei Shi, Pradip K. Srimani: Leader Election in Hyper-Butterfly Graphs. NPC 2004: 292-299 |

107 | Zhengnan Shi, Pradip K. Srimani: A New Adaptive Distributed Routing Protocol Using d-hop Dominating Sets for Mobile Ad Hoc Networks. PDPTA 2004: 1049-1055 | |

106 | EE | 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. SIGCSE 2004: 450-452 |

105 | Koushik Sinha, Pradip K. Srimani: Broadcast Algorithms for Mobile Ad hoc Networks based on Depth-first Traversal. Wireless Information Systems 2004: 170-178 | |

104 | EE | Vasu Jolly, Naoto Kimura, Shahram Latifi, Pradip K. Srimani: Loop detection in MPLS for wireless sensor networks. Microprocessors and Microsystems 28(8): 439-445 (2004) |

2003 | ||

103 | EE | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph. HiPC 2003: 66-73 |

102 | EE | Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time. ICDCS Workshops 2003: 461-465 |

101 | EE | 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. IPDPS 2003: 162 |

100 | EE | 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. IPDPS 2003: 240 |

99 | EE | Zhenyu Xu, Stephen T. Hedetniemi, Wayne Goddard, Pradip K. Srimani: A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph. IWDC 2003: 26-32 |

98 | EE | John Impagliazzo, Robert H. Sloan, Andrew D. McGettrick, Pradip K. Srimani: Computer engineering computing curricula. SIGCSE 2003: 355-356 |

97 | EE | Sandeep K. S. Gupta, Pradip K. Srimani: Adaptive Core Selection and Migration Method for Multicast Routing in Mobile Ad Hoc Networks. IEEE Trans. Parallel Distrib. Syst. 14(1): 27-38 (2003) |

96 | EE | Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Linear time self-stabilizing colorings. Inf. Process. Lett. 87(5): 251-255 (2003) |

95 | EE | Sandeep K. S. Gupta, Pradip K. Srimani: Self-stabilizing multicast protocols for ad hoc networks. J. Parallel Distrib. Comput. 63(1): 87-96 (2003) |

94 | EE | Cheng-Zhong Xu, Hai Jin, Pradip K. Srimani: Special issue on scalable web services and architecture. J. Parallel Distrib. Comput. 63(10): 913-915 (2003) |

93 | Yu-Chee Tseng, Sandeep K. S. Gupta, Wang-Chien Lee, Pradip K. Srimani: Editorial. Wireless Networks 9(2): 93-94 (2003) | |

2002 | ||

92 | EE | Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time. IPDPS 2002 |

91 | L. Wang, S. Subramanian, Shahram Latifi, Pradip K. Srimani: Distance Spectrum of Nodes in Star Graphs. PDPTA 2002: 1591-1595 | |

90 | EE | Pradip K. Srimani, Wang-Chien Lee, Sandeep Kumar, Sandeep K. S. Gupta: Guest Editorial: Special Section on Data Management Systems and Mobile Computing. IEEE Trans. Computers 51(10): 1121-1123 (2002) |

89 | Domenico Talia, Pradip K. Srimani: Parallel data-intensive algorithms and applications (guest editorial). Parallel Computing 28(5): 669-671 (2002) | |

88 | Mario Cannataro, Domenico Talia, Pradip K. Srimani: Parallel data intensive computing in scientific and commercial applications. Parallel Computing 28(5): 673-704 (2002) | |

2001 | ||

87 | Dianne R. Kumar, Walid A. Najjar, Pradip K. Srimani: Performance Evaluation of a New Hardware Supported Multicast Scheme for K-ary N-cubes. IPDPS 2001: 160 | |

86 | EE | Dianne R. Kumar, Walid A. Najjar, Pradip K. Srimani: A New Adaptive Hardware Tree-Based Multicast Routing in K-Ary N-Cubes. IEEE Trans. Computers 50(7): 647-659 (2001) |

85 | EE | Anurag Kahol, Sumit Khurana, Sandeep K. S. Gupta, Pradip K. Srimani: A Strategy to Manage Cache Consistency in a Disconnected Distributed Environment. IEEE Trans. Parallel Distrib. Syst. 12(7): 686-700 (2001) |

84 | EE | Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Maximal matching stabilizes in time O(m). Inf. Process. Lett. 80(5): 221-223 (2001) |

83 | EE | Anurag Kahol, Sumit Khurana, Sandeep K. S. Gupta, Pradip K. Srimani: Adaptive Distributed Dynamic Channel Allocation for Wireless Networks. J. Parallel Distrib. Comput. 61(7): 898-914 (2001) |

82 | EE | 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. J. Parallel Distrib. Comput. 61(9): 1249-1277 (2001) |

81 | Gheorghe Antonoiu, Pradip K. Srimani: Self-stabilizing depth-first multi-token circulation in tree networks. Parallel Algorithms Appl. 16(1): 17-35 (2001) | |

80 | Wei Shi, Pradip K. Srimani: A regular scalable fault tolerant interconnection network for distributed processing. Parallel Computing 27(14): 1897-1919 (2001) | |

2000 | ||

79 | EE | 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). Euro-Par 2000: 600-604 |

78 | EE | Anurag Kahol, Ramandeep Singh Khurana, Sandeep K. S. Gupta, Pradip K. Srimani: An Efficient Cache Maintenance Scheme for Mobile Environment. ICDCS 2000: 530-537 |

77 | EE | Sandeep K. Gupta, Wang-Chien Lee, Pradip K. Srimani: Message from the Chairs. ICPP Workshops 2000: 3 |

76 | EE | Hyosun Ko, Shahram Latifi, Pradip K. Srimani: Near-Optimal Broadcast in All-Port Wormhole-Routed Hypercubes Using Error-Correcting Codes. IEEE Trans. Parallel Distrib. Syst. 11(3): 247-260 (2000) |

75 | EE | Domenico Talia, Pradip K. Srimani, Mehdi Jazayeri: Guest Editor's Introduction: Special Issues on Architecture-Independent Languages and Software tools for Parallel Processing. IEEE Trans. Software Eng. 26(3): 193-196 (2000) |

74 | EE | Domenico Talia, Pradip K. Srimani, Mehdi Jazayeri: Guest Editor's Introduction: Special Issues on Architecture-Independent Languages and Software tools for Parallel Processing. IEEE Trans. Software Eng. 26(4): 289-292 (2000) |

73 | Mohammed Atiquzzaman, Pradip K. Srimani: Parallel computing on clusters of workstations. Parallel Computing 26(2-3): 175-177 (2000) | |

72 | EE | Shahram Latifi, Myung Hoon Lee, Pradip K. Srimani: Wormhole Broadcast in Hypercubes. The Journal of Supercomputing 15(2): 183-192 (2000) |

71 | EE | Sandeep K. S. Gupta, Pradip K. Srimani: UpdateSearch: A New Dynamic Channel Allocation Scheme for Mobile Networks That Can Adjust to System Loads. The Journal of Supercomputing 17(1): 47-65 (2000) |

1999 | ||

70 | EE | Gheorghe Antonoiu, Pradip K. Srimani: Mutual Exclusion Between Neighboring Nodes in an Arbitrary System Graph Tree That Stabilizes Using Read/Write Atomicity. Euro-Par 1999: 823-830 |

69 | EE | Sandeep K. S. Gupta, Pradip K. Srimani: Mobility Tolerant Maintenance of Multi-Cast Tree in Mobile Multi-Hop Radio Networks. ICPP 1999: 490-497 |

68 | EE | Sandeep K. S. Gupta, Pradip K. Srimani: Distributed dynamic channel allocation in mobile networks: combining search and update. IPCCC 1999: 120-126 |

67 | EE | 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. MASCOTS 1999: 40-47 |

66 | EE | Pradip K. Srimani: CC-2001, Computer Science & Engineering Curricula for the Next Decade: A Status Report. MSE 1999: 100- |

65 | Kent Fitzgerald, Shahram Latifi, Pradip K. Srimani: Realiability Modeling of Star Graph Networks. PDPTA 1999: 2328-2331 | |

64 | Kalyan Ram Palgummi, Shahram Latifi, Pradip K. Srimani: Routing in Star Graph Using Binary Labels. PDPTA 1999: 2410-2416 | |

63 | EE | Sandeep K. S. Gupta, Pradip K. Srimani: An Adaptive Protocol for Reliable Multicast in Mobile Multi-hop Radio Networks. WMCSA 1999: 111- |

62 | Gheorghe Antonoiu, Pradip K. Srimani: A Self-Stabilizing Distributed Algorithm to Find the Median of a Tree Graph. J. Comput. Syst. Sci. 58(1): 215-221 (1999) | |

61 | EE | Gheorghe Antonoiu, Pradip K. Srimani: Self-stabilizing Protocol for Mutual Exclusion among Neighboring Nodes in a Tree Structured Distributed System. Parallel Algorithms Appl. 14(1): 1-18 (1999) |

1998 | ||

60 | EE | Gheorghe Antonoiu, Pradip K. Srimani: Mutual Exclusion Between Neighboring Nodes in a Tree That Stabilizes Using Read/Write Atomicity. Euro-Par 1998: 545-553 |

59 | EE | Wei Shi, Pradip K. Srimani: Hyper Butterfly Network: A Scalable Optimally Fault Tolerant Architecture. IPPS/SPDP 1998: 732-736 |

58 | Shahram Latifi, Pradip K. Srimani: Wormhole Broadcast in Star Graph Networks. Parallel Computing 24(8): 1263-1276 (1998) | |

57 | EE | Shahram Latifi, Pradip K. Srimani: Sep: A Fixed Degree Regular Network for Massively Parallel Systems. The Journal of Supercomputing 12(3): 277-291 (1998) |

1997 | ||

56 | EE | Gheorghe Antonoiu, Pradip K. Srimani: Distributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction. Euro-Par 1997: 480-487 |

55 | Shahram Latifi, Yordan Rouskov, Pradip K. Srimani: Fault Tolerant Routing in Star Graph Networks in the Forbidden Fault Model. PDPTA 1997: 1605-1613 | |

54 | EE | Pradip K. Srimani: Guest Editor's introduction Distributed computing systems. Int. J. Systems Science 28(11): 1021-1024 (1997) |

53 | EE | Gheorghe Antonoiu, Pradip K. Srimani: A Self-stabilizing Distributed Algorithm to Find the Center of a Tree Graph. Parallel Algorithms Appl. 10(3-4): 237-248 (1997) |

1996 | ||

52 | Sankar K. Pal, Pradip K. Srimani: Neurocomputing: Motivations, Models, and Hybridization - Guest Editors' Introduction. IEEE Computer 29(3): 24-28 (1996) | |

51 | Shahram Latifi, Pradip K. Srimani: Transposition Networks as a Class of Fault-Tolerant Robust Networks. IEEE Trans. Computers 45(2): 230-238 (1996) | |

50 | EE | Premkumar Vadapalli, Pradip K. Srimani: A New Family of Cayley Graph Interconnection Networks of Constant Degree Four. IEEE Trans. Parallel Distrib. Syst. 7(1): 26-32 (1996) |

49 | EE | Premkumar Vadapalli, Pradip K. Srimani: Shortest Routing in Trivalent Cayley Graph Network. Inf. Process. Lett. 57(4): 183-188 (1996) |

48 | Yordan Rouskov, Shahram Latifi, Pradip K. Srimani: Conditional Fault Diameter of Star Graph Networks. J. Parallel Distrib. Comput. 33(1): 91-97 (1996) | |

47 | Gheorghe Antonoiu, Pradip K. Srimani: A Self-Stabilizing Leader Election Algorithm for Tree Graphs. J. Parallel Distrib. Comput. 34(2): 227-232 (1996) | |

46 | EE | James M. Bieman, Pradip K. Srimani: Guest editors' corner software engineering for distributed computing. Journal of Systems and Software 33(3): 205-206 (1996) |

45 | EE | Pradip K. Srimani: Super Rotator: Incrementally Extensible Directed Network Graph of Sublogarithmic Diameter. Parallel Processing Letters 6(4): 479-490 (1996) |

1995 | ||

44 | Shahram Latifi, Pradip K. Srimani: Wildcard Dimensions in Augmented Star and Bubble-Sort Networks. MASCOTS 1995: 335-339 | |

43 | Sumit Sur, Pradip K. Srimani: IEH Graphs. A Novel Generalization of Hypercube Graphs Acta Inf. 32(6): 597-609 (1995) | |

42 | EE | Premkumar Vadapalli, Pradip K. Srimani: Trivalent Cayley Graphs for Interconnection Networks. Inf. Process. Lett. 54(6): 329-335 (1995) |

41 | Sumit Sur, Pradip K. Srimani: An Almost Regular Fault Tolerant Network with Arbitrary Number of Nodes. J. Parallel Distrib. Comput. 26(1): 54-60 (1995) | |

1994 | ||

40 | Walid A. Najjar,
Annette Lagman,
Sumit Sur,
Pradip K. Srimani:
Modeling Adaptive Routing in k-ary n-cube Networks.
MASCOTS 1994: 120-125 | |

39 | Annette Lagman, Walid A. Najjar, Pradip K. Srimani: An Analysis of Edge Fault Tolerance in Recursively Decomposable Regular Networks. IEEE Trans. Computers 43(4): 470-475 (1994) | |

38 | EE | Naomi S. DeMent,
Pradip K. Srimani:
A new algorithm for k mutual exclusions in distributed systems.
Journal of Systems and Software 26(2): 179-191 (1994) |

37 | EE | Srinivasan Chandrasekar, Pradip K. Srimani: A Self-stabilizing Distributed Algorithm for all-pairs Shortest Path Problem. Parallel Algorithms Appl. 4(1-2): 125-137 (1994) |

1993 | ||

36 | Pradip K. Srimani: Software Engineering and Information Technology - Introduction. ICCI 1993: 392 | |

35 | Pradip K. Srimani: Maximally Fault Tolerant Directed Network Graph With Sublogarithmic Diameter For Arbitrary Number of Nodes. ICPP 1993: 231-234 | |

34 | S. Datta, R. K. Guha, B. Gupta, Pradip K. Srimani: Revolving hierarchy in a hypercube distributed system. ISCAS 1993: 2537-2540 | |

33 | Annette Lagman, Walid A. Najjar, Sumit Sur, Pradip K. Srimani: Evaluation of Idealized Adaptive Routing on k-ary n-cubes. SPDP 1993: 166-169 | |

32 | EE | Yashwant K. Malaiya, Anneliese von Mayrhauser, Pradip K. Srimani: An Examination of Fault Exposure Ratio. IEEE Trans. Software Eng. 19(11): 1087-1094 (1993) |

31 | Yordan Rouskov, Pradip K. Srimani: Fault Diameter of Star Graphs. Inf. Process. Lett. 48(5): 243-251 (1993) | |

30 | EE | Sumit Sur, Pradip K. Srimani: A self-stabilizing algorithm for coloring bipartite graphs. Inf. Sci. 69(3): 219-227 (1993) |

29 | EE | James M. Bieman, Pradip K. Srimani: Editor's corner : Applying specification, verification, and validation techniques. Journal of Systems and Software 21(3): 199-200 (1993) |

1992 | ||

28 | Pradip K. Srimani, Yashwant K. Malaiya: Steps to Practical Reliability Meassurement - Guest Editors' Introduction. IEEE Software 9(4): 10-12 (1992) | |

27 | Pradip K. Srimani, Rachamallu L. N. Reddy: Another Distributed Algorithm for Multiple Entries to a Critical Section. Inf. Process. Lett. 41(1): 51-57 (1992) | |

26 | Sumit Sur, Pradip K. Srimani: A Self-Stabilizing Distributed Algorithm to Construct BFS Spanning Trees of a Symmetric Graph. Parallel Processing Letters 2: 171-179 (1992) | |

1991 | ||

25 | EE | Pradip K. Srimani: Generalized Fault Tolerance Properties of Star Graphs. ICCI 1991: 510-519 |

24 | EE | Sumit Sur, Pradip K. Srimani: Super Star: a new optimally fault tolerant network architecture. ICDCS 1991: 590-597 |

23 | Sumit Sur, Pradip K. Srimani: A Fault-Tolerant Routing Algorithm for Star Graph Interconnection Network. ICPP (3) 1991: 267-270 | |

22 | Yashwant K. Malaiya, Pradip K. Srimani: An Introduction to Software Reliability Models. Int. CMG Conference 1991: 1237-1239 | |

1990 | ||

21 | Sujit Dey, Pradip K. Srimani: A New Parallel Sorting Algorithm and its Efficient VLSI Implementation. Comput. J. 33(3): 241-246 (1990) | |

20 | Pradip K. Srimani, Shivakant Mishra: Performance evaluation of distributed mutual exclusion algorithms for computer networks. Comput. Syst. Sci. Eng. 5(2): 59-64 (1990) | |

19 | EE | Shivakant Mishra, Pradip K. Srimani: Fault-tolerant mutual exclusion algorithms. Journal of Systems and Software 11(2): 111-129 (1990) |

1989 | ||

18 | Bhabani P. Sinha, Pradip K. Srimani: Fast Parallel Algorithms for Binary Multiplication and Their Implementation on Systolic Architectures. IEEE Trans. Computers 38(3): 424-431 (1989) | |

17 | EE | Pradip K. Srimani: Probabilistic analysis of output cost of a heuristic search algorithm. Inf. Sci. 47(1): 53-62 (1989) |

1988 | ||

16 | EE | Bhabani P. Sinha, Pradip K. Srimani: A new parallel multiplication algorithm and its VLSI implementation. ACM Conference on Computer Science 1988: 366-372 |

15 | EE | Sujit Dey, Pradip K. Srimani: Parallel VLSI computation of all shortest paths in a graph. ACM Conference on Computer Science 1988: 373-379 |

14 | Suchai Thanawastien, Pradip K. Srimani: The Universality of a Class of Modified Single-Stage Shuffle/Exchange Networks. IEEE Trans. Computers 37(3): 348-352 (1988) | |

13 | D. Murthy, Pradip K. Srimani: Split sequence coalesced hashing. Inf. Syst. 13(2): 211-218 (1988) | |

1987 | ||

12 | EE | Raj Sekhar Pamula, Pradip K. Srimani: Checkpointing strategies for database systems. ACM Conference on Computer Science 1987: 88-97 |

11 | Bhabani P. Sinha, Pradip K. Srimani: An O(log n) Parallel Algorithm for Binary Multiplication and its VLSI implementation. IEEE Real-Time Systems Symposium 1987: 54-62 | |

10 | Shyamal K. Chowdhury, Pradip K. Srimani: Worst Case Performance of Weighted Buddy Systems. Acta Inf. 24(5): 555-564 (1987) | |

1986 | ||

9 | EE | Suchai Thanawastien, Pradip K. Srimani: A class of modified single stage S/E networks. ACM Conference on Computer Science 1986: 147-154 |

8 | 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. IEEE Trans. Computers 35(11): 1000-1004 (1986) | |

1985 | ||

7 | A. Bagchi, Pradip K. Srimani: Weighted Heuristic Search in Networks. J. Algorithms 6(4): 550-576 (1985) | |

1984 | ||

6 | EE | Bhargab B. Bhattacharya, Suranjan Ghose, Bhabani P. Sinha, Pradip K. Srimani: Heuristic Search Approach to Optimal Routing in a Distributed Architecture. FSTTCS 1984: 152-164 |

1982 | ||

5 | EE | Pradip K. Srimani, Nanda De, Abhijit Sengupta, Subir Bandyopadhyay: A new approach to single-fault-tolerant realization of synchronous sequential machines. Inf. Sci. 26(3): 189-198 (1982) |

4 | EE | Pradip K. Srimani, Bhabani P. Sinha: Impossible pair constrained test path generation in a program. Inf. Sci. 28(2): 87-103 (1982) |

1981 | ||

3 | EE | Bhabani P. Sinha, Pradip K. Srimani, A. Guhathakurta, J. Duttagupta: Application of associative memories in designing assemblers. Inf. Sci. 24(3): 201-215 (1981) |

1979 | ||

2 | Abhijit Sengupta, Subir Bandyopadhyay, Pradip K. Srimani: On Identification of CR Property in File Organisation. Inf. Process. Lett. 9(2): 93-96 (1979) | |

1976 | ||

1 | 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''. IEEE Trans. Computers 25(10): 1053-1056 (1976) |