{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:38Z","timestamp":1763468258717,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,7,21]],"date-time":"2015-07-21T00:00:00Z","timestamp":1437436800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,7,21]]},"DOI":"10.1145\/2767386.2767430","type":"proceedings-article","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T13:28:49Z","timestamp":1437139729000},"page":"251-260","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Lock-Free Algorithms under Stochastic Schedulers"],"prefix":"10.1145","author":[{"given":"Dan","family":"Alistarh","sequence":"first","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Sauerwald","sequence":"additional","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milan","family":"Vojnovi\u0107","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,7,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591836"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(02)00220-1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538908"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288490"},{"key":"e_1_3_2_1_6_1","volume-title":"Monte Carlo Simulation, and Queues (Text in Applied Mathematics)","author":"Bremaud Pierre","year":"2001","unstructured":"Pierre Bremaud . Markov Chains: Gibbs Fields , Monte Carlo Simulation, and Queues (Text in Applied Mathematics) . Springer , 2 nd edition, 2001 . Pierre Bremaud. Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues (Text in Applied Mathematics). Springer, 2nd edition, 2001.","edition":"2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301315"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612703"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611486"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1233307.1233309"},{"key":"e_1_3_2_1_11_1","first-page":"511","volume-title":"Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms, SODA'08","author":"Godfrey Brighten","year":"2008","unstructured":"Brighten Godfrey . Balls and bins with structure: balanced allocations on hypergraphs . In Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms, SODA'08 , pages 511 -- 517 , 2008 . Brighten Godfrey. Balls and bins with structure: balanced allocations on hypergraphs. In Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms, SODA'08, pages 511--517, 2008."},{"key":"e_1_3_2_1_12_1","first-page":"602","volume-title":"Proceedings of the 13th International Conference on Approximation, and 14th International Conference on Randomization, and Combinatorial Optimization: Algorithms and Techniques, APPROX\/RANDOM'10","author":"Thomas","year":"2010","unstructured":"Thomas P. Hayes and Alistair Sinclair. Liftings of tree-structured markov chains . In Proceedings of the 13th International Conference on Approximation, and 14th International Conference on Randomization, and Combinatorial Optimization: Algorithms and Techniques, APPROX\/RANDOM'10 , pages 602 -- 616 , 2010 . Thomas P. Hayes and Alistair Sinclair. Liftings of tree-structured markov chains. In Proceedings of the 13th International Conference on Approximation, and 14th International Conference on Randomization, and Combinatorial Optimization: Algorithms and Techniques, APPROX\/RANDOM'10, pages 602--616, 2010."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_14_1","first-page":"522","volume-title":"Proceedings of the 23rd International Conference on Distributed Computing Systems, ICDCS'03","author":"Herlihy Maurice","year":"2003","unstructured":"Maurice Herlihy , Victor Luchangco , and Mark Moir . Obstruction-free synchronization : Double-ended queues as an example . In Proceedings of the 23rd International Conference on Distributed Computing Systems, ICDCS'03 , pages 522 -- 529 , 2003 . Maurice Herlihy, Victor Luchangco, and Mark Moir. Obstruction-free synchronization: Double-ended queues as an example. In Proceedings of the 23rd International Conference on Distributed Computing Systems, ICDCS'03, pages 522--529, 2003."},{"key":"e_1_3_2_1_15_1","volume-title":"Morgan Kaufmann","author":"Herlihy Maurice","year":"2008","unstructured":"Maurice Herlihy and Nir Shavit . The art of multiprocessor programming . Morgan Kaufmann , 2008 . Maurice Herlihy and Nir Shavit. The art of multiprocessor programming. Morgan Kaufmann, 2008."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25873-2_22"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508834.2513149"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248106"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1076315"},{"issue":"4","key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1080\/00031305.1992.10475901","article-title":"A birthday problem solution for nonuniform birth frequencies","volume":"46","author":"Nunnikhoven Thomas S.","year":"1992","unstructured":"Thomas S. Nunnikhoven . A birthday problem solution for nonuniform birth frequencies . The American Statistician , 46 ( 4 ): 270 -- 274 , 1992 . Thomas S. Nunnikhoven. A birthday problem solution for nonuniform birth frequencies. The American Statistician, 46(4):270--274, 1992.","journal-title":"The American Statistician"},{"key":"e_1_3_2_1_21_1","volume-title":"Database Management Systems","author":"Ramakrishnan Raghu","year":"2003","unstructured":"Raghu Ramakrishnan and Johannes Gehrke . Database Management Systems . McGraw-Hill, Inc. , New York, NY, USA , 3 rd edition, 2003 . Raghu Ramakrishnan and Johannes Gehrke. Database Management Systems. McGraw-Hill, Inc., New York, NY, USA, 3rd edition, 2003.","edition":"3"},{"key":"e_1_3_2_1_22_1","volume-title":"Synthesis Lectures on Computer Architecture","author":"Scott Michael L.","year":"2013","unstructured":"Michael L. Scott . Shared-Memory Synchronization . Synthesis Lectures on Computer Architecture . Morgan & Claypool Publishers , 2013 . Michael L. Scott. Shared-Memory Synchronization. Synthesis Lectures on Computer Architecture. Morgan & Claypool Publishers, 2013."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250829"}],"event":{"name":"PODC '15: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Donostia-San Sebasti\u00e1n Spain","acronym":"PODC '15"},"container-title":["Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2767386.2767430","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2767386.2767430","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:06Z","timestamp":1750223226000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2767386.2767430"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,21]]},"references-count":22,"alternative-id":["10.1145\/2767386.2767430","10.1145\/2767386"],"URL":"https:\/\/doi.org\/10.1145\/2767386.2767430","relation":{},"subject":[],"published":{"date-parts":[[2015,7,21]]},"assertion":[{"value":"2015-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}