{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:49:20Z","timestamp":1725738560629},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392115"},{"type":"electronic","value":"9783642392122"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_51","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T13:09:19Z","timestamp":1372770559000},"page":"581-593","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Computation of Balanced Structures"],"prefix":"10.1007","author":[{"given":"David G.","family":"Harris","sequence":"first","affiliation":[]},{"given":"Ehab","family":"Morsy","sequence":"additional","affiliation":[]},{"given":"Gopal","family":"Pandurangan","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Robinson","sequence":"additional","affiliation":[]},{"given":"Aravind","family":"Srinivasan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"51_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., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms\u00a07(4), 567\u2013583 (1986)","journal-title":"J. Algorithms"},{"key":"51_CR2","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"51_CR3","first-page":"1205","volume":"arXiv","author":"D. Gavinsky","year":"2012","unstructured":"Gavinsky, D., Lovett, S., Saks, M., Srinivasan, S.: A tail bound for read-k families of functions. arXiv preprint arXiv:1205.1478 (2012)","journal-title":"arXiv preprint"},{"key":"51_CR4","unstructured":"Harris, D.G., Morsy, E., Pandurangan, G., Robinson, P., Srinivasan, A.: Efficient Computation of Balanced Structures, \n                    \n                      http:\/\/static.monoid.at\/balanced.pdf"},{"key":"51_CR5","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: Local computation: Lower and upper bounds. CoRR, abs\/1011.5470 (2010)"},{"issue":"4","key":"51_CR6","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M. Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput.\u00a015(4), 1036\u20131053 (1986)","journal-title":"SIAM J. Comput."},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"Moscibroda, T.: Clustering. In: Algorithms for Sensor and Ad Hoc Networks, pp. 37\u201360 (2007)","DOI":"10.1007\/978-3-540-74991-2_3"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM (2000)","DOI":"10.1137\/1.9780898719772"},{"issue":"2","key":"51_CR9","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/564585.564602","volume":"33","author":"R. Rajaraman","year":"2002","unstructured":"Rajaraman, R.: Topology control and routing in ad hoc networks: a survey. SIGACT News\u00a033(2), 60\u201373 (2002)","journal-title":"SIGACT News"},{"key":"51_CR10","doi-asserted-by":"crossref","unstructured":"Suomela, J.: Survey of local algorithms. ACM Comput. Surv.\u00a045(2) (2013)","DOI":"10.1145\/2431211.2431223"},{"issue":"10","key":"51_CR11","first-page":"1526","volume":"20","author":"H. Zhang","year":"2009","unstructured":"Zhang, H., Shen, H.: Balancing energy consumption to maximize network lifetime in data-gathering sensor networks. IEEE TPDS\u00a020(10), 1526\u20131539 (2009)","journal-title":"IEEE TPDS"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T09:34:08Z","timestamp":1557912848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}