default search action
Scott M. Pike
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [j2]Scott M. Pike, Srikanth Sastry, Jennifer L. Welch:
Failure detectors encapsulate fairness. Distributed Comput. 25(4): 313-333 (2012) - 2010
- [c19]Scott M. Pike, Srikanth Sastry, Jennifer L. Welch:
Failure Detectors Encapsulate Fairness. OPODIS 2010: 173-188 - [c18]Srikanth Sastry, Scott M. Pike, Jennifer L. Welch:
Corrigendum: weakest failure detector for wait-free dining under eventual weak exclusion. SPAA 2010: 365 - [c17]Scott M. Pike, Srikanth Sastry, Jennifer L. Welch:
Brief Announcement: Failure Detectors Encapsulate Fairness. DISC 2010: 389-391
2000 – 2009
- 2009
- [c16]Srikanth Sastry, Scott M. Pike, Jennifer L. Welch:
Crash fault detection in celerating environments. IPDPS 2009: 1-12 - [c15]Scott M. Pike, Wayne D. Heym, Bruce M. Adcock, Derek Bronish, Jason Kirschenbaum, Bruce W. Weide:
Traditional assignment considered harmful. OOPSLA Companion 2009: 909-916 - [c14]Srikanth Sastry, Scott M. Pike, Jennifer L. Welch:
The weakest failure detector for wait-free dining under eventual weak exclusion. SPAA 2009: 111-120 - [c13]Srikanth Sastry, Scott M. Pike, Jennifer L. Welch:
Crash-Quiescent Failure Detection. DISC 2009: 326-340 - 2008
- [c12]Scott M. Pike, Yantao Song, Srikanth Sastry
:
Wait-Free Dining Under Eventual Weak Exclusion. ICDCN 2008: 135-146 - 2007
- [j1]Paolo A. G. Sivilotti, Scott M. Pike:
A collection of kinesthetic learning activities for a course on distributed computing: ACM SIGACT news distributed computing column 26. SIGACT News 38(2): 56-74 (2007) - [c11]Yantao Song, Scott M. Pike:
Eventually k-Bounded Wait-Free Distributed Daemons. DSN 2007: 645-655 - [c10]Stephen W. Cook, Bjarne Stroustrup, Scott M. Pike:
An Early-Reply Based Framework: Reliable Concurrency that Is Verifiable. HASE 2007: 405-406 - [c9]Srikanth Sastry, Scott M. Pike:
Eventually Perfect Failure Detectors Using ADD Channels. ISPA 2007: 483-496 - [c8]Paolo A. G. Sivilotti, Scott M. Pike:
The suitability of kinesthetic learning activities for teaching distributed algorithms. SIGCSE 2007: 362-366 - 2006
- [c7]Scott M. Pike, Yantao Song, Kaustav Ghoshal:
Brief Announcement: Wait-Free Dining for Eventual Weak Exclusion. SSS 2006: 578-579 - 2004
- [c6]Scott M. Pike, Paolo A. G. Sivilotti:
Dining Philosophers with Crash Locality 1. ICDCS 2004: 22-29 - 2003
- [c5]Nigamanth Sridhar, Scott M. Pike, Bruce W. Weide:
Dynamic Module Replacement in Distributed Protocols. ICDCS 2003: 620-627 - 2002
- [c4]Scott M. Pike, Nigamanth Sridhar:
Early-Reply Components: Concurrent Execution with Sequential Reasoning. ICSR 2002: 46-61 - [c3]Scott M. Pike:
Encapsulating concurrency with Early-Reply. OOPSLA Companion 2002: 18-19 - 2000
- [c2]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. ICSR 2000: 266-283 - [c1]Scott M. Pike, Bruce W. Weide, Joseph E. Hollingsworth:
Checkmate: cornering C++ dynamic memory errors with checked pointers. SIGCSE 2000: 352-356
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-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: