{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:21:57Z","timestamp":1740547317567,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157745"},{"type":"electronic","value":"9783642157752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_20","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T14:47:32Z","timestamp":1283352452000},"page":"231-242","source":"Crossref","is-referenced-by-count":6,"title":["Streaming Graph Computations with a Helpful Advisor"],"prefix":"10.1007","author":[{"given":"Graham","family":"Cormode","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Mitzenmacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Thaler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"McGregor, A.: Graph mining on streams. In: Encyc. of Database Systems. Springer, Heidelberg (2009)","DOI":"10.1007\/978-0-387-39940-9_184"},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.tcs.2005.09.013","volume":"348","author":"J. Feigenbaum","year":"2005","unstructured":"Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. Theor. Comput. Sci.\u00a0348(2), 207\u2013216 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Finocchi, I., Ribichini, A.: Trading off space for passes in graph streaming problems. In: SODA 2006, pp. 714\u2013723 (2006)","DOI":"10.1145\/1109557.1109635"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Datar, M., Rajagopalan, S., Ruhl, M.: On the streaming model augmented with a sorting primitive. In: FOCS 2004, pp. 540\u2013549 (2004)","DOI":"10.1109\/FOCS.2004.48"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Das Sarma, A., Lipton, R.J., Nanongkai, D.: Best-order streaming model. In: Theory and Applications of Models of Computation, pp. 178\u2013191 (2009)","DOI":"10.1007\/978-3-642-02017-9_21"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., Cormode, G., Mcgregor, A.: Annotations in data streams. In: ICALP 2009, pp. 222\u2013234 (2009)","DOI":"10.1007\/978-3-642-02927-1_20"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/3-540-52282-4_44","volume-title":"STACS 90","author":"R.J. Lipton","year":"1990","unstructured":"Lipton, R.J.: Efficient checking of computations. In: Choffrut, C., Lengauer, T. (eds.) STACS 1990. LNCS, vol.\u00a0415, pp. 207\u2013215. Springer, Heidelberg (1990)"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Yiu, M., Lin, Y., Mouratidis, K.: Efficient verification of shortest path search via authenticated hints. In: ICDE (2010)","DOI":"10.1109\/ICDE.2010.5447914"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L., Woodruff, D.P.: Numerical linear algebra in the streaming model. In: STOC 2009, pp. 205\u2013214 (2009)","DOI":"10.1145\/1536414.1536445"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Sarlos, T.: Improved approximation algorithms for large matrices via random projections. In: IEEE FOCS 2006 (2006)","DOI":"10.1109\/FOCS.2006.37"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Blum, M., Evans, W., Gemmell, P., Kannan, S., Naor, M.: Checking the correctness of memories, pp. 90\u201399 (1995)","DOI":"10.1109\/SFCS.1991.185352"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Cormode, G., Mitzenmacher, M., Thaler, J.: Streaming graph computations with a helpful advisor. CoRR, vol. abs\/1004.2899 (2010)","DOI":"10.1007\/978-3-642-15775-2_20"},{"key":"20_CR13","unstructured":"Lipton, R.J.: Fingerprinting sets. Princeton University, Tech. Rep. Cs-tr-212-89 (1989)"},{"key":"20_CR14","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design (2005)"},{"key":"20_CR15","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency (2003)"},{"key":"20_CR16","unstructured":"Schrijver, A.: Theory of linear and integer programming (1986)"},{"key":"20_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B. Bollobas","year":"1998","unstructured":"Bollobas, B.: Modern Graph Theory. Springer, Heidelberg (1998)"},{"issue":"2","key":"20_CR18","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02526037","volume":"18","author":"V. King","year":"1997","unstructured":"King, V.: A simpler minimum spanning tree verification algorithm. Algorithmica\u00a018(2), 263\u2013270 (1997)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T10:51:46Z","timestamp":1740480706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}