{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:51:32Z","timestamp":1725889892609},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642240812"},{"type":"electronic","value":"9783642240829"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24082-9_83","type":"book-chapter","created":{"date-parts":[[2011,9,20]],"date-time":"2011-09-20T11:31:55Z","timestamp":1316518315000},"page":"685-689","source":"Crossref","is-referenced-by-count":3,"title":["Improved Sampling for Triangle Counting with MapReduce"],"prefix":"10.1007","author":[{"given":"Jin-Hyun","family":"Yoon","sequence":"first","affiliation":[]},{"given":"Sung-Ryul","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"83_CR1","doi-asserted-by":"crossref","unstructured":"Achlioptas, D., McSherry, F.: Fast computation of low rank matrix approximation. In: STOC (2001)","DOI":"10.1145\/380752.380858"},{"key":"83_CR2","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/237814.237823","volume-title":"STOC 1996:Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing","author":"N. Alon","year":"1996","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: STOC 1996:Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 20\u201329. ACM, New York (1996)"},{"key":"83_CR3","first-page":"623","volume-title":"SODA 2002: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Z. Bar-Yosseff","year":"2002","unstructured":"Bar-Yosseff, Z., Kumar, R., Sivakumar, D.: Reductions in streaming algorithms, with an application to counting triangles in graphs. In: SODA 2002: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 623\u2013632. Society for Industrial and Applied Mathematics, Philadelphia (2002)"},{"key":"83_CR4","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: Proceedings of ACM KDD, Las Vegas, NV, USA (August 2008)","DOI":"10.1145\/1401890.1401898"},{"key":"83_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/1142351.1142388","volume-title":"PODS 2006: Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems","author":"L.S. Buriol","year":"2006","unstructured":"Buriol, L.S., Frahling, G., Leonardi, S., Marchetti-Spaccamela, A., Sohler, C.: Counting triangles in data streams. In: PODS 2006: Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 253\u2013262. ACM, New York (2006)"},{"key":"83_CR6","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: Simplified data processing on large clusters. In: OSDI (2004)"},{"key":"83_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1007\/11533719_72","volume-title":"Computing and Combinatorics","author":"H. Jowhari","year":"2005","unstructured":"Jowhari, H., Ghodsi, M.: New streaming algorithms for counting triangles in graphs. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 710\u2013716. Springer, Heidelberg (2005)"},{"key":"83_CR8","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C., Drineas, P., Michelakis, E., Koutis, I., Faloutsos, C.: Spectral counting of triangles in power-law networks via element-wise sparsification. In: SODA 2002: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2009)","DOI":"10.1109\/ASONAM.2009.32"},{"key":"83_CR9","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C., Kang, U., Miller, G., Faloutsos, C.: DOULION: Counting Triangles in Massive Graphs with a Coin. In: Proceedings of KDD, pp. 837\u2013846 (2009)","DOI":"10.1145\/1557019.1557111"}],"container-title":["Lecture Notes in Computer Science","Convergence and Hybrid Information Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24082-9_83","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T06:42:37Z","timestamp":1554619357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24082-9_83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642240812","9783642240829"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24082-9_83","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}