Mark Moir

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Fast, long-lived renaming improved and simplified2024-07-11Paper
Universal constructions for large objects
Distributed Algorithms
2023-12-01Paper
Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions
Distributed Computing
2020-12-03Paper
Lock-free reference counting
Distributed Computing
2020-12-03Paper
Using local-spin \(k\)-exclusion algorithms to improve wait-free object implementations
Distributed Computing
2020-12-02Paper
scientific article; zbMATH DE number 6876104 (Why is no real title available?)2018-05-29Paper
Practical implementations of non-blocking synchronization primitives
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97
2017-09-29Paper
Universal constructions for multi-object operations
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95
2017-09-29Paper
Long-lived renaming made fast
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95
2017-09-29Paper
Using k-exclusion to implement resilient, scalable shared objects (extended abstract)
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94
2017-09-29Paper
A simple local-spin group mutual exclusion algorithm
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
2015-09-11Paper
Wait-free synchronization in multiprogrammed systems
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
2015-09-11Paper
Real-time object sharing with minimal system support
Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96
2015-09-11Paper
Towards formally specifying and verifying transactional memory
Formal Aspects of Computing
2014-11-11Paper
SNZI, scalable nonzero indicators
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
2014-03-13Paper
Space- and time-adaptive nonblocking algorithms2013-08-27Paper
A dynamic-sized nonblocking work stealing deque
Distributed Computing
2013-06-07Paper
A framework for formally verifying software transactional memory algorithms
Lecture Notes in Computer Science
2012-09-25Paper
On the uncontended complexity of consensus
Lecture Notes in Computer Science
2010-02-23Paper
Nonblocking Algorithms and Backward Simulation
Lecture Notes in Computer Science
2009-11-19Paper
Nonblocking \(k\)-compare-single-swap
Theory of Computing Systems
2009-08-06Paper
Distributed Computing
Lecture Notes in Computer Science
2006-11-01Paper
Formal Techniques for Networked and Distributed Systems – FORTE 2004
Lecture Notes in Computer Science
2005-08-18Paper
scientific article; zbMATH DE number 2013841 (Why is no real title available?)2003-12-07Paper
A simple proof technique for priority-scheduled systems
Information Processing Letters
2002-07-25Paper
Wait-free algorithms for fast, long-lived renaming
Science of Computer Programming
1995-12-20Paper


Research outcomes over time


This page was built for person: Mark Moir