{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:34:52Z","timestamp":1743132892024,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106972"},{"type":"electronic","value":"9783642106989"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10698-9_2","type":"book-chapter","created":{"date-parts":[[2010,3,5]],"date-time":"2010-03-05T05:19:54Z","timestamp":1267766394000},"page":"10-19","source":"Crossref","is-referenced-by-count":2,"title":["Quantum Online Memory Checking"],"prefix":"10.1007","author":[{"given":"Wim","family":"van Dam","sequence":"first","affiliation":[]},{"given":"Qingqing","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/103418.103428","volume-title":"STOC 1991: Proceedings of the twenty-third annual ACM symposium on Theory of computing","author":"L. Babai","year":"1991","unstructured":"Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: STOC 1991: Proceedings of the twenty-third annual ACM symposium on Theory of computing, pp. 21\u201332. ACM, New York (1991)"},{"issue":"2\/3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01185212","volume":"12","author":"M. Blum","year":"1994","unstructured":"Blum, M., Evans, W.S., Gemmell, P., Kannan, S., Naor, M.: Checking the correctness of memories. Algorithmica\u00a012(2\/3), 225\u2013244 (1994)","journal-title":"Algorithmica"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"167902","DOI":"10.1103\/PhysRevLett.87.167902","volume":"87","author":"H. Buhrman","year":"2001","unstructured":"Buhrman, H., Cleve, R., Watrous, J., de Wolf, R.: Quantum fingerprinting. Physical Review Letters\u00a087, 167902 (2001)","journal-title":"Physical Review Letters"},{"key":"2_CR4","unstructured":"Gavinsky, D., Regev, O., de Wolf, R.: Simultaneous communication protocols with quantum and classical messages. Chicago Journal of Theoretical Computer Science\u00a02008(7) (December 2008), \n                    http:\/\/arxiv.org\/abs\/0807.2758"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/335305.335315","volume-title":"STOC 2000: Proceedings of the thirty-second annual ACM symposium on Theory of computing","author":"J. Katz","year":"2000","unstructured":"Katz, J., Trevisan, L.: On the efficiency of local decoding procedures for error-correcting codes. In: STOC 2000: Proceedings of the thirty-second annual ACM symposium on Theory of computing, pp. 80\u201386. ACM, New York (2000)"},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1462153.1462155","volume":"56","author":"M. Naor","year":"2009","unstructured":"Naor, M., Rothblum, G.N.: The complexity of online memory checking. Journal of the ACM\u00a056(1), 1\u201346 (2009)","journal-title":"Journal of the ACM"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1145\/237814.238004","volume-title":"STOC 1996: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing","author":"I. Newman","year":"1996","unstructured":"Newman, I., Szegedy, M.: Public vs. private coin flips in one round communication games (extended abstract). In: STOC 1996: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pp. 561\u2013570. ACM, New York (1996)"},{"key":"2_CR8","first-page":"347","volume":"13","author":"L. Trevisan","year":"2004","unstructured":"Trevisan, L.: Some applications of coding theory in computational complexity. Quaderni di Matematica\u00a013, 347\u2013424 (2004)","journal-title":"Quaderni di Matematica"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/800135.804414","volume-title":"STOC 1979: Proceedings of the eleventh annual ACM symposium on Theory of computing","author":"A.C.-C. Yao","year":"1979","unstructured":"Yao, A.C.-C.: Some complexity questions related to distributive computing. In: STOC 1979: Proceedings of the eleventh annual ACM symposium on Theory of computing, pp. 209\u2013213. ACM, New York (1979)"}],"container-title":["Lecture Notes in Computer Science","Theory of Quantum Computation, Communication, and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10698-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T04:06:26Z","timestamp":1715400386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-10698-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106972","9783642106989"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10698-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}