Scott M. Pike

According to our database1, Scott M. Pike authored at least 20 papers between 2000 and 2012.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2012
Failure detectors encapsulate fairness.
Distributed Comput., 2012

2010
Brief Announcement: Failure Detectors Encapsulate Fairness.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Corrigendum: weakest failure detector for wait-free dining under eventual weak exclusion.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

2009
Crash-Quiescent Failure Detection.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

The weakest failure detector for wait-free dining under eventual weak exclusion.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Traditional assignment considered harmful.
Proceedings of the Companion to the 24th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2009

Crash fault detection in celerating environments.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008
Wait-Free Dining Under Eventual Weak Exclusion.
Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

2007
A collection of kinesthetic learning activities for a course on distributed computing: ACM SIGACT news distributed computing column 26.
SIGACT News, 2007

The suitability of kinesthetic learning activities for teaching distributed algorithms.
Proceedings of the 38th SIGCSE Technical Symposium on Computer Science Education, 2007

Eventually Perfect Failure Detectors Using ADD Channels.
Proceedings of the Parallel and Distributed Processing and Applications, 2007

An Early-Reply Based Framework: Reliable Concurrency that Is Verifiable.
Proceedings of the Tenth IEEE International Symposium on High Assurance Systems Engineering (HASE 2007), 2007

Eventually k-Bounded Wait-Free Distributed Daemons.
Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2007

2006
Brief Announcement: Wait-Free Dining for Eventual Weak Exclusion.
Proceedings of the Stabilization, 2006

2004
Dining Philosophers with Crash Locality 1.
Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS 2004), 2004

2003
Dynamic Module Replacement in Distributed Protocols.
Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

2002
Encapsulating concurrency with Early-Reply.
Proceedings of the Companion of the 17th annual ACM SIGPLAN conference on Object-oriented programming, 2002

Early-Reply Components: Concurrent Execution with Sequential Reasoning.
Proceedings of the Software Reuse: Methods, 2002

2000
Checkmate: cornering C++ dynamic memory errors with checked pointers.
Proceedings of the 31st SIGCSE Technical Symposium on Computer Science Education, 2000

Reasoning about Software-Component Behavior.
Proceedings of the Software Reuse: Advances in Software Reusability, 2000


  Loading...