{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:51:54Z","timestamp":1742914314008,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":14,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_338","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:29:45Z","timestamp":1214504985000},"page":"761-764","source":"Crossref","is-referenced-by-count":1,"title":["Registers"],"prefix":"10.1007","author":[{"given":"Paul","family":"Vit\u00e1nyi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"12","key":"338_CR1_338","doi-asserted-by":"publisher","first-page":"1506","DOI":"10.1109\/12.9729","volume":"37","author":"B. Bloom","year":"1988","unstructured":"Bloom, B.: Constructing two-writer atomic registers. IEEE Trans. Comput. 37(12), 1506\u20131514 (1988)","journal-title":"IEEE Trans. Comput."},{"key":"338_CR2_338","doi-asserted-by":"crossref","unstructured":"Burns, J.E., Peterson, G.L.: Constructing multi-reader atomic values from non-atomic values. In: Proc. 6th ACM Symp. Principles Distr. Comput., pp.\u00a0222\u2013231. Vancouver, 10\u201312\u00a0August 1987","DOI":"10.1145\/41840.41859"},{"issue":"2","key":"338_CR3_338","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/S0097539790192647","volume":"26","author":"D. Dolev","year":"1997","unstructured":"Dolev, D., Shavit, N.: Bounded concurrent time-stamp systems are constructible. SIAM J.\u00a0Comput. 26(2), 418\u2013455 (1997)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"338_CR4_338","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/505241.505246","volume":"49","author":"S. Haldar","year":"2002","unstructured":"Haldar, S., Vitanyi, P.: Bounded concurrent timestamp systems using vector clocks. J.\u00a0Assoc. Comp. Mach. 49(1), 101\u2013126 (2002)","journal-title":"J. Assoc. Comp. Mach."},{"issue":"4","key":"338_CR5_338","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF02242708","volume":"6","author":"A. Israeli","year":"1993","unstructured":"Israeli, A., Li, M.: Bounded time-stamps. Distribut. Comput. 6, 205\u2013209 (1993) (Preliminary, more extended, version in: Proc. 28th IEEE Symp. Found. Comput. Sci., pp.\u00a0371\u2013382, 1987.)","journal-title":"Distrib. Comput."},{"key":"338_CR6_338","doi-asserted-by":"crossref","unstructured":"Israeli, A., Shaham, A.: Optimal multi-writer multireader atomic register. In: Proc. 11th ACM Symp. Principles Distr. Comput., pp.\u00a071\u201382. Vancouver, British Columbia, Canada, 10\u201312\u00a0August 1992","DOI":"10.1145\/135419.135435"},{"key":"338_CR7_338","doi-asserted-by":"crossref","unstructured":"Kirousis, L.M., Kranakis, E., Vit\u00e1nyi, P.M.B.: Atomic multireader register. In: Proc. Workshop Distributed Algorithms. Lect Notes Comput Sci, vol\u00a0312, pp.\u00a0278\u2013296. Springer, Berlin (1987)","DOI":"10.1007\/BFb0019809"},{"issue":"2","key":"338_CR8_338","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication\u2014Part\u00a0I: Basic formalism, Part\u00a0II: Algorithms. Distrib. Comput. 1(2), 77\u2013101 (1986)","journal-title":"Distrib. Comput."},{"issue":"4","key":"338_CR9_338","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/234533.234556","volume":"43","author":"M. Li","year":"1996","unstructured":"Li, M., Tromp, J., Vit\u00e1nyi, P.M.B.: How to share concurrent wait-free variables. J.\u00a0ACM 43(4), 723\u2013746 (1996) (Preliminary version: Li, M., Vit\u00e1nyi, P.M.B. A\u00a0very simple construction for atomic multiwriter register. Tech. Rept. TR-01\u201387, Computer Science Dept., Harvard University, Nov. 1987)","journal-title":"J. ACM"},{"issue":"1","key":"338_CR10_338","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/357195.357199","volume":"5","author":"G.L. Peterson","year":"1983","unstructured":"Peterson, G.L.: Concurrent reading while writing. ACM Trans. Program. Lang. Syst. 5(1), 56\u201365 (1983)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"338_CR11_338","doi-asserted-by":"crossref","unstructured":"Peterson, G.L., Burns, J.E.: Concurrent reading while writing II: The multiwriter case. In: Proc. 28th IEEE Symp. Found. Comput. Sci., pp.\u00a0383\u2013392. Los Angeles, 27\u201329\u00a0October 1987","DOI":"10.1109\/SFCS.1987.15"},{"issue":"2","key":"338_CR12_338","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1145\/174652.174657","volume":"41","author":"A.K. Singh","year":"1994","unstructured":"Singh, A.K., Anderson, J.H., Gouda, M.G.: The elusive atomic register. J.\u00a0ACM 41(2), 311\u2013339 (1994) (Preliminary version in: Proc. 6th ACM Symp. Principles Distribt. Comput., 1987)","journal-title":"J. ACM"},{"key":"338_CR13_338","first-page":"292","volume-title":"Proc. Workshop Distrib. Algorithms. Lecture Notes in Computer Science, vol. 392","author":"J. Tromp","year":"1989","unstructured":"Tromp, J.: How to construct an atomic variable. In: Proc. Workshop Distrib. Algorithms. Lecture Notes in Computer Science, vol.\u00a0392, pp.\u00a0292\u2013302. Springer, Berlin (1989)"},{"key":"338_CR14_338","doi-asserted-by":"crossref","unstructured":"Vit\u00e1nyi, P.M.B., Awerbuch, B.: Atomic shared register access by asynchronous hardware. In: Proc. 27th IEEE Symp. Found. Comput. Sci. pp.\u00a0233\u2013243. Los Angeles, 27\u201329\u00a0October 1987. Errata, Proc. 28th IEEE Symp. Found. Comput. Sci., pp.\u00a0487\u2013487. Los Angeles, 27\u201329\u00a0October 1987","DOI":"10.1109\/SFCS.1987.23"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:31:57Z","timestamp":1738272717000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_338"}},"subtitle":["1986; Lamport, Vitanyi, Awerbuch"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_338","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}