Addendum to "On the Time and Space Complexity of Randomized Test-And-Set":
In the conference paper "On the Time and Space Complexity of Randomizes Test-And-Set" by Giakkoupis and Woelfel, published in 31st PODC, pp. 19-28, 2012, we prove (among several other results) that any randomized implementation of a nondeterministic solo-terminating Test-And-Set object from atomic read/write registers requires at least Ω(log n) registers, in a system with n processes. After the paper was published, we became aware that a proof which implies this result appears in the paper by Styer and Peterson, "Tight Bounds for Shared Memory Symmetric Mutual Exclusion Problems", 8th PODC, pp. 177-192, 1989. (Thanks to Dan Alistarh for pointing this out to us.)