Published in: LIPIcs, Volume 246, 36th International Symposium on Distributed Computing (DISC 2022)
Naama Ben-David, Michal Friedman, and Yuanhao Wei. Brief Announcement: Survey of Persistent Memory Correctness Conditions. In 36th International Symposium on Distributed Computing (DISC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 246, pp. 41:1-41:4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{bendavid_et_al:LIPIcs.DISC.2022.41, author = {Ben-David, Naama and Friedman, Michal and Wei, Yuanhao}, title = {{Brief Announcement: Survey of Persistent Memory Correctness Conditions}}, booktitle = {36th International Symposium on Distributed Computing (DISC 2022)}, pages = {41:1--41:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-255-6}, ISSN = {1868-8969}, year = {2022}, volume = {246}, editor = {Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.41}, URN = {urn:nbn:de:0030-drops-172328}, doi = {10.4230/LIPIcs.DISC.2022.41}, annote = {Keywords: Persistence, NVRAM, Correctness, Concurrency} }
Published in: LIPIcs, Volume 209, 35th International Symposium on Distributed Computing (DISC 2021)
Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, and Yuanhao Wei. Space and Time Bounded Multiversion Garbage Collection. In 35th International Symposium on Distributed Computing (DISC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 209, pp. 12:1-12:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{bendavid_et_al:LIPIcs.DISC.2021.12, author = {Ben-David, Naama and Blelloch, Guy E. and Fatourou, Panagiota and Ruppert, Eric and Sun, Yihan and Wei, Yuanhao}, title = {{Space and Time Bounded Multiversion Garbage Collection}}, booktitle = {35th International Symposium on Distributed Computing (DISC 2021)}, pages = {12:1--12:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-210-5}, ISSN = {1868-8969}, year = {2021}, volume = {209}, editor = {Gilbert, Seth}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.12}, URN = {urn:nbn:de:0030-drops-148143}, doi = {10.4230/LIPIcs.DISC.2021.12}, annote = {Keywords: Lock-free, data structures, memory management, snapshot, version lists} }
Published in: LIPIcs, Volume 179, 34th International Symposium on Distributed Computing (DISC 2020)
Guy E. Blelloch and Yuanhao Wei. LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 5:1-5:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{blelloch_et_al:LIPIcs.DISC.2020.5, author = {Blelloch, Guy E. and Wei, Yuanhao}, title = {{LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {5:1--5:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.5}, URN = {urn:nbn:de:0030-drops-130831}, doi = {10.4230/LIPIcs.DISC.2020.5}, annote = {Keywords: LL/SC, Atomic Copy, CAS, Constant Time} }
Published in: LIPIcs, Volume 179, 34th International Symposium on Distributed Computing (DISC 2020)
Guy E. Blelloch and Yuanhao Wei. Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant Time. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 51:1-51:3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{blelloch_et_al:LIPIcs.DISC.2020.51, author = {Blelloch, Guy E. and Wei, Yuanhao}, title = {{Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant Time}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {51:1--51:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.51}, URN = {urn:nbn:de:0030-drops-131291}, doi = {10.4230/LIPIcs.DISC.2020.51}, annote = {Keywords: malloc, free, fixed-size, concurrent, constant time} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Ian Mertz, Toniann Pitassi, and Yuanhao Wei. Short Proofs Are Hard to Find. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 84:1-84:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{mertz_et_al:LIPIcs.ICALP.2019.84, author = {Mertz, Ian and Pitassi, Toniann and Wei, Yuanhao}, title = {{Short Proofs Are Hard to Find}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {84:1--84:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-109-2}, ISSN = {1868-8969}, year = {2019}, volume = {132}, editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.84}, URN = {urn:nbn:de:0030-drops-106605}, doi = {10.4230/LIPIcs.ICALP.2019.84}, annote = {Keywords: automatizability, Resolution, SAT solvers, proof complexity} }
Published in: LIPIcs, Volume 70, 20th International Conference on Principles of Distributed Systems (OPODIS 2016)
Tian Ze Chen and Yuanhao Wei. Step Optimal Implementations of Large Single-Writer Registers. In 20th International Conference on Principles of Distributed Systems (OPODIS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 70, pp. 32:1-32:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{chen_et_al:LIPIcs.OPODIS.2016.32, author = {Chen, Tian Ze and Wei, Yuanhao}, title = {{Step Optimal Implementations of Large Single-Writer Registers}}, booktitle = {20th International Conference on Principles of Distributed Systems (OPODIS 2016)}, pages = {32:1--32:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-031-6}, ISSN = {1868-8969}, year = {2017}, volume = {70}, editor = {Fatourou, Panagiota and Jim\'{e}nez, Ernesto and Pedone, Fernando}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2016.32}, URN = {urn:nbn:de:0030-drops-71010}, doi = {10.4230/LIPIcs.OPODIS.2016.32}, annote = {Keywords: atomic register, regular register, wait-free implementation, single writer, optimal} }
Feedback for Dagstuhl Publishing