default search action
Pradip K. Srimani
Person information
- affiliation: Clemson University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
- [j98]Pradip K. Srimani, James Z. Wang:
Self-stabilizing algorithm for two disjoint minimal dominating sets. Inf. Process. Lett. 147: 38-43 (2019) - 2017
- [j97]Pengfei Xuan, Walter B. Ligon III, Pradip K. Srimani, Rong Ge, Feng Luo:
Accelerating big data analytics on HPC clusters using two-level storage. Parallel Comput. 61: 18-34 (2017) - 2016
- [j96]Yihua Ding, James Z. Wang, Pradip K. Srimani:
A Linear Time Self-stabilizing Algorithm for Minimal Weakly Connected Dominating Sets. Int. J. Parallel Program. 44(1): 151-162 (2016) - 2015
- [j95]Yihua Ding, James Zijun Wang, Pradip K. Srimani:
New Self-Stabilizing Algorithms for Minimal Weakly Connected Dominating Sets. Int. J. Found. Comput. Sci. 26(2): 229-240 (2015) - [j94]Yihua Ding, James Zijun Wang, Pradip K. Srimani:
Self-Stabilizing Algorithms for Maximal 2-packing and General k-packing (k ≥ 2) with Safe Convergence in an Arbitrary Graph. Int. J. Netw. Comput. 5(1): 105-121 (2015) - [j93]Yihua Ding, James Z. Wang, Pradip K. Srimani:
Self-Stabilizing Algorithm for Minimal Dominating Set with Safe Convergence in an Arbitrary Graph. Parallel Process. Lett. 25(4): 1550011:1-1550011:14 (2015) - 2014
- [j92]James Zijun Wang, Yuanyuan Zhang, Liang Dong, Lin Li, Pradip K. Srimani, Philip S. Yu:
G-Bean: an ontology-graph based web tool for biomedical literature retrieval. BMC Bioinform. 15(S-12): S1 (2014) - [j91]Yihua Ding, James Zijun Wang, Pradip K. Srimani:
Self-Stabilizing Master-Slave Token Circulation Algorithm in Undirected Rings and Unicyclic Graphs of Arbitrary Size and Their Orientations. Int. J. Netw. Comput. 4(1): 42-52 (2014) - [j90]Xuebo Song, Lin Li, Pradip K. Srimani, Philip S. Yu, James Z. Wang:
Measure the Semantic Similarity of GO Terms Using Aggregate Information Content. IEEE ACM Trans. Comput. Biol. Bioinform. 11(3): 468-476 (2014) - 2012
- [j89]Wayne Goddard, Pradip K. Srimani:
Self-Stabilizing Master-Slave Token Circulation and Efficient Size-Computation in a Unidirectional Ring of Arbitrary Size. Int. J. Found. Comput. Sci. 23(4): 763-778 (2012) - 2010
- [j88]James Z. Wang, Farha Ali, Pradip K. Srimani:
An efficient method to measure the semantic similarity of ontologies. Int. J. Pervasive Comput. Commun. 6(1): 88-103 (2010) - [j87]Zhenyu Xu, James Zijun Wang, Pradip K. Srimani:
Distributed fault tolerant computation of weakly connected dominating set in ad hoc networks. J. Supercomput. 53(1): 182-195 (2010) - 2008
- [j86]Koushik Sinha, Suranjan Ghose, Pradip K. Srimani:
Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks. J. Parallel Distributed Comput. 68(7): 922-938 (2008) - [j85]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu:
Self-Stabilizing Graph Protocols. Parallel Process. Lett. 18(1): 189-199 (2008) - 2007
- [j84]James Zijun Wang, Zhidian Du, Pradip K. Srimani:
Cooperative proxy caching for wireless base stations. Mob. Inf. Syst. 3(1): 1-18 (2007) - 2006
- [j83]L. Wang, S. Subramanian, Shahram Latifi, Pradip K. Srimani:
Distance distribution of nodes in star graphs. Appl. Math. Lett. 19(8): 780-784 (2006) - [j82]Zhenyu Xu, Pradip K. Srimani:
Self-stabilizing Anonymous Leader Election in a Tree. Int. J. Found. Comput. Sci. 17(2): 323-336 (2006) - [j81]Zhengnan Shi, Pradip K. Srimani:
An online distributed gossiping protocol for mobile networks. J. Comb. Optim. 11(1): 87-97 (2006) - [j80]Koushik Sinha, Pradip K. Srimani:
Deterministic Broadcast and Gossiping Algorithms for Ad hoc Networks. J. Supercomput. 37(2): 115-144 (2006) - 2005
- [j79]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Self-Stabilizing Global Optimization Algorithms for Large Network Graphs. Int. J. Distributed Sens. Networks 1(3&4): 329-344 (2005) - [j78]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) - [j77]Wei Shi, Pradip K. Srimani:
Leader election in hierarchical star network. J. Parallel Distributed Comput. 65(11): 1435-1442 (2005) - [j76]Wei Shi, Pradip K. Srimani:
Hierarchical star: a new two level interconnection network. J. Syst. Archit. 51(1): 1-14 (2005) - [j75]Wei Shi, Abdelmadjid Bouabdallah, Pradip K. Srimani:
Leader election in oriented star graphs. Networks 45(3): 169-179 (2005) - 2004
- [j74]Giovanni Aloisio, Maria Mirto, Pradip K. Srimani, Pit Pichappan:
Editorial. J. Digit. Inf. Manag. 2(2): 41-43 (2004) - [j73]Vasu Jolly, Naoto Kimura, Shahram Latifi, Pradip K. Srimani:
Loop detection in MPLS for wireless sensor networks. Microprocess. Microsystems 28(8): 439-445 (2004) - 2003
- [j72]Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Linear time self-stabilizing colorings. Inf. Process. Lett. 87(5): 251-255 (2003) - [j71]Sandeep K. S. Gupta, Pradip K. Srimani:
Self-stabilizing multicast protocols for ad hoc networks. J. Parallel Distributed Comput. 63(1): 87-96 (2003) - [j70]Cheng-Zhong Xu, Hai Jin, Pradip K. Srimani:
Special issue on scalable web services and architecture. J. Parallel Distributed Comput. 63(10): 913-915 (2003) - [j69]Rajarathnam Chandramouli, Rajeev Shorey, Pradip K. Srimani, X. Wang, H. Yu:
Guest editorial recent advances in wireless multimedia. IEEE J. Sel. Areas Commun. 21(10): 1501-1505 (2003) - [j68]Andrew D. McGettrick, Mitchell D. Theys, David L. Soldan, Pradip K. Srimani:
Computer engineering curriculum in the new millennium. IEEE Trans. Educ. 46(4): 456-462 (2003) - [j67]Sandeep K. S. Gupta, Pradip K. Srimani:
Adaptive Core Selection and Migration Method for Multicast Routing in Mobile Ad Hoc Networks. IEEE Trans. Parallel Distributed Syst. 14(1): 27-38 (2003) - [j66]Yu-Chee Tseng, Sandeep K. S. Gupta, Wang-Chien Lee, Pradip K. Srimani:
Editorial. Wirel. Networks 9(2): 93-94 (2003) - 2002
- [j65]Domenico Talia, Pradip K. Srimani:
Parallel data-intensive algorithms and applications (guest editorial). Parallel Comput. 28(5): 669-671 (2002) - [j64]Mario Cannataro, Domenico Talia, Pradip K. Srimani:
Parallel data intensive computing in scientific and commercial applications. Parallel Comput. 28(5): 673-704 (2002) - [j63]Pradip K. Srimani, Wang-Chien Lee, Sandeep K. S. Gupta:
Guest Editorial: Special Section on Data Management Systems and Mobile Computing. IEEE Trans. Computers 51(10): 1121-1123 (2002) - [j62]Kent Fitzgerald, Shahram Latifi, Pradip K. Srimani:
Reliability modeling and assessment of the Star-Graph networks. IEEE Trans. Reliab. 51(1): 49-57 (2002) - 2001
- [j61]Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Maximal matching stabilizes in time O(m). Inf. Process. Lett. 80(5): 221-223 (2001) - [j60]Anurag Kahol, Sumit Khurana, Sandeep K. S. Gupta, Pradip K. Srimani:
Adaptive Distributed Dynamic Channel Allocation for Wireless Networks. J. Parallel Distributed Comput. 61(7): 898-914 (2001) - [j59]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 Distributed Comput. 61(9): 1249-1277 (2001) - [j58]Gheorghe Antonoiu, Pradip K. Srimani:
Self-stabilizing depth-first multi-token circulation in tree networks. Parallel Algorithms Appl. 16(1): 17-35 (2001) - [j57]Wei Shi, Pradip K. Srimani:
A regular scalable fault tolerant interconnection network for distributed processing. Parallel Comput. 27(14): 1897-1919 (2001) - [j56]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) - [j55]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 Distributed Syst. 12(7): 686-700 (2001) - [j54]Sandeep K. S. Gupta, Wang-Chien Lee, Apratim Purakayastha, Pradip K. Srimani:
An overview of pervasive computing. IEEE Wirel. Commun. 8(4): 8-9 (2001) - 2000
- [j53]Mohammed Atiquzzaman, Pradip K. Srimani:
Parallel computing on clusters of workstations. Parallel Comput. 26(2-3): 175-177 (2000) - [j52]Shahram Latifi, Myung Hoon Lee, Pradip K. Srimani:
Wormhole Broadcast in Hypercubes. J. Supercomput. 15(2): 183-192 (2000) - [j51]Sandeep K. S. Gupta, Pradip K. Srimani:
UpdateSearch: A New Dynamic Channel Allocation Scheme for Mobile Networks That Can Adjust to System Loads. J. Supercomput. 17(1): 47-65 (2000) - [j50]Hyosun Ko, Shahram Latifi, Pradip K. Srimani:
Near-Optimal Broadcast in All-Port Wormhole-Routed Hypercubes Using Error-Correcting Codes. IEEE Trans. Parallel Distributed Syst. 11(3): 247-260 (2000) - [j49]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) - [j48]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) - 1999
- [j47]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) - [j46]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
- [j45]Shahram Latifi, Pradip K. Srimani:
Wormhole Broadcast in Star Graph Networks. Parallel Comput. 24(8): 1263-1276 (1998) - [j44]Shahram Latifi, Pradip K. Srimani:
Sep: A Fixed Degree Regular Network for Massively Parallel Systems. J. Supercomput. 12(3): 277-291 (1998) - 1997
- [j43]Pradip K. Srimani:
Guest Editor's introduction Distributed computing systems. Int. J. Syst. Sci. 28(11): 1021-1024 (1997) - [j42]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
- [j41]Sankar K. Pal, Pradip K. Srimani:
Neurocomputing: Motivations, Models, and Hybridization - Guest Editors' Introduction. Computer 29(3): 24-28 (1996) - [j40]Premkumar Vadapalli, Pradip K. Srimani:
Shortest Routing in Trivalent Cayley Graph Network. Inf. Process. Lett. 57(4): 183-188 (1996) - [j39]Premkumar Vadapalli, Pradip K. Srimani:
Fault Tolerant Ring Embedding in tetravalent Cayley Network Graphs. J. Circuits Syst. Comput. 6(5): 527-536 (1996) - [j38]Yordan Rouskov, Shahram Latifi, Pradip K. Srimani:
Conditional Fault Diameter of Star Graph Networks. J. Parallel Distributed Comput. 33(1): 91-97 (1996) - [j37]Gheorghe Antonoiu, Pradip K. Srimani:
A Self-Stabilizing Leader Election Algorithm for Tree Graphs. J. Parallel Distributed Comput. 34(2): 227-232 (1996) - [j36]James M. Bieman, Pradip K. Srimani:
Guest editors' corner software engineering for distributed computing. J. Syst. Softw. 33(3): 205-206 (1996) - [j35]Pradip K. Srimani:
Super Rotator: Incrementally Extensible Directed Network Graph of Sublogarithmic Diameter. Parallel Process. Lett. 6(4): 479-490 (1996) - [j34]Shahram Latifi, Pradip K. Srimani:
Transposition Networks as a Class of Fault-Tolerant Robust Networks. IEEE Trans. Computers 45(2): 230-238 (1996) - [j33]Premkumar Vadapalli, Pradip K. Srimani:
A New Family of Cayley Graph Interconnection Networks of Constant Degree Four. IEEE Trans. Parallel Distributed Syst. 7(1): 26-32 (1996) - 1995
- [j32]Sumit Sur, Pradip K. Srimani:
IEH Graphs. A Novel Generalization of Hypercube Graphs. Acta Informatica 32(6): 597-609 (1995) - [j31]Premkumar Vadapalli, Pradip K. Srimani:
Trivalent Cayley Graphs for Interconnection Networks. Inf. Process. Lett. 54(6): 329-335 (1995) - [j30]Sumit Sur, Pradip K. Srimani:
An Almost Regular Fault Tolerant Network with Arbitrary Number of Nodes. J. Parallel Distributed Comput. 26(1): 54-60 (1995) - [j29]Pradip K. Srimani:
Guest Editor's Introduction. VLSI Design 2(4): i-ii (1995) - 1994
- [j28]Naomi S. DeMent, Pradip K. Srimani:
A new algorithm for k mutual exclusions in distributed systems. J. Syst. Softw. 26(2): 179-191 (1994) - [j27]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) - [j26]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) - 1993
- [j25]Yordan Rouskov, Pradip K. Srimani:
Fault Diameter of Star Graphs. Inf. Process. Lett. 48(5): 243-251 (1993) - [j24]Sumit Sur, Pradip K. Srimani:
A self-stabilizing algorithm for coloring bipartite graphs. Inf. Sci. 69(3): 219-227 (1993) - [j23]James M. Bieman, Pradip K. Srimani:
Editor's corner : Applying specification, verification, and validation techniques. J. Syst. Softw. 21(3): 199-200 (1993) - [j22]Yashwant K. Malaiya, Anneliese von Mayrhauser, Pradip K. Srimani:
An Examination of Fault Exposure Ratio. IEEE Trans. Software Eng. 19(11): 1087-1094 (1993) - [j21]Walid A. Najjar, Pradip K. Srimani:
Conditional Disconnection Probability in Star Graphs. VLSI Design 1(1): 61-70 (1993) - 1992
- [j20]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) - [j19]Sumit Sur, Pradip K. Srimani:
A Self-Stabilizing Distributed Algorithm to Construct BFS Spanning Trees of a Symmetric Graph. Parallel Process. Lett. 2: 171-179 (1992) - [j18]Pradip K. Srimani, Yashwant K. Malaiya:
Steps to Practical Reliability Meassurement - Guest Editors' Introduction. IEEE Softw. 9(4): 10-12 (1992) - 1990
- [j17]Sujit Dey, Pradip K. Srimani:
A New Parallel Sorting Algorithm and its Efficient VLSI Implementation. Comput. J. 33(3): 241-246 (1990) - [j16]Pradip K. Srimani, Shivakant Mishra:
Performance evaluation of distributed mutual exclusion algorithms for computer networks. Comput. Syst. Sci. Eng. 5(2): 59-64 (1990) - [j15]Shivakant Mishra, Pradip K. Srimani:
Fault-tolerant mutual exclusion algorithms. J. Syst. Softw. 11(2): 111-129 (1990) - 1989
- [j14]Pradip K. Srimani:
Probabilistic analysis of output cost of a heuristic search algorithm. Inf. Sci. 47(1): 53-62 (1989) - [j13]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) - 1988
- [j12]D. Murthy, Pradip K. Srimani:
Split sequence coalesced hashing. Inf. Syst. 13(2): 211-218 (1988) - [j11]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) - 1987
- [j10]Shyamal K. Chowdhury, Pradip K. Srimani:
Worst Case Performance of Weighted Buddy Systems. Acta Informatica 24(5): 555-564 (1987) - 1986
- [j9]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
- [j8]A. Bagchi, Pradip K. Srimani:
Weighted Heuristic Search in Networks. J. Algorithms 6(4): 550-576 (1985) - 1983
- [j7]Pradip K. Srimani, Bhabani P. Sinha:
A simple way to near minimization of microprogram control memory. Int. J. Parallel Program. 12(1): 47-64 (1983) - 1982
- [j6]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) - [j5]Pradip K. Srimani, Bhabani P. Sinha:
Impossible pair constrained test path generation in a program. Inf. Sci. 28(2): 87-103 (1982) - 1981
- [j4]Bhabani P. Sinha, Pradip K. Srimani, A. Guhathakurta, J. Duttagupta:
Application of associative memories in designing assemblers. Inf. Sci. 24(3): 201-215 (1981) - 1980
- [j3]Nanda De, Abhijit Sengupta, Subir Bandyopadhyay, Pradip K. Srimani:
A new method to test system diagnosability. Inf. Sci. 22(2): 131-138 (1980) - 1979
- [j2]Abhijit Sengupta, Subir Bandyopadhyay, Pradip K. Srimani:
On Identification of CR Property in File Organisation. Inf. Process. Lett. 9(2): 93-96 (1979) - 1976
- [j1]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)
Conference and Workshop Papers
- 2020
- [c102]Yihua Ding, James Z. Wang, Pradip K. Srimani:
An O(n2) Self-Stabilizing Algorithm for Minimal Total Dominating Set in Arbitrary Graphs. WI/IAT 2020: 49-54 - 2019
- [c101]Xuebo Song, Pradip K. Srimani, James Z. Wang:
HWE: Hybrid Word Embeddings For Text Classification. NLPIR 2019: 25-29 - [c100]Yihua Ding, James Z. Wang, Pradip K. Srimani:
Self-Stabilizing Topology Computation (Identification) of Cactus Graphs Using Master Slave Token Circulation. WI 2019: 308-311 - 2018
- [c99]Pradip K. Srimani, James Zijun Wang, Yihua Ding:
Self-Stabilizing Master-Slave Token Circulation in Unoriented Cactus Graphs. WI 2018: 41-48 - 2017
- [c98]Pengfei Xuan, Feng Luo, Rong Ge, Pradip K. Srimani:
Dynamic Management of In-memory Storage for Efficiently Integrating Compute- and Data-intensive Computing on HPC Systems. CCGrid 2017: 549-558 - 2016
- [c97]Yuehua Zhang, Pengfei Xuan, Yunsheng Wang, Pradip K. Srimani, Feng Luo:
A de novo genome assembler based on MapReduce and bi-directed de Bruijn graph. BIBM 2016: 65-71 - [c96]Yuanyuan Zhang, James Z. Wang, Pradip K. Srimani:
Semantic Graph based Pseudo Relevance Feedback for Biomedical Information Retrieval. CSBio 2016: 48-52 - [c95]Feng Luo, Pradip K. Srimani:
New Biology Inspired Anonymous Distributed Algorithms to Compute Dominating and Total Dominating Sets in Network Graphs. IPDPS Workshops 2016: 517-524 - [c94]Yihua Ding, James Zijun Wang, Pradip K. Srimani:
Self-Stabilizing Computation of Perfect Neighborhood Set in Large Network Graphs. WI 2016: 435-438 - 2015
- [c93]Pengfei Xuan, Jeffrey Denton, Pradip K. Srimani, Rong Ge, Feng Luo:
Big data analytics on traditional HPC infrastructure using two-level storage. DISCS@SC 2015: 4:1-4:8 - 2014
- [c92]Sufeng Niu, Guangyu Yang, Nilim Sarma, Pengfei Xuan, Melissa C. Smith, Pradip K. Srimani, Feng Luo:
Combining Hadoop and GPU to preprocess large Affymetrix microarray data. IEEE BigData 2014: 692-700 - [c91]Yihua Ding, James Zijun Wang, Pradip K. Srimani:
Self-Stabilizing Selection of Influential Users in Social Networks. CSE 2014: 1558-1565 - [c90]Yihua Ding, James Zijun Wang, Pradip K. Srimani:
Self-Stabilizing Algorithm for Maximal 2-Packing with Safe Convergence in an Arbitrary Graph. IPDPS Workshops 2014: 747-754 - [c89]Yihua Ding, James Zijun Wang, Pradip K. Srimani:
Fault-Tolerant Distributed Publish/Subscribe Using Self-Stabilization. PAAP 2014: 13-18 - [c88]Yihua Ding, James Z. Wang, Pradip K. Srimani:
Self-stabilizing Minimal Global Offensive Alliance Algorithm with Safe Convergence in an Arbitrary Graph. TAMC 2014: 366-377 - 2013
- [c87]Lu Zhang, Yunsheng Wang, Pengfei Xuan, Alexander Duvall, Jonathan Lowe, Yanyan Wang, Arvind Subramanian, Pradip K. Srimani, Feng Luo, Yongping Duan:
Sesame: A new bioinformatics semantic workflow design system. BIBM 2013: 504-508 - [c86]Yuanyuan Zhang, Liang Dong, Lin Li, Pradip K. Srimani, Philip S. Yu, James Z. Wang:
G-Bean: An ontology-graph based web tool for biomedical literature retrieval. BIBM 2013: 623 - [c85]Yihua Ding, James Zijun Wang, Pradip K. Srimani:
Self-Stabilizing Master-Slave Token Circulation Algorithm in an Undirected Ring of Arbitrary Size and Its Orientation. IPDPS Workshops 2013: 659-666 - [c84]Xuebo Song, Lin Li, Pradip K. Srimani, Philip S. Yu, James Z. Wang:
Measure the Semantic Similarity of GO Terms Using Aggregate Information Content. ISBRA 2013: 224-236 - [c83]Wayne Goddard, Pradip K. Srimani:
Daemon Conversions in Distributed Self-stabilizing Algorithms. WALCOM 2013: 146-157 - 2012
- [c82]Yihua Ding, James Z. Wang, Pradip K. Srimani:
Churn Tolerance Algorithm for State Machine Replication. IAT 2012: 356-360 - [c81]Wei Shi, Feng Luo, Pradip K. Srimani:
A New Hierarchical Structure of Star Graphs and Applications. ICDCIT 2012: 267-268 - 2011
- [c80]Gongbing Hong, Pradip K. Srimani:
A self-stabilizing algorithm for two disjoint minimal dominating sets in an arbitrary graph. ACM Southeast Regional Conference 2011: 306-307 - [c79]Bo Li, Yuehua Zhang, Pradip K. Srimani, Feng Luo:
Predicing Yeast Synthetic Lethal Genetic Interactions Using Short Polypeptide Clusters. BIBM 2011: 185-190 - [c78]Liang Dong, Pradip K. Srimani, James Z. Wang:
Ontology Graph Based Query Expansion for Biomedical Information Retrieval. BIBM 2011: 488-493 - [c77]Wayne Goddard, Pradip K. Srimani:
Self-Stabilizing Master-Slave Token Circulation and Efficient Topology Computation in a Tree of Arbitrary Size. IPDPS Workshops 2011: 618-625 - 2010
- [c76]Wayne Goddard, Pradip K. Srimani:
Self-stabilizing master-slave token circulation and efficient size-computation in a unidirectional ring of arbitrary size. IPDPS Workshops 2010: 1-8 - [c75]James Z. Wang, Timothy A. Davis, James Westall, Pradip K. Srimani:
Undergraduate database instruction with MeTube. ITiCSE 2010: 279-283 - [c74]Sally K. Wahba, Jason O. Hallstrom, Pradip K. Srimani, Nigamanth Sridhar:
SFS3: a simulation framework for self-stabilizing systems. SpringSim 2010: 172 - [c73]Liang Dong, Pradip K. Srimani, James Z. Wang:
WEST: Weighted-Edge Based Similarity Measurement Tools for Word Semantics. Web Intelligence 2010: 216-223 - 2008
- [c72]James Zijun Wang, Farha Ali, Pradip K. Srimani:
An Efficient Method to Measure the Semantic Similarity of Ontologies. GPC 2008: 447-458 - [c71]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 - 2007
- [c70]Pradip K. Srimani, Zhenyu Xu:
Distributed Protocols for Defensive and Offensive Alliances in Network Graphs Using Self-Stabilization. ICCTA 2007: 27-31 - [c69]Pradip K. Srimani, Zhenyu Xu:
Self-Stabilizing Algorithms of Constructing Spanning Tree and Weakly Connected Minimal Dominating Set. ICDCS Workshops 2007: 3 - [c68]Pradip K. Srimani:
Self-stabilizing Distributed Algorithms for Networks. ISPA 2007: 1-2 - 2006
- [c67]Zhenyu Xu, Pradip K. Srimani:
Self-stabilizing distributed algorithms for graph alliances. IPDPS 2006 - 2005
- [c66]Zhengnan Shi, Pradip K. Srimani:
An Efficient Distributed Protocol for Online Gossiping Problem. IAT 2005: 599-602 - [c65]Zhenyu Xu, Pradip K. Srimani:
Self-Stabilizing Anonymous Leader Election in a Tree. IPDPS 2005 - [c64]Zhenyu Xu, Pradip K. Srimani:
Protocols for Sensor Networks Using COSMOS Model. IWDC 2005: 75-86 - [c63]Zhenyu Xu, Pradip K. Srimani:
Self-stabilizing Publish/Subscribe Protocol for P2P Networks. IWDC 2005: 129-140 - [c62]James Zijun Wang, Zhidian Du, Pradip K. Srimani:
Network Cache Model for Wireless Proxy Caching. MASCOTS 2005: 311-314 - 2004
- [c61]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Fault Tolerant Algorithms for Orderings and Colorings. IPDPS 2004 - [c60]Pradip K. Srimani, Bhabani P. Sinha:
Mobility Tolerant Broadcast in Mobile Ad Hoc Networks. IWDC 2004: 435-446 - [c59]Koushik Sinha, Pradip K. Srimani:
Broadcast and Gossiping Algorithms for Mobile Ad Hoc Networks Based on Breadth-First Traversal. IWDC 2004: 459-470 - [c58]Jun Zheng, Emma E. Regentova, Pradip K. Srimani:
Dynamic Location Management with Personalized Location Area for Future PCS Networks. IWDC 2004: 495-501 - [c57]Wei Shi, Pradip K. Srimani:
Leader Election in Hyper-Butterfly Graphs. NPC 2004: 292-299 - [c56]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 - [c55]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 - [c54]Koushik Sinha, Pradip K. Srimani:
Broadcast Algorithms for Mobile Ad hoc Networks based on Depth-first Traversal. Wireless Information Systems 2004: 170-178 - 2003
- [c53]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 - [c52]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 - [c51]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 - [c50]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 - [c49]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 - [c48]John Impagliazzo, Robert H. Sloan, Andrew D. McGettrick, Pradip K. Srimani:
Computer engineering computing curricula. SIGCSE 2003: 355-356 - 2002
- [c47]Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Fault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time. IPDPS 2002 - [c46]L. Wang, S. Subramanian, Shahram Latifi, Pradip K. Srimani:
Distance Spectrum of Nodes in Star Graphs. PDPTA 2002: 1591-1595 - 2001
- [c45]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 - 2000
- [c44]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 - [c43]Anurag Kahol, Ramandeep Singh Khurana, Sandeep K. S. Gupta, Pradip K. Srimani:
An Efficient Cache Maintenance Scheme for Mobile Environment. ICDCS 2000: 530-537 - [c42]Sandeep K. S. Gupta, Wang-Chien Lee, Pradip K. Srimani:
Message from the Chairs. ICPP Workshops 2000: 3 - 1999
- [c41]Sandeep K. S. Gupta, Pradip K. Srimani:
Using self-stabilization to design adaptive multicast protocols for mobile ad hoc networks. Mobile Networks and Computing 1999: 67-84 - [c40]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 - [c39]Sandeep K. S. Gupta, Pradip K. Srimani:
Mobility Tolerant Maintenance of Multi-Cast Tree in Mobile Multi-Hop Radio Networks. ICPP 1999: 490-497 - [c38]Sandeep K. S. Gupta, Pradip K. Srimani:
Distributed dynamic channel allocation in mobile networks: combining search and update. IPCCC 1999: 120-126 - [c37]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 - [c36]Pradip K. Srimani:
CC-2001, Computer Science & Engineering Curricula for the Next Decade: A Status Report. MSE 1999: 100- - [c35]Kent Fitzgerald, Shahram Latifi, Pradip K. Srimani:
Realiability Modeling of Star Graph Networks. PDPTA 1999: 2328-2331 - [c34]Kalyan Ram Palgummi, Shahram Latifi, Pradip K. Srimani:
Routing in Star Graph Using Binary Labels. PDPTA 1999: 2410-2416 - [c33]Sandeep K. S. Gupta, Pradip K. Srimani:
An Adaptive Protocol for Reliable Multicast in Mobile Multi-hop Radio Networks. WMCSA 1999: 111- - [c32]Carl K. Chang, Gerald L. Engel, Willis King, Eric Roberts, Russell L. Shackelford, Robert H. Sloan, Pradip K. Srimani:
Curriculum 2001: bringing the future to the classroom. ITiCSE-WGR 1999: 70-73 - 1998
- [c31]Gheorghe Antonoiu, Pradip K. Srimani:
Mutual Exclusion Between Neighboring Nodes in a Tree That Stabilizes Using Read/Write Atomicity. Euro-Par 1998: 545-553 - [c30]Wei Shi, Pradip K. Srimani:
One to all broadcast in hyper butterfly networks. HiPC 1998: 155-162 - [c29]Anurag Kahol, Sumit Khurana, Sandeep K. S. Gupta, Pradip K. Srimani:
Adaptive Distributed Dynamic Channel Allocation for Wireless Networks. ICPP Workshops 1998: 124-133 - [c28]Wei Shi, Pradip K. Srimani:
Hyper Butterfly Network: A Scalable Optimally Fault Tolerant Architecture. IPPS/SPDP 1998: 732-736 - 1997
- [c27]Gheorghe Antonoiu, Pradip K. Srimani:
Distributed Self-Stabilizing Algorithm for Minimum Spanning Tree Construction. Euro-Par 1997: 480-487 - [c26]Shahram Latifi, Yordan Rouskov, Pradip K. Srimani:
Fault Tolerant Routing in Star Graph Networks in the Forbidden Fault Model. PDPTA 1997: 1605-1613 - 1996
- [c25]Shahram Latifi, Pradip K. Srimani:
A new fixed degree regular network for parallel processing. SPDP 1996: 152-159 - 1995
- [c24]Shahram Latifi, Pradip K. Srimani:
Wildcard Dimensions in Augmented Star and Bubble-Sort Networks. MASCOTS 1995: 335-339 - 1994
- [c23]Walid A. Najjar, Annette Lagman, Sumit Sur, Pradip K. Srimani:
Modeling Adaptive Routing in k-ary n-cube Networks. MASCOTS 1994: 120-125 - [c22]Premkumar Vadapalli, Pradip K. Srimani:
A new family of fixed degree Cayley networks for multiprocessor design. SPDP 1994: 394-401 - 1993
- [c21]Pradip K. Srimani:
Software Engineering and Information Technology - Introduction. ICCI 1993: 392 - [c20]Pradip K. Srimani:
Maximally Fault Tolerant Directed Network Graph With Sublogarithmic Diameter For Arbitrary Number of Nodes. ICPP (3) 1993: 231-234 - [c19]S. Datta, Ratan Kumar Guha, B. Gupta, Pradip K. Srimani:
Revolving hierarchy in a hypercube distributed system. ISCAS 1993: 2537-2540 - [c18]Srinivasan Chandrasekar, Pradip K. Srimani:
A new fault tolerant distributed algorithm for longest paths in a DAG. ISSRE 1993: 202-206 - [c17]Anneliese von Mayrhauser, Yashwant K. Malaiya, Pradip K. Srimani, James Keables:
On the need for simulation for better characterization of software reliability. ISSRE 1993: 264-273 - [c16]Annette Lagman, Walid A. Najjar, Sumit Sur, Pradip K. Srimani:
Evaluation of Idealized Adaptive Routing on k-ary n-cubes. SPDP 1993: 166-169 - 1992
- [c15]Yashwant K. Malaiya, Anneliese von Mayrhauser, Pradip K. Srimani:
The nature of fault exposure ratio. ISSRE 1992: 23-32 - [c14]Rachamallu L. N. Reddy, B. Gupta, Pradip K. Srimani:
A new fault tolerant distributed mutual exclusion algorithm. SAC 1992: 831-839 - 1991
- [c13]Walid A. Najjar, Pradip K. Srimani:
Network resilience of star graphs: a comparative analysis. ACM Conference on Computer Science 1991: 349-357 - [c12]Yashwant K. Malaiya, Pradip K. Srimani:
An Introduction to Software Reliability Models. Int. CMG Conference 1991: 1237-1239 - [c11]Pradip K. Srimani:
Generalized Fault Tolerance Properties of Star Graphs. ICCI 1991: 510-519 - [c10]Sumit Sur, Pradip K. Srimani:
Super Star: a new optimally fault tolerant network architecture. ICDCS 1991: 590-597 - [c9]Sumit Sur, Pradip K. Srimani:
A Fault-Tolerant Routing Algorithm for Star Graph Interconnection Network. ICPP (3) 1991: 267-270 - 1988
- [c8]Bhabani P. Sinha, Pradip K. Srimani:
A new parallel multiplication algorithm and its VLSI implementation. ACM Conference on Computer Science 1988: 366-372 - [c7]Sujit Dey, Pradip K. Srimani:
Parallel VLSI computation of all shortest paths in a graph. ACM Conference on Computer Science 1988: 373-379 - 1987
- [c6]Raj Sekhar Pamula, Pradip K. Srimani:
Checkpointing strategies for database systems. ACM Conference on Computer Science 1987: 88-97 - [c5]Bhabani P. Sinha, Pradip K. Srimani:
An O(log n) Parallel Algorithm for Binary Multiplication and its VLSI implementation. RTSS 1987: 54-62 - 1986
- [c4]Suchai Thanawastien, Pradip K. Srimani:
A class of modified single stage S/E networks. ACM Conference on Computer Science 1986: 147-154 - 1984
- [c3]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 - 1980
- [c2]Pradip K. Srimani, Bhabani P. Sinha:
Some studies on microprogram optimization. MICRO 1980: 30-37 - 1978
- [c1]Samar K. Chakravarty, Pradip K. Srimani:
An optimal adaptation logic for delta modulation. ICASSP 1978: 312-315
Parts in Books or Collections
- 2005
- [p1]Zhengnan Shi, Pradip K. Srimani:
Self-Stabilizing Distributed Systems and Sensor Networks. Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks 2005: 393-402
Editorship
- 2013
- [e1]Chittaranjan Hota, Pradip K. Srimani:
Distributed Computing and Internet Technology, 9th International Conference, ICDCIT 2013, Bhubaneswar, India, February 5-8, 2013. Proceedings. Lecture Notes in Computer Science 7753, Springer 2013, ISBN 978-3-642-36070-1 [contents]
Informal and Other Publications
- 2016
- [i2]Pengfei Xuan, Feng Luo, Rong Ge, Pradip K. Srimani:
DynIMS: A Dynamic Memory Controller for In-memory Storage on HPC Systems. CoRR abs/1609.09294 (2016) - 2015
- [i1]Pengfei Xuan, Jeffrey Denton, Feng Luo, Pradip K. Srimani:
Big Data Analytics on Traditional HPC Infrastructure Using Two-Level Storage. CoRR abs/1508.01847 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint