{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:26:28Z","timestamp":1759335988000,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540561880"},{"type":"electronic","value":"9783540474845"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56188-9_7","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:56:35Z","timestamp":1330253795000},"page":"95-109","source":"Crossref","is-referenced-by-count":11,"title":["A concurrent time-stamp scheme which is linear in time and space"],"prefix":"10.1007","author":[{"given":"Amos","family":"Israeli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meir","family":"Pinhasov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Afek Y., Attiya H., Dolev D., Gafni E., Merritt M., Shavit N.: Atomic snapshots of shared memory. Proc. 9th ACM Symp. on Principles of Distributed Computation (1990) pp. 1\u201313.","DOI":"10.21236\/ADA222765"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Chor B., Israeli A., Li M.: On processor coordination using asynchronous hardware. Proc. 6th ACM Symp. on Principles of Distributed Computation (1987) pp. 86\u201397.","DOI":"10.1145\/41840.41848"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Dolev D., Shavit N.: Bounded concurrent time-stamp systems are constructible! Proc. 21st Annual ACM Symp. on Theory of Computing (1989) pp. 454\u2013466.","DOI":"10.21236\/ADA213853"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Dwork C, Waarts O.: Simple efficient bounded concurrent timestamping or Bounded concurrent timestamp systems are comprehensible! Proc. 24th Annual ACM Symp. on Theory of Computing (1992) pp. 655\u2013666.","DOI":"10.1145\/129712.129776"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Dwork C., Herlihy M., Plotkin S.A., Waarts O.: Time-lapse snapshots. Proc. of the Israeli Symposium on the Theory of Computing and Systems (1992) pp. 154\u2013170.","DOI":"10.1007\/BFb0035175"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Herlihy M.P.: Waitfree implementations of concurrent objects. Proc. 7th ACM Symp. on Principles of Distributed Computation (1988) pp. 276\u2013290.","DOI":"10.1145\/62546.62593"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Israeli A., Li M.: Bounded time-stamps. Proceedings of the 28th Annual Symposium on Foundations of Computer Science (1987) pp. 371\u2013382.","DOI":"10.1109\/SFCS.1987.10"},{"issue":"8","key":"7_CR8","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L. Lamport","year":"1974","unstructured":"Lamport L.: A new solution of Dijkstra's concurrent programming problem. CACM 17, 8 (1974) pp.453\u2013455.","journal-title":"CACM"},{"issue":"2","key":"7_CR9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/5383.5384","volume":"33","author":"L. Lamport","year":"1986","unstructured":"Lamport L.: The mutual exclusion problem. J. ACM 33, 2 (1986) pp.313\u2013348.","journal-title":"J. ACM"},{"issue":"2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport L.: On interprocess communication. Distributed Computing 1, 2 (1986) pp. 77\u2013101.","journal-title":"Distributed Computing"},{"key":"7_CR11","unstructured":"Li M., Tromp J., Vitanyi P.M.B.: How to share concurrent wait-free variables, preprint."},{"key":"7_CR12","volume-title":"M.Sc. thesis","author":"M. Pinhasov","year":"1991","unstructured":"Pinhasov M.: A Linear-time bounded concurrent time-stamp scheme. M.Sc. thesis, Dept. of Computer Science, Technion, Haifa, Israel, (1991). (in Hebrew)"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Singh A.K., Anderson J.H., Gouda M.G.: The elusive atomic register revisited. Proc. 6th ACM Symp. on Principles of Distributed Computation (1987) pp. 206\u2013221.","DOI":"10.1145\/41840.41858"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Vitanyi P., Awerbuch B.: Atomic shared register access by asynchronous hardware. Proceedings of the 27th Annual Symposium on Foundations of Computer Science (1986) pp.233\u2013243.","DOI":"10.1109\/SFCS.1986.11"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56188-9_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:46:07Z","timestamp":1742593567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56188-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540561880","9783540474845"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-56188-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}