{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:08:52Z","timestamp":1725491332498},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540751410"},{"type":"electronic","value":"9783540751427"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75142-7_19","type":"book-chapter","created":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T10:00:46Z","timestamp":1188986446000},"page":"223-237","source":"Crossref","is-referenced-by-count":2,"title":["The Space Complexity of Unbounded Timestamps"],"prefix":"10.1007","author":[{"given":"Faith","family":"Ellen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiota","family":"Fatourou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Ruppert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Abrahamson, K.: On achieving consensus using a shared memory. In: Proc. 7th ACM Symposium on Principles of Distributed Computing, pp. 291\u2013302 (1988)","DOI":"10.1145\/62546.62594"},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1145\/177492.177731","volume":"16","author":"Y. Afek","year":"1994","unstructured":"Afek, Y., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: A bounded first-in, first-enabled solution to the l-exclusion problem. ACM Transactions on Programming Languages and Systems\u00a016(3), 939\u2013953 (1994)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"4","key":"19_CR3","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/792538.792541","volume":"50","author":"H. Attiya","year":"2003","unstructured":"Attiya, H., Fouren, A.: Algorithms adapting to point contention. Journal of the ACM\u00a050(4), 444\u2013468 (2003)","journal-title":"Journal of the ACM"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1006\/inco.1993.1065","volume":"107","author":"J. Burns","year":"1993","unstructured":"Burns, J., Lynch, N.: Bounds on shared memory for mutual exclusion. Information and Computation\u00a0107(2), 171\u2013184 (1993)","journal-title":"Information and Computation"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(91)90055-M","volume":"39","author":"B. Charron-Bost","year":"1991","unstructured":"Charron-Bost, B.: Concerning the size of logical clocks in distributed systems. Information Processing Letters\u00a039(1), 11\u201316 (1991)","journal-title":"Information Processing Letters"},{"issue":"2","key":"19_CR6","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-stamping. SIAM Journal on Computing\u00a026(2), 418\u2013455 (1997)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"19_CR7","doi-asserted-by":"publisher","first-page":"1848","DOI":"10.1137\/S0097539793243685","volume":"28","author":"C. Dwork","year":"1999","unstructured":"Dwork, C., Herlihy, M., Plotkin, S., Waarts, O.: Time-lapse snapshots. SIAM Journal on Computing\u00a028(5), 1848\u20131874 (1999)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"19_CR8","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1145\/324133.324161","volume":"46","author":"C. Dwork","year":"1999","unstructured":"Dwork, C., Waarts, O.: Simple and efficient bounded concurrent timestamping and the traceable use abstraction. Journal of the ACM\u00a046(5), 633\u2013666 (1999)","journal-title":"Journal of the ACM"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Fatourou, P., Fich, F.E., Ruppert, E.: Time-space tradeoffs for implementations of snapshots. In: Proc. 38th ACM Symposium on Theory of Computing, pp. 169\u2013178 (2006)","DOI":"10.1145\/1132516.1132542"},{"issue":"5","key":"19_CR10","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/290179.290183","volume":"45","author":"F. Fich","year":"1998","unstructured":"Fich, F., Herlihy, M., Shavit, N.: On the space complexity of randomized synchronization. Journal of the ACM\u00a045(5), 843\u2013862 (1998)","journal-title":"Journal of the ACM"},{"issue":"8","key":"19_CR11","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/2.84874","volume":"24","author":"C. Fidge","year":"1991","unstructured":"Fidge, C.: Logical time in distributed computing systems. Computer\u00a024(8), 28\u201333 (1991)","journal-title":"Computer"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Ruppert, E.: Anonymous and fault-tolerant shared-memory computing. Distributed Computing. A preliminary version appeared in Distributed Computing. In: 19th International Conference, pp. 244\u2013259 (to appear)","DOI":"10.1007\/s00446-007-0042-0"},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/505241.505246","volume":"49","author":"S. Haldar","year":"2002","unstructured":"Haldar, S., Vit\u00e1nyi, P.: Bounded concurrent timestamp systems using vector clocks. Journal of the ACM\u00a049(1), 101\u2013126 (2002)","journal-title":"Journal of the ACM"},{"issue":"4","key":"19_CR14","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. Distributed Computing\u00a06(4), 205\u2013209 (1993)","journal-title":"Distributed Computing"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Israeli, A., Pinhasov, M.: A concurrent time-stamp scheme which is linear in time and space. In: Proc. 6th Int. Workshop on Distributed Algorithms, pp. 95\u2013109 (1992)","DOI":"10.1007\/3-540-56188-9_7"},{"issue":"2","key":"19_CR16","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 Journal on Computing\u00a030(2), 438\u2013456 (2000)","journal-title":"SIAM Journal on Computing"},{"issue":"8","key":"19_CR17","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L. Lamport","year":"1974","unstructured":"Lamport, L.: A new solution of Dijkstra\u2019s concurrent programming problem. Communications of the ACM\u00a017(8), 453\u2013455 (1974)","journal-title":"Communications of the ACM"},{"issue":"7","key":"19_CR18","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks and the ordering of events in a distributed system. Communications of the ACM\u00a021(7), 558\u2013565 (1978)","journal-title":"Communications of the ACM"},{"issue":"4","key":"19_CR19","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. Journal of the ACM\u00a043(4), 723\u2013746 (1996)","journal-title":"Journal of the ACM"},{"key":"19_CR20","unstructured":"Mattern, F.: Virtual time and global states of distributed systems. In: Proc. Workshop on Parallel and Distributed Algorithms, pp. 215\u2013226 (1989)"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Michael, L., Spirakis, P.: Computing on a partially eponymous ring. In: Proc. 10th International Conference on Principles of Distributed Systems, pp. 380\u2013394 (2006)","DOI":"10.1007\/11945529_27"},{"key":"19_CR22","first-page":"233","volume-title":"Proc. 27th IEEE Symposium on Foundations of Computer Science","author":"P.M.B. Vit\u00e1nyi","year":"1986","unstructured":"Vit\u00e1nyi, P.M.B., Awerbuch, B.: Atomic shared register access by asynchronous hardware. In: Proc. 27th IEEE Symposium on Foundations of Computer Science, pp. 233\u2013243. IEEE Computer Society Press, Los Alamitos (1986)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75142-7_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:52:37Z","timestamp":1619506357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75142-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540751410","9783540751427"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75142-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}