@inproceedings{8382,
  abstract     = {We present the first deterministic wait-free long-lived snapshot algorithm, using only read and write operations, that guarantees polylogarithmic amortized step complexity in all executions. This is the first non-blocking snapshot algorithm, using reads and writes only, that has sub-linear amortized step complexity in executions of arbitrary length. The key to our construction is a novel implementation of a 2-component max array object which may be of independent interest.},
  author       = {Baig, Mirza Ahad and Hendler, Danny and Milani, Alessia and Travers, Corentin},
  booktitle    = {Proceedings of the 39th Symposium on Principles of Distributed Computing},
  isbn         = {9781450375825},
  location     = {Virtual, Italy},
  pages        = {31--40},
  publisher    = {Association for Computing Machinery},
  title        = {{Long-lived snapshots with polylogarithmic amortized step complexity}},
  doi          = {10.1145/3382734.3406005},
  year         = {2020},
}

@inproceedings{8383,
  abstract     = {We introduce extension-based proofs, a class of impossibility proofs that includes valency arguments. They are modelled as an interaction between a prover and a protocol. Using proofs based on combinatorial topology, it has been shown that it is impossible to deterministically solve k-set agreement among n > k ≥ 2 processes in a wait-free manner. However, it was unknown whether proofs based on simpler techniques were possible. We explain why this impossibility result cannot be obtained by an extension-based proof and, hence, extension-based proofs are limited in power.},
  author       = {Alistarh, Dan-Adrian and Aspnes, James and Ellen, Faith and Gelashvili, Rati and Zhu, Leqi},
  booktitle    = {Proceedings of the 39th Symposium on Principles of Distributed Computing},
  isbn         = {9781450375825},
  location     = {Virtual, Italy},
  pages        = {54--56},
  publisher    = {Association for Computing Machinery},
  title        = {{Brief Announcement: Why Extension-Based Proofs Fail}},
  doi          = {10.1145/3382734.3405743},
  year         = {2020},
}