The SCEAS System
Navigation Menu

Search the dblp DataBase


Scott M. Pike: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Scott M. Pike, Paolo A. G. Sivilotti
    Dining Philosophers with Crash Locality 1. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2004, pp:22-29 [Conf]
  2. Nigamanth Sridhar, Scott M. Pike, Bruce W. Weide
    Dynamic Module Replacement in Distributed Protocols. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2003, pp:620-627 [Conf]
  3. Scott M. Pike, Nigamanth Sridhar
    Early-Reply Components: Concurrent Execution with Sequential Reasoning. [Citation Graph (0, 0)][DBLP]
    ICSR, 2002, pp:46-61 [Conf]
  4. Murali Sitaraman, Steven Atkinson, Gregory Kulczycki, Bruce W. Weide, Timothy J. Long, Paolo Bucci, Wayne D. Heym, Scott M. Pike, Joseph E. Hollingsworth
    Reasoning about Software-Component Behavior. [Citation Graph (0, 0)][DBLP]
    ICSR, 2000, pp:266-283 [Conf]
  5. Scott M. Pike, Bruce W. Weide, Joseph E. Hollingsworth
    Checkmate: cornering C++ dynamic memory errors with checked pointers. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2000, pp:352-356 [Conf]
  6. Paolo A. G. Sivilotti, Scott M. Pike
    The suitability of kinesthetic learning activities for teaching distributed algorithms. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2007, pp:362-366 [Conf]
  7. Yantao Song, Scott M. Pike
    Eventually k-Bounded Wait-Free Distributed Daemons. [Citation Graph (0, 0)][DBLP]
    DSN, 2007, pp:645-655 [Conf]
  8. Srikanth Sastry, Scott M. Pike
    Eventually Perfect Failure Detectors Using ADD Channels. [Citation Graph (0, 0)][DBLP]
    ISPA, 2007, pp:483-496 [Conf]
  9. Scott M. Pike, Yantao Song, Kaustav Ghoshal
    Brief Announcement: Wait-Free Dining for Eventual Weak Exclusion. [Citation Graph (0, 0)][DBLP]
    SSS, 2006, pp:578-579 [Conf]

  10. An Early-Reply Based Framework: Reliable Concurrency that Is Verifiable. [Citation Graph (, )][DBLP]

  11. Crash fault detection in celerating environments. [Citation Graph (, )][DBLP]

  12. Traditional assignment considered harmful. [Citation Graph (, )][DBLP]

  13. The weakest failure detector for wait-free dining under eventual weak exclusion. [Citation Graph (, )][DBLP]

  14. Corrigendum: weakest failure detector for wait-free dining under eventual weak exclusion. [Citation Graph (, )][DBLP]

  15. Crash-Quiescent Failure Detection. [Citation Graph (, )][DBLP]

  16. Brief Announcement: Failure Detectors Encapsulate Fairness. [Citation Graph (, )][DBLP]

  17. Wait-Free Dining Under Eventual Weak Exclusion. [Citation Graph (, )][DBLP]

Search in 0.079secs, Finished in 0.080secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002