{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T07:46:03Z","timestamp":1770536763040,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540280613","type":"print"},{"value":"9783540318064","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_72","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:34:13Z","timestamp":1127813653000},"page":"710-716","source":"Crossref","is-referenced-by-count":61,"title":["New Streaming Algorithms for Counting Triangles in Graphs"],"prefix":"10.1007","author":[{"given":"Hossein","family":"Jowhari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Ghodsi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"72_CR1","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N. Alon","year":"1986","unstructured":"Alon, N., Babai, L., Atai, A.: A fast and simple randomized algorithm for maximum indepedent set problem. J. Algorithms\u00a07, 567\u2013583 (1986)","journal-title":"J. Algorithms"},{"key":"72_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: STOC 1996 (1996)","DOI":"10.1145\/237814.237823"},{"key":"72_CR3","unstructured":"Bar-Yossef, Z., Kumar, R., Sivakumar, S.: Reduction in streaming algorithms with an application of counting triangles in graphs. In: SODA 2002 (2002)"},{"issue":"1-3","key":"72_CR4","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1016\/S0304-3975(02)00569-8","volume":"299","author":"A.L. Buchsbaum","year":"2003","unstructured":"Buchsbaum, A.L., Gianvarlo, R., Westbrook, J.R.: On finding common neighborhoods in massive graphs. Thoretical Computer Science\u00a0299(1-3), 707\u2013718 (2003)","journal-title":"Thoretical Computer Science"},{"key":"72_CR5","unstructured":"Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: Graph distances in streaming model; the value of space. Yale University Technical Report (2004)"},{"key":"72_CR6","doi-asserted-by":"crossref","unstructured":"Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. To appear in the 31st International Colloquium on Automata, Languages and Programming (2004)","DOI":"10.1007\/978-3-540-27836-8_46"},{"key":"72_CR7","unstructured":"Henzinger, M.R., Raghavan, P., Rajagopalan, S.: Computing on data streams, Technical Report 1998-001, DEC Systems Research Center (1998)"},{"key":"72_CR8","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0405044","volume":"5","author":"B. Kalyanasundaram","year":"1990","unstructured":"Kalyanasundaram, B., Schnitger, G.: The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics\u00a05, 545\u2013557 (1990)","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_72","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T03:14:27Z","timestamp":1553138067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11533719_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}