{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:09:49Z","timestamp":1725516589173},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540693260"},{"type":"electronic","value":"9783540693550"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69355-0_11","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"119-130","source":"Crossref","is-referenced-by-count":4,"title":["Computing Frequent Elements Using Gossip"],"prefix":"10.1007","author":[{"given":"Bibudh","family":"Lahiri","sequence":"first","affiliation":[]},{"given":"Srikanta","family":"Tirthapura","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Demers, A.J., Greene, D.H., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H.E., Swinehart, D.C., Terry, D.B.: Epidemic algorithms for replicated database maintenance. In: Proceedings of the Principles of Distibuted Computing (PODC), pp. 1\u201312 (1987)","DOI":"10.1145\/41840.41841"},{"key":"11_CR2","unstructured":"Lahiri, B., Tirthapura, S.: Computing frequent elements using gossip. Technical report, Dept. of Electrical and Computer Engineering, Iowa State University (April 2008), \n                    \n                      http:\/\/archives.ece.iastate.edu\/archive\/00000415\/01\/gossip.pdf"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS), pp. 482\u2013491 (2003)","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Boyd, S.P., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: design, analysis and applications. In: Proceedings of the IEEE Conference on Computer Communications (INFOCOM), pp. 1653\u20131664 (2005)","DOI":"10.1109\/INFCOM.2005.1498447"},{"issue":"6","key":"11_CR5","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1109\/TIT.2006.874516","volume":"52","author":"S.P. Boyd","year":"2006","unstructured":"Boyd, S.P., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Transactions on Information Theory\u00a052(6), 2508\u20132530 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Mosk-Aoyama, D., Shah, D.: Computing separable functions via gossip. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 113\u2013122 (2006)","DOI":"10.1145\/1146381.1146401"},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0167-6423(82)90012-0","volume":"2","author":"J. Misra","year":"1982","unstructured":"Misra, J., Gries, D.: Finding repeated elements. Science of Computer Programming\u00a02(2), 143\u2013152 (1982)","journal-title":"Science of Computer Programming"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. In: Proceedings of 28th International Conference on Very Large Data Bases (VLDB), pp. 346\u2013357 (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"R.M. Karp","year":"2003","unstructured":"Karp, R.M., Shenker, S., Papadimitriou, C.H.: A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst.\u00a028, 51\u201355 (2003)","journal-title":"ACM Trans. Database Syst."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Cao, P., Wang, Z.: Efficient top-k query calculation in distributed networks. In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 206\u2013215 (2004)","DOI":"10.1145\/1011767.1011798"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Zhao, Q., Ogihara, M., Wang, H., Xu, J.: Finding global icebergs over distributed data sets. In: Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp. 298\u2013307 (2006)","DOI":"10.1145\/1142351.1142394"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Manjhi, A., Shkapenyuk, V., Dhamdhere, K., Olston, C.: Finding (recently) frequent items in distributed data streams. In: Proceedings of the 21st International Conference on Data Engineering (ICDE), pp. 767\u2013778 (2005)","DOI":"10.1109\/ICDE.2005.68"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Keralapura, R., Cormode, G., Ramamirtham, J.: Communication-efficient distributed monitoring of thresholded counts. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD), pp. 289\u2013300 (2006)","DOI":"10.1145\/1142473.1142507"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: Proceedings of the 23rd Conference of the IEEE Communications Society (INFOCOM) (2004)","DOI":"10.1109\/INFCOM.2004.1354487"},{"key":"11_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Broder, A.Z., Charikar, M., Frieze, A.M., Mitzenmacher, M.: Min-wise independent permutations (extended abstract). In: Proceedings of the ACM Symposium on Theory of Computing (STOC), pp. 327\u2013336 (1998)","DOI":"10.1145\/276698.276781"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69355-0_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:37:12Z","timestamp":1620016632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69355-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540693260","9783540693550"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69355-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}