Wojciech Golab
From MaRDI portal
Person:660998
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!
| Publication | Date of Publication | Type |
|---|---|---|
| Brief Announcement: Detectable Sequential Specifications for Recoverable Shared Objects Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Brief Announcement: Towards a Theory of Wear Leveling in Persistent Data Structures Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| scientific article; zbMATH DE number 7774280 (Why is no real title available?) | 2023-12-08 | Paper |
| The Recoverable Consensus Hierarchy Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| Recoverable mutual exclusion Distributed Computing | 2019-11-27 | Paper |
| Recoverable mutual exclusion under system-wide failures Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| Analyzing linearizability violations in the presence of read-modify-write operations Information Processing Letters | 2018-07-17 | Paper |
| Computing k-atomicity in polynomial time SIAM Journal on Computing | 2018-04-24 | Paper |
| Recoverable mutual exclusion in sub-logarithmic time Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
| Brief Announcement Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
| Robust shared objects for non-volatile main memory | 2017-09-29 | Paper |
| Recoverable mutual exclusion (extended abstract) Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| Computing weak consistency in polynomial time (extended abstract) Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
| A complexity separation between the cache-coherent and distributed shared memory models Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
| A complexity separation between the cache-coherent and distributed shared memory models Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
| Analyzing consistency properties for fun and profit Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
| Making objects writable Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
| An \(O(1)\) RMRs leader election algorithm Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
| Linearizable implementations do not suffice for randomized distributed computation Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
| Constant-RMR implementations of CAS and other synchronization primitives using read and write operations Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
| RMR-efficient implementations of comparison primitives using read and write operations Distributed Computing | 2013-02-04 | Paper |
| Closing the complexity gap between FCFS mutual exclusion and mutual exclusion Distributed Computing | 2012-02-06 | Paper |
| An \(O(1)\) RMRs leader election algorithm SIAM Journal on Computing | 2011-04-04 | Paper |
| Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion Lecture Notes in Computer Science | 2008-11-20 | Paper |
Research outcomes over time
This page was built for person: Wojciech Golab
