World's Best Scientists 2026 revealed!
Pradip K. Srimani

Pradip K. Srimani

D-Index & Metrics

Computer Science

D-Index
32
Citations
3555
World Ranking
13273
National Ranking
5313

Research.com Recognitions

  • 2008 - ACM Distinguished Member
  • 1999 - IEEE Fellow For contributions to the design and analysis of fault tolerant networks.

Overview

Pradip K. Srimani is affiliated with Clemson University in the United States. Their academic focus and career are marked by contributions to the design and analysis of fault tolerant networks.

Throughout their career, Srimani has received recognition from significant professional bodies. Notably, they were named an IEEE Fellow in 1999, with a citation specifically acknowledging their contributions to fault tolerant network design and analysis. Additionally, in 2008, Srimani was honored as an ACM Distinguished Member.

Best Publications

  • A strategy to manage cache consistency in a disconnected distributed environment

    S.K.S. Gupta;P.K. Srimani

  • Self-stabilizing algorithms for minimal dominating sets and maximal independent sets

    S.M. Hedetniemi;S.T. Hedetniemi;D.P. Jacobs;P.K. Srimani

  • An adaptive protocol for reliable multicast in mobile multi-hop radio networks

    S.K.S. Gupta;P.K. Srimani

  • A new family of Cayley graph interconnection networks of constant degree four

    P. Vadapalli;P.K. Srimani

  • Performance evaluation of distributed co-ordination function for IEEE 802.11 wireless LAN protocol in presence of mobile and hidden terminals

    S. Khurana;A. Kahol;S.K.S. Gupta;P.K. Srimani

  • Another distributed algorithm for multiple entries to a critical section

    Pradip K. Srimani;R. L. N. Reddy

  • Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks

    W. Goddard;S.T. Hedetniemi;D.P. Jacobs;P.K. Srimani

  • An examination of fault exposure ratio

    Y.K. Malaiya;A. von Mayrhauser;P.K. Srimani

  • Conditional Fault Diameter of Star Graph Networks

    Yordan Rouskov;Shahram Latifi;Pradip K. Srimani

  • Linear time self-stabilizing colorings

    Stephen T. Hedetniemi;David P. Jacobs;Pradip K. Srimani

  • Fault diameter of star graphs

    Yordan Rouskov;Pradip K. Srimani

  • Transposition networks as a class of fault-tolerant robust networks

    S. Latifi;P.K. Srimani

  • Maximal matching stabilizes in time O( m )

    Stephen T. Hedetniemi;David P. Jacobs;Pradip K. Srimani

  • Measure the semantic similarity of GO terms using aggregate information content

    Xuebo Song;Lin Li;Pradip K. Srimani;Philip S. Yu

  • A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph

    Zhenyu Xu;Stephen T. Hedetniemi;Wayne Goddard;Pradip K. Srimani

  • Parallel data intensive computing in scientific and commercial applications

    Mario Cannataro;Domenico Talia;Pradip K. Srimani

  • Software Reliability Models: Developments, Evaluation and Applications

    Yashwant K. Malaiya;P. K. Srimani

  • G-Bean: an ontology-graph based web tool for biomedical literature retrieval.

    James Zijun Wang;Yuanyuan Zhang;Liang Dong;Lin Li

  • Adaptive core selection and migration method for multicast routing in mobile ad hoc networks

    S.K.S. Gupta;P.K. Srimani

  • Computer engineering curriculum in the new millennium

    A. McGettrick;M.D. Theys;D.L. Soldan;P.K. Srimani

  • A new adaptive hardware tree-based multicast routing in k-ary n-cubes

    D.R. Kumar;W.A. Najjar;P.K. Srimani

Frequent Co-Authors

Sandeep K. S. Gupta
Sandeep K. S. Gupta Arizona State University
Stephen T. Hedetniemi
Stephen T. Hedetniemi Clemson University
Wayne Goddard
Wayne Goddard Clemson University
Yashwant K. Malaiya
Yashwant K. Malaiya Colorado State University
Walid Najjar
Walid Najjar University of California, Riverside
Philip S. Yu
Philip S. Yu University of Illinois at Chicago
Abdelmadjid Bouabdallah
Abdelmadjid Bouabdallah University of Technology of Compiègne
Domenico Talia
Domenico Talia University of Calabria
Shivakant Mishra
Shivakant Mishra University of Colorado Boulder
James M. Bieman
James M. Bieman Colorado State University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens the door to many related fields and flexible pathways. Students interested in data analysis and AI should consider a data science degree, which blends technology skills with real-world data applications. These programs are often offered online, making them accessible and affordable for many learners.

For those eager to work with hardware, robotics, or automation, pursuing an online bachelor’s in electrical engineering can be a smart move. These degrees can complement a computer science background and expand your job prospects in technical fields.

If you’re seeking a fast route into the workforce, consider earning certifications for jobs in tech. Many certifications require less time than full degrees and can quickly boost your employability and earning potential.

Finally, if you're looking to upskill quickly, check out the shortest masters degree programs online. These accelerated programs help professionals gain advanced knowledge in just a year, further enhancing career growth opportunities.

Best Scientists Citing Pradip K. Srimani

Trending Scientists

Recently Published Articles