Publications

Sean Ovens (2024). Determining Recoverable Consensus Numbers. Proceedings of the 2024 ACM Symposium on Principles of Distributed Computing (PODC 2024). Received the Best Paper Award.

Cite DOI URL

Sean Ovens (2023). The Space Complexity of Asynchronous Algorithms from Bounded Size Base Objects.

Cite DOI URL

Sean Ovens (2023). Brief Announcement: The Space Complexity of Set Agreement Using Swap. 37th International Symposium on Distributed Computing (DISC 2023).

Cite DOI URL

Sean Ovens (2023). The Space Complexity of Consensus from Swap. J. ACM.

Cite DOI URL

Sean Ovens (2022). The Space Complexity of Scannable Objects with Bounded Components. 36th International Symposium on Distributed Computing (DISC 2022).

Cite DOI URL

Sean Ovens (2022). The Space Complexity of Consensus from Swap. Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (PODC 2022). Received the Best Paper Award.

Cite DOI URL

Sean Ovens (2021). The Space Complexity of Scannable Binary Objects. Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (PODC 2021).

Cite DOI URL

Sean Ovens (2019). Strongly Linearizable Implementations of Fundamental Primitives.

Cite DOI URL

Sean Ovens, Philipp Woelfel (2019). Strongly Linearizable Implementations of Snapshots and Other Types. Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (PODC 2019).

Cite DOI URL