{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:46:08Z","timestamp":1725839168568},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662489703"},{"type":"electronic","value":"9783662489710"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48971-0_60","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T04:00:57Z","timestamp":1448510457000},"page":"715-726","source":"Crossref","is-referenced-by-count":1,"title":["Streaming Verification in Data Analysis"],"prefix":"10.1007","author":[{"given":"Samira","family":"Daruki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Thaler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suresh","family":"Venkatasubramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"60_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Sharathkumar, R.: Streaming algorithms for extent problems in high dimensions. In: Proceedings of the Twenty-First Annual ACM-SIAM symposium on Discrete Algorithms (SODA), pp. 1481\u20131489. Society for Industrial and Applied Mathematics (2010)","DOI":"10.1137\/1.9781611973075.120"},{"key":"60_CR2","doi-asserted-by":"crossref","unstructured":"Andoni, A., et al.: Eigenvalues of a matrix in the streaming model. In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1729\u20131737. SIAM (2013)","DOI":"10.1137\/1.9781611973105.124"},{"key":"60_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L., Frankl, P., Simon, J.: Complexity classes in communication complexity theory. In: 27th Annual Symposium on Foundations of Computer Science (FOCS), pp. 337\u2013347. IEEE (1986)","DOI":"10.1109\/SFCS.1986.15"},{"key":"60_CR4","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., Cormode, G., Goyal, N., Thaler, J.: Annotations for sparse data streams. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 687\u2013706. SIAM (2014)","DOI":"10.1137\/1.9781611973402.52"},{"key":"60_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-02927-1_20","volume-title":"Automata, Languages and Programming","author":"A Chakrabarti","year":"2009","unstructured":"Chakrabarti, A., Cormode, G., McGregor, A.: Annotations in Data Streams. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 222\u2013234. Springer, Heidelberg (2009)"},{"issue":"1","key":"60_CR6","first-page":"7","volume":"11","author":"A Chakrabarti","year":"2014","unstructured":"Chakrabarti, A., Cormode, G., McGregor, A., Thaler, J.: Annotations in data streams. ACM Trans. Algorithms (TALG) 11(1), 7 (2014)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"60_CR7","unstructured":"Chakrabarti, A., Cormode, G., McGregor, A., Thaler, J., Venkatasubramanian, S.: On interactivity in Arthur-Merlin communication and stream computation. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 20, p. 180 (2013)"},{"issue":"1","key":"60_CR8","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.comgeo.2005.10.002","volume":"35","author":"TM Chan","year":"2006","unstructured":"Chan, T.M.: Faster core-set constructions and data-stream algorithms in fixed dimensions. Comput. Geom. 35(1), 20\u201335 (2006)","journal-title":"Comput. Geom."},{"key":"60_CR9","doi-asserted-by":"crossref","unstructured":"Cormode, G., Mitzenmacher, M., Thaler, J.: Practical verified computation with streaming interactive proofs. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS), pp. 90\u2013112. ACM (2012)","DOI":"10.1145\/2090236.2090245"},{"issue":"2","key":"60_CR10","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00453-011-9598-y","volume":"65","author":"G Cormode","year":"2013","unstructured":"Cormode, G., Mitzenmacher, M., Thaler, J.: Streaming graph computations with a helpful advisor. Algorithmica 65(2), 409\u2013442 (2013)","journal-title":"Algorithmica"},{"issue":"1","key":"60_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.14778\/2047485.2047488","volume":"5","author":"G Cormode","year":"2011","unstructured":"Cormode, G., Thaler, J., Yi, K.: Verifying computations with streaming interactive proofs. Proc. VLDB Endowment 5(1), 25\u201336 (2011)","journal-title":"Proc. VLDB Endowment"},{"key":"60_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/11590156_8","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"M Edwards","year":"2005","unstructured":"Edwards, M., Varadarajan, K.R.: No coreset, no cry: II. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 107\u2013115. Springer, Heidelberg (2005)"},{"key":"60_CR13","unstructured":"Goel, A., Indyk, P., Varadarajan, K.R.: Reductions among high dimensional proximity problems. In: Proceedings of the Twelfth Annual ACM-SIAM symposium on Discrete Algorithms (SODA), vol. 1, pp. 769\u2013778. Citeseer (2001)"},{"key":"60_CR14","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing (STOC), pp. 113\u2013122. ACM (2008)","DOI":"10.1145\/1374376.1374396"},{"key":"60_CR15","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"60_CR16","doi-asserted-by":"crossref","unstructured":"Gur, T., Raz, R.: Arthur-Merlin streaming complexity. Inf. Comput. 243, 145\u2013165 (2015). 40th International Colloquium on Automata, Languages and Programming (ICALP 2013)","DOI":"10.1016\/j.ic.2014.12.011"},{"key":"60_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-540-30538-5_27","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"S Har-Peled","year":"2004","unstructured":"Har-Peled, S.: No, coreset, no cry. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 324\u2013335. Springer, Heidelberg (2004)"},{"key":"60_CR18","doi-asserted-by":"crossref","unstructured":"Klauck, H.: On Arthur-Merlin games in communication complexity. In: 26th Annual Conference on Computational Complexity (CCC), pp. 189\u2013199. IEEE (2011)","DOI":"10.1109\/CCC.2011.33"},{"key":"60_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1007\/978-3-662-43948-7_76","volume-title":"Automata, Languages, and Programming","author":"H Klauck","year":"2014","unstructured":"Klauck, H., Prakash, V.: An improved interactive streaming algorithm for the distinct elements problem. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 919\u2013930. Springer, Heidelberg (2014)"},{"issue":"4","key":"60_CR20","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1145\/146585.146605","volume":"39","author":"C Lund","year":"1992","unstructured":"Lund, C., Fortnow, L., Karloff, H.J., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM 39(4), 859\u2013868 (1992)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48971-0_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T23:34:27Z","timestamp":1567380867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48971-0_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489703","9783662489710"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48971-0_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}