{"date_created":"2018-12-11T11:48:21Z","date_updated":"2023-02-23T13:12:01Z","language":[{"iso":"eng"}],"author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian"},{"full_name":"Aspnes, James","last_name":"Aspnes","first_name":"James"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Sub-logarithmic test-and-set against a weak adversary","day":"01","year":"2011","_id":"760","page":"97 - 109","alternative_title":["LNCS"],"doi":"10.1007/978-3-642-24100-0_7","publication_status":"published","type":"conference","publist_id":"6896","month":"01","citation":{"ista":"Alistarh D-A, Aspnes J. 2011. Sub-logarithmic test-and-set against a weak adversary. DISC: Distributed Computing, LNCS, vol. 6950 LNCS, 97–109.","mla":"Alistarh, Dan-Adrian, and James Aspnes. <i>Sub-Logarithmic Test-and-Set against a Weak Adversary</i>. Vol. 6950 LNCS, Springer, 2011, pp. 97–109, doi:<a href=\"https://doi.org/10.1007/978-3-642-24100-0_7\">10.1007/978-3-642-24100-0_7</a>.","ama":"Alistarh D-A, Aspnes J. Sub-logarithmic test-and-set against a weak adversary. In: Vol 6950 LNCS. Springer; 2011:97-109. doi:<a href=\"https://doi.org/10.1007/978-3-642-24100-0_7\">10.1007/978-3-642-24100-0_7</a>","chicago":"Alistarh, Dan-Adrian, and James Aspnes. “Sub-Logarithmic Test-and-Set against a Weak Adversary,” 6950 LNCS:97–109. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24100-0_7\">https://doi.org/10.1007/978-3-642-24100-0_7</a>.","apa":"Alistarh, D.-A., &#38; Aspnes, J. (2011). Sub-logarithmic test-and-set against a weak adversary (Vol. 6950 LNCS, pp. 97–109). Presented at the DISC: Distributed Computing, Springer. <a href=\"https://doi.org/10.1007/978-3-642-24100-0_7\">https://doi.org/10.1007/978-3-642-24100-0_7</a>","short":"D.-A. Alistarh, J. Aspnes, in:, Springer, 2011, pp. 97–109.","ieee":"D.-A. Alistarh and J. Aspnes, “Sub-logarithmic test-and-set against a weak adversary,” presented at the DISC: Distributed Computing, 2011, vol. 6950 LNCS, pp. 97–109."},"publisher":"Springer","extern":"1","volume":"6950 LNCS","acknowledgement":"The work of Dan Alistarh was supported by the NCCR MICS Project. The work of James Aspnes was supported in part by NSF grant CCF-0916389.","conference":{"name":"DISC: Distributed Computing"},"date_published":"2011-01-01T00:00:00Z","oa_version":"None","status":"public","abstract":[{"text":"A randomized implementation is given of a test-and-set register with O(log log n) individual step complexity and O(n) total step complexity against an oblivious adversary. The implementation is linearizable and multi-shot, and shows an exponential complexity improvement over previous solutions designed to work against a strong adversary.","lang":"eng"}]}