{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:21:43Z","timestamp":1743110503686,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031606021"},{"type":"electronic","value":"9783031606038"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-60603-8_18","type":"book-chapter","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T12:01:39Z","timestamp":1716379299000},"page":"318-335","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Wait-Free Linearizable Implementations of\u00a0Approximate Bounded Counters Using Read-Write Registers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7170-4521","authenticated-orcid":false,"given":"Colette","family":"Johnen","sequence":"first","affiliation":[]},{"given":"Adnane","family":"Khattabi","sequence":"additional","affiliation":[]},{"given":"Alessia","family":"Milani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7164-1436","authenticated-orcid":false,"given":"Jennifer L.","family":"Welch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,23]]},"reference":[{"issue":"6","key":"18_CR1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s00446-014-0229-0","volume":"27","author":"Y Afek","year":"2014","unstructured":"Afek, Y., Kaplan, H., Korenfeld, B., Morrison, A., Tarjan, R.E.: The CB tree: a practical concurrent self-adjusting search tree. Distrib. Comput. 27(6), 393\u2013417 (2014)","journal-title":"Distrib. Comput."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Attiya, H., Censor-Hillel, K.: Polylogarithmic concurrent data structures from monotone circuits. J. ACM 59(1), 2:1\u20132:24 (2012)","DOI":"10.1145\/2108242.2108244"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Censor, K.: Approximate shared-memory counting despite a strong adversary. ACM Trans. Algorithms 6(2), 25:1\u201325:23 (2010)","DOI":"10.1145\/1721837.1721841"},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1137\/130905022","volume":"45","author":"J Aspnes","year":"2016","unstructured":"Aspnes, J., Censor-Hillel, K., Attiya, H., Hendler, D.: Lower bounds for restricted-use objects. SIAM J. Comput. 45(3), 734\u2013762 (2016)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"18_CR5","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1109\/TPDS.2009.60","volume":"21","author":"H Attiya","year":"2010","unstructured":"Attiya, H., Hendler, D.: Time and space lower bounds for implementations using k-CAS. IEEE Trans. Parallel Distrib. Syst. 21(2), 162\u2013173 (2010)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s00446-022-00439-5","volume":"36","author":"MA Baig","year":"2023","unstructured":"Baig, M.A., Hendler, D., Milani, A., Travers, C.: Long-lived counters with polylogarithmic amortized step complexity. Distrib. Comput. 36(1), 29\u201343 (2023)","journal-title":"Distrib. Comput."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Gilbert, S.: Mutual exclusion with O(log$$^{2}$$ log n) amortized work. In: 52nd IEEE Annual Symposium on Foundations of Computer Science, pp. 728\u2013737 (2011)","DOI":"10.1109\/FOCS.2011.84"},{"issue":"1","key":"18_CR8","first-page":"113","volume":"25","author":"P Flajolet","year":"1985","unstructured":"Flajolet, P.: Approximate counting: a detailed analysis. BIT Comput. Sci. Sect. 25(1), 113\u2013134 (1985)","journal-title":"BIT Comput. Sci. Sect."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Hendler, D., Khattabi, A., Milani, A., Travers, C.: Upper and lower bounds for deterministic approximate objects. In: 41st IEEE International Conference on Distributed Computing Systems (ICDCS), pp. 438\u2013448 (2021)","DOI":"10.1109\/ICDCS51616.2021.00049"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. (TOPLAS) 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"MP Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. (TOPLAS) 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/BFb0020429","volume-title":"Distributed Algorithms","author":"M Inoue","year":"1994","unstructured":"Inoue, M., Masuzawa, T., Chen, W., Tokura, N.: Linear-time snapshot using multi-writer multi-reader registers. In: Tel, G., Vit\u00e1nyi, P. (eds.) WDAG 1994. LNCS, vol. 857, pp. 130\u2013140. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0020429"},{"issue":"2","key":"18_CR13","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1137\/S0097539797317299","volume":"30","author":"P Jayanti","year":"2000","unstructured":"Jayanti, P., Tan, K., Toueg, S.: Time and space lower bounds for nonblocking implementations. SIAM J. Comput. 30(2), 438\u2013456 (2000)","journal-title":"SIAM J. Comput."},{"key":"18_CR14","unstructured":"Johnen, C., Khattabi, A., Milani, A., Welch, J.L.: Efficient wait-free linearizable implementations of approximate bounded counters using read-write registers (2024). arXiv:2402.14120"},{"key":"18_CR15","unstructured":"Khattabi\u00a0Riffi, A.: On improving complexity of linearizable and wait-free implementations of concurrent objects by relaxing their specifications. Theses, Universit\u00e9 de Bordeaux, March 2023. https:\/\/theses.hal.science\/tel-04147099"},{"issue":"10","key":"18_CR16","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1145\/359619.359627","volume":"21","author":"RH Morris","year":"1978","unstructured":"Morris, R.H.: Counting large numbers of events in small registers. Commun. ACM 21(10), 840\u2013842 (1978)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60603-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T12:05:24Z","timestamp":1716379524000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60603-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031606021","9783031606038"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60603-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"23 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietri sul Mare","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sirocco2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}