{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T17:06:26Z","timestamp":1756573586133},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001423"},{"type":"electronic","value":"9783540361367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36136-7_48","type":"book-chapter","created":{"date-parts":[[2008,11,25]],"date-time":"2008-11-25T14:07:11Z","timestamp":1227622031000},"page":"550-562","source":"Crossref","is-referenced-by-count":3,"title":["A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm"],"prefix":"10.1007","author":[{"given":"Vivek","family":"Shikaripura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajay D.","family":"Kshemkalyani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"K. Abrahamson, On achieving consensus using a shared memory, Proc. 7th ACM Symposium on Principles of Distributed Computing, 291\u2013302, 1988.","DOI":"10.1145\/62546.62594"},{"key":"48_CR2","volume-title":"Distributed computing: Fundamentals, simulations and advanced topics","author":"H. Attiya","year":"1998","unstructured":"H. Attiya and J. Welch, Distributed computing: Fundamentals, simulations and advanced topics, McGraw-Hill Publishing Company, London, UK, 1998."},{"issue":"2","key":"48_CR3","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/S0097539790192647","volume":"26","author":"D. Dolev","year":"1997","unstructured":"D. Dolev and N. Shavit, Bounded concurrent time-stamping, SIAM Journal of Computing, 26(2): 418\u2013455, 1997.","journal-title":"SIAM Journal of Computing"},{"issue":"5","key":"48_CR4","doi-asserted-by":"publisher","first-page":"1848","DOI":"10.1137\/S0097539793243685","volume":"28","author":"C. Dwork","year":"1999","unstructured":"C. Dwork, M. Herlihy, S. Plotkin and O. Waarts, Time-lapse snapshots, SIAM Journal of Computing, 28(5): 1848\u20131874, 1999.","journal-title":"SIAM Journal of Computing"},{"key":"48_CR5","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1145\/324133.324161","volume":"46","author":"C. Dwork","year":"1999","unstructured":"C. Dwork and O. Waarts, Simple and efficient bounded concurrent timestamping and the traceable use abstraction, Journal of the ACM, Vol. 46, pp. 633\u2013666, 1999.","journal-title":"Journal of the ACM"},{"issue":"1","key":"48_CR6","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/59287.59292","volume":"11","author":"M. Fischer","year":"1989","unstructured":"M. Fischer, N. Lynch, J. Burns and A. Borodin, Distributed Fifo allocation of identical resources using small shared space, ACM Transactions on Programming Language Systems, 11(1): 90\u2013114, 1989.","journal-title":"ACM Transactions on Programming Language Systems"},{"key":"48_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BFb0035176","volume-title":"Proc. Israeli Symp. on Computing and Systems","author":"R. Gawlick","year":"1992","unstructured":"R. Gawlick, N. Lynch, N. Shavit, Concurrent timestamping made simple, Proc. Israeli Symp. on Computing and Systems, 171\u2013183, LNCS 601, Springer, 1992."},{"key":"48_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/505241.505246","volume":"49","author":"S. Haldar","year":"2002","unstructured":"S. Haldar and P. Vitanyi, Bounded concurrent timestamp systems using vector clocks, Journal of the ACM, Vol. 49, pp. 101\u2013126, 2002.","journal-title":"Journal of the ACM"},{"key":"48_CR9","doi-asserted-by":"crossref","unstructured":"A. Israeli and M. Li, Bounded timestamps, Proc. 28th IEEE Symposium on Foundations of Computer Science, pp. 371\u2013382, 1987.","DOI":"10.1109\/SFCS.1987.10"},{"key":"48_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-56188-9_7","volume-title":"Proc. Workshop on Distributed Algorithms","author":"A. Israeli","year":"1992","unstructured":"A. Israeli and M. Pinhasov, A concurrent timestamp scheme which is linear in time and space, Proc. Workshop on Distributed Algorithms, 95\u2013109, LNCS 647, Springer-Verlag, 1992."},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"L. Lamport, A new solution to Dijkstra\u2019s concurrent programming problem, Communications of the ACM, 17, 1974.","DOI":"10.1145\/361082.361093"},{"issue":"4","key":"48_CR12","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/234533.234556","volume":"43","author":"M. Li","year":"1996","unstructured":"M. Li, J. Tromp and P. Vitanyi, How to share concurrent wait-free variables, Journal of the ACM, 43(4): 723\u2013746, 1996.","journal-title":"Journal of the ACM"},{"issue":"1","key":"48_CR13","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/357195.357198","volume":"5","author":"G. Peterson","year":"1983","unstructured":"G. Peterson, Concurrent reading while writing, ACM Transactions on Programming Language Systems, 5(1): 46\u201355, 1983.","journal-title":"ACM Transactions on Programming Language Systems"},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"T. Petrov, A. Pogosyants, S. Garland, V. Luchangco and N. Lynch, Computer-assisted verification of an algorithm for concurrent timestamps, Formal Description Techniques and Protocol Specification, Testing and Verification, FORTE\/PSTV\u201996, IFIP Procs., pp. 29\u201344, 1996.","DOI":"10.1007\/978-0-387-35079-0_2"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"V. Shikaripura, A. Kshemkalyani A simple memory-efficient bounded concurrent timestamping algorithm, Technical Report UIC-CS-02-04, June 2002.","DOI":"10.1007\/3-540-36136-7_48"},{"key":"48_CR16","doi-asserted-by":"crossref","unstructured":"P. Vitanyi and B. Awerbuch, Shared register access by asynchronous hardware, Proc. 27th IEEE Symp. on Foundations of Computer Science, pp. 233\u2013243, 1986.","DOI":"10.1109\/SFCS.1986.11"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36136-7_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:28:49Z","timestamp":1557930529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36136-7_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001423","9783540361367"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-36136-7_48","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}