{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T05:30:37Z","timestamp":1738733437500,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540922209"},{"type":"electronic","value":"9783540922216"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92221-6_14","type":"book-chapter","created":{"date-parts":[[2008,12,3]],"date-time":"2008-12-03T08:25:04Z","timestamp":1228292704000},"page":"197-216","source":"Crossref","is-referenced-by-count":4,"title":["On the Time-Complexity of Robust and Amnesic Storage"],"prefix":"10.1007","author":[{"given":"Dan","family":"Dobre","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Majuntke","sequence":"additional","affiliation":[]},{"given":"Neeraj","family":"Suri","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BF01786228","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication. part II: Algorithms. Distributed Computing\u00a01(2), 86\u2013101 (1986)","journal-title":"Distributed Computing"},{"issue":"5","key":"14_CR2","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00446-005-0151-6","volume":"18","author":"I. Abraham","year":"2006","unstructured":"Abraham, I., Chockler, G., Keidar, I., Malkhi, D.: Byzantine disk paxos: optimal resilience with byzantine shared memory. Distributed Computing\u00a018(5), 387\u2013408 (2006)","journal-title":"Distributed Computing"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00446-005-0123-x","volume":"18","author":"G. Chockler","year":"2005","unstructured":"Chockler, G., Malkhi, D.: Active disk paxos with infinitely many processes. Distributed Computing\u00a018(1), 73\u201384 (2005)","journal-title":"Distributed Computing"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-36108-1_21","volume-title":"Distributed Computing","author":"J.P. Martin","year":"2002","unstructured":"Martin, J.P., Alvisi, L., Dahlin, M.: Minimal Byzantine Storage. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol.\u00a02508, pp. 311\u2013325. Springer, Heidelberg (2002)"},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/278298.278305","volume":"45","author":"P. Jayanti","year":"1998","unstructured":"Jayanti, P., Chandra, T.D., Toueg, S.: Fault-tolerant wait-free shared objects. J. ACM\u00a045(3), 451\u2013500 (1998)","journal-title":"J. ACM"},{"issue":"1","key":"14_CR6","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.\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-540-75142-7_13","volume-title":"Distributed Computing","author":"G. Chockler","year":"2007","unstructured":"Chockler, G., Guerraoui, R., Keidar, I.: Amnesic Distributed Storage. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 139\u2013151. Springer, Heidelberg (2007)"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/1294261.1294269","volume-title":"SOSP 2007: Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles","author":"J. Hendricks","year":"2007","unstructured":"Hendricks, J., Ganger, G.R., Reiter, M.K.: Low-overhead byzantine fault-tolerant storage. In: SOSP 2007: Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles, pp. 73\u201386. ACM, New York (2007)"},{"issue":"4","key":"14_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s004460050050","volume":"11","author":"D. Malkhi","year":"1998","unstructured":"Malkhi, D., Reiter, M.: Byzantine quorum systems. Distrib. Comput.\u00a011(4), 203\u2013213 (1998)","journal-title":"Distrib. Comput."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/1146381.1146419","volume-title":"PODC 2006: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing","author":"R. Guerraoui","year":"2006","unstructured":"Guerraoui, R., Vukoli\u0107, M.: How fast can a very robust read be? In: PODC 2006: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, pp. 248\u2013257. ACM, New York (2006)"},{"key":"14_CR11","first-page":"135","volume-title":"DSN 2004: Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN 2004)","author":"G.R. Goodson","year":"2004","unstructured":"Goodson, G.R., Wylie, J.J., Ganger, G.R., Reiter, M.K.: Efficient byzantine-tolerant erasure-coded storage. In: DSN 2004: Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN 2004), Washington, DC, USA, pp. 135\u2013144. IEEE Computer Society, Los Alamitos (2004)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Vukoli\u0107, M.: Refined quorum systems. In: PODC 2007: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, pp. 119\u2013128 (2007)","DOI":"10.1145\/1281100.1281120"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-540-30186-8_29","volume-title":"Distributed Computing","author":"R.A. Bazzi","year":"2004","unstructured":"Bazzi, R.A., Ding, Y.: Non-skipping timestamps for byzantine data storage systems. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 405\u2013419. Springer, Heidelberg (2004)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-540-75142-7_4","volume-title":"Distributed Computing","author":"A. Aiyer","year":"2007","unstructured":"Aiyer, A., Alvisi, L., Bazzi, R.A.: Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 7\u201319. Springer, Heidelberg (2007)"},{"key":"14_CR15","first-page":"115","volume-title":"DSN 2006: Proceedings of the International Conference on Dependable Systems and Networks (DSN 2006)","author":"C. Cachin","year":"2006","unstructured":"Cachin, C., Tessaro, S.: Optimal resilience for erasure-coded byzantine distributed storage. In: DSN 2006: Proceedings of the International Conference on Dependable Systems and Networks (DSN 2006), Washington, DC, USA, pp. 115\u2013124. IEEE Computer Society, Los Alamitos (2006)"},{"key":"14_CR16","first-page":"34","volume-title":"ICDCS 2006: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems","author":"B. Liskov","year":"2006","unstructured":"Liskov, B., Rodrigues, R.: Tolerating byzantine faulty clients in a quorum system. In: ICDCS 2006: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems, Washington, DC, USA, pp. 34\u201343. IEEE Computer Society, Los Alamitos (2006)"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Levy, R.R., Vukoli\u0107, M.: Lucky read\/write access to robust atomic storage. In: DSN 2006: Proceedings of the International Conference on Dependable Systems and Networks (DSN 2006), pp. 125\u2013136 (2006)","DOI":"10.1109\/DSN.2006.50"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Abraham, I., Chockler, G., Keidar, I., Malkhi, D.: Wait-free regular storage from byzantine components. Inf. Process. Lett.\u00a0101(2) (2007)","DOI":"10.1016\/j.ipl.2006.07.012"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Dobre, D., Majuntke, M., Suri, N.: On the time-complexity of robust and amnesic storage. Technical Report TR-TUD-DEEDS-04-01-2008, Technische Universit\u00e4t Darmstadt (2008), http:\/\/www.deeds.informatik.tu-darmstadt.de\/dan\/amnesicTR.pdf","DOI":"10.1007\/978-3-540-92221-6_14"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Chockler, G., Rachid Guerraoui, I.K., Vukolic, M.: Reliable distributed storage. IEEE Computer (to appear, 2008)","DOI":"10.1109\/MC.2009.126"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92221-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T02:26:10Z","timestamp":1738722370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92221-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540922209","9783540922216"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92221-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}