World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
45
Citations
9460
World Ranking
7140
National Ranking
3130

Overview

P. M. Melliar-Smith is affiliated with the University of California, Santa Barbara in the United States. Their research primarily focuses on computer science, with particular attention to subfields such as computer networks and communications, and information systems.

The scientist has contributed to topics including distributed systems and fault tolerance, service-oriented architecture and web services, and software system performance and reliability.

Among the recent scholarly works by P. M. Melliar-Smith is the paper titled Achieving Atomicity for Web Services Using Commutativity of Actions, published in 2020 within the venue Zenodo (CERN European Organization for Nuclear Research).

  • Achieving Atomicity for Web Services Using Commutativity of Actions (2020, Zenodo (CERN European Organization for Nuclear Research))

Collaborative efforts include work with coauthor Louise E. Moser.

  • Louise E. Moser

Their publications have appeared in venues such as:

  • Zenodo (CERN European Organization for Nuclear Research)

Best Publications

  • An analysis of the optimum node density for ad hoc mobile networks

    Unknown

  • Synchronizing clocks in the presence of faults

    Leslie Lamport;P. M. Melliar-Smith

  • Totem: a fault-tolerant multicast group communication system

    Unknown

  • The Totem single-ring ordering and membership protocol

    Y. Amir;L. E. Moser;P. M. Melliar-Smith;D. A. Agarwal

  • A program structure for error detection and recovery

    James J. Horning;Hugh C. Lauer;P. M. Melliar-Smith;Brian Randell

  • Extended virtual synchrony

    L.E. Moser;Y. Amir;P.M. Melliar-Smith;D.A. Agarwal

  • Broadcast protocols for distributed systems

    P.M. Melliar-Smith;L.E. Moser;V. Agrawala

  • MAgNET: mobile agents for networked electronic trading

    P. Dasgupta;N. Narasimhan;L.E. Moser;P.M. Melliar-Smith

  • The SecureRing protocols for securing group communication

    K.P. Kihlstrom;L.E. Moser;P.M. Melliar-Smith

  • Fault Tolerance Middleware for Cloud Computing

    Wenbing Zhao;P.M. Melliar-Smith;L.E. Moser

  • Fast message ordering and membership using a logical token-passing ring

    Y. Amir;L.E. Moser;P.M. Melliar-Smith;D.A. Agarwal

  • Consistent object replication in the eternal system

    L. E. Moser;P. M. Melliar-Smith;P. Narasimhan

  • A graphical interval logic for specifying concurrent systems

    L. K. Dillon;G. Kutty;L. E. Moser;P. M. Melliar-Smith

  • Byzantine Fault Detectors for Solving Consensus

    Kim Potter Kihlstrom;Louise E. Moser;P. M. Melliar-Smith

  • Byzantine clock synchronization

    Leslie Lamport;P. M. Melliar-Smith

  • An interval logic for higher-level temporal reasoning

    Unknown

  • Using Interceptors to Enhance CORBA

    Unknown

  • From State Machines to Temporal Logic: Specification Methods for Protocol Standards

    Unknown

  • Software reliability: The role of programmed exception handling

    Unknown

  • The Totem multiple-ring ordering and topology maintenance protocol

    D. A. Agarwal;L. E. Moser;P. M. Melliar-Smith;R. K. Budhia

  • A Distributed e-Healthcare System Based on the Service Oriented Architecture

    F. Kart;Gengxin Miao;L.E. Moser;P.M. Melliar-Smith

  • The Eternal system: an architecture for enterprise applications

    L.E. Moser;P.M. Melliar-Smith;P. Narasimhan;L.A. Tewksbury

  • Solving Consensus in a Byzantine Environment Using an Unreliable Fault Detector.

    Kim Potter Kihlstrom;Louise E. Moser;P. M. Melliar-Smith

  • A graphical environment for the design of concurrent real-time systems

    L. E. Moser;Y. S. Ramakrishna;G. Kutty;P. M. Melliar-Smith

  • Replica consistency of CORBA objects in partitionable distributed systems

    Priya Narasimhan;Louise E. Moser;P. M. Melliar-Smith

  • A fault tolerance framework for CORBA

    L.E. Moser;P.M. Melliar-Smith;P. Narasimhan

Frequent Co-Authors

Louise E. Moser
Louise E. Moser University of California, Santa Barbara
Wenbing Zhao
Wenbing Zhao Cleveland State University
Priya Narasimhan
Priya Narasimhan Carnegie Mellon 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

Choosing to study Computer Science in the USA opens the door to a variety of flexible, affordable online education options. If you’re interested in getting started without a long-term commitment, 2 year online degrees in computer science or related tech fields can provide a quick pathway into the workforce.

For those concerned about tuition and student debt, exploring the cheapest online college options can help you complete your degree without financial strain. Plenty of accredited online colleges offer rigorous computer science programs with flexible schedules.

Don’t worry if your academic history isn’t perfect—there are many college that accepts low gpa applicants, including for Online Computer Science programs. This creates opportunities for learners looking to restart or pivot their careers.

And if you’re considering fields beyond computer science, exploring what can you do with degrees like environmental science is helpful. Check out what can you do with an environmental studies degree for more insight into interdisciplinary career options.

Best Scientists Citing P. M. Melliar-Smith