{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:02:06Z","timestamp":1729609326491,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1109\/cdc.2012.6426862","type":"proceedings-article","created":{"date-parts":[[2013,2,8]],"date-time":"2013-02-08T17:05:08Z","timestamp":1360343108000},"page":"5234-5239","source":"Crossref","is-referenced-by-count":1,"title":["On size estimation protocols for Sensor Networks"],"prefix":"10.1109","author":[{"given":"Jacek","family":"Cichon","sequence":"first","affiliation":[]},{"given":"Jakub","family":"Lemiesz","sequence":"additional","affiliation":[]},{"given":"Marcin","family":"Zawada","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.91"},{"key":"13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/1146381.1146401","article-title":"Computing separable functions via gossip","author":"mosk-aoyama","year":"2006","journal-title":"Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing - PODC '06"},{"journal-title":"A First Course in Order Statistics","year":"1992","author":"arnold","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5717355"},{"journal-title":"Distributed Size Estimation in Anonymous Networks","year":"0","author":"varagnolo","key":"12"},{"key":"3","first-page":"1","article-title":"On message complexity of extrema propagation techniques","volume":"7363","author":"cicho?n","year":"2012","journal-title":"ADHOC-NOW"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2012.6214120"},{"key":"1","first-page":"322","article-title":"On cardinality estimation protocols for wireless sensor networks","volume":"6811","author":"cichon","year":"2011","journal-title":"ADHOC-NOW"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807094"},{"key":"7","first-page":"491","article-title":"An optimal cardinality estimation algorithm based on order statistics and its full analysis","author":"lumbroso","year":"2010","journal-title":"AofA'10"},{"key":"6","article-title":"Hyperloglog: The analysis of a near-optimal cardinality estimation algorithm","author":"flajolet","year":"2007","journal-title":"Conference on Analysis of Algorithms AofA 2007"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/78922.78925"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00220-5"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.209"}],"event":{"name":"2012 IEEE 51st Annual Conference on Decision and Control (CDC)","start":{"date-parts":[[2012,12,10]]},"location":"Maui, HI, USA","end":{"date-parts":[[2012,12,13]]}},"container-title":["2012 IEEE 51st IEEE Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6416474\/6425800\/06426862.pdf?arnumber=6426862","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T03:14:24Z","timestamp":1498014864000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6426862\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/cdc.2012.6426862","relation":{},"subject":[],"published":{"date-parts":[[2012,12]]}}}