@inproceedings{ce2d9b6c77de41ec8a6deab9aa164d7b,
title = "On helping and stacks",
abstract = "A concurrent algorithm exhibits helping when one process performs work on behalf of other processes. More formally, helping is observed when the order of some operation in a linearization is fixed by a step of another process. In this paper, we show that no wait-free linearizable implementation of a stack using read, write, compare\&swap and fetch\&add operations can be help-free, correcting a mistake in an earlier proof by Censor-Hillel et al.",
author = "Vitaly Aksenov and Petr Kuznetsov and Anatoly Shalyto",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2019.; 6th International Conference on Networked Systems, NETYS 2018 ; Conference date: 09-05-2018 Through 11-05-2018",
year = "2019",
month = jan,
day = "1",
doi = "10.1007/978-3-030-05529-5\_8",
language = "English",
isbn = "9783030055288",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "107--121",
editor = "Andreas Podelski and Fran{\c c}ois Ta{\"i}ani",
booktitle = "Networked Systems - 6th International Conference, NETYS 2018, Revised Selected Papers",
}