{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:43Z","timestamp":1760202643721,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T00:00:00Z","timestamp":1374451200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,7,22]]},"DOI":"10.1145\/2484239.2484247","type":"proceedings-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T18:06:58Z","timestamp":1373998018000},"page":"147-156","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Feedback from nature"],"prefix":"10.1145","author":[{"given":"Alex","family":"Scott","sequence":"first","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Jeavons","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Xu","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,7,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2075029.2075034"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1193210"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90019-2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ceb.2011.09.005"},{"key":"e_1_3_2_1_5_1","volume-title":"Error minimization in lateral inhibition circuits. Science Signaling, 3(129):ra51","author":"Barad O.","year":"2010","unstructured":"O. Barad , D. Rosin , E. Hornstein , and N. Barkai . Error minimization in lateral inhibition circuits. Science Signaling, 3(129):ra51 , 2010 . O. Barad, D. Rosin, E. Hornstein, and N. Barkai. Error minimization in lateral inhibition circuits. Science Signaling, 3(129):ra51, 2010."},{"key":"e_1_3_2_1_6_1","volume-title":"Sept.","author":"Bray S. J.","year":"2006","unstructured":"S. J. Bray . Notch signalling: a simple pathway becomes complex. Nature reviews. Molecular cell biology, 7(9):678--689 , Sept. 2006 . S. J. Bray. Notch signalling: a simple pathway becomes complex. Nature reviews. Molecular cell biology, 7(9):678--689, Sept. 2006."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/jtbi.1996.0233"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/646881.710618"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1038\/nrg3272"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392825"},{"issue":"22","key":"e_1_3_2_1_11_1","first-page":"4531","article-title":"Cis-interactions between Delta and Notch modulate neurogenic signalling","volume":"125","author":"Jacobsen T. L.","year":"1998","unstructured":"T. L. Jacobsen , K. Brennan , A. M. Arias , and M. A. T. Muskavitch . Cis-interactions between Delta and Notch modulate neurogenic signalling in Drosophila. Development , 125 ( 22 ): 4531 -- 4540 , 1998 . T. L. Jacobsen, K. Brennan, A. M. Arias, and M. A. T. Muskavitch. Cis-interactions between Delta and Notch modulate neurogenic signalling in Drosophila. Development, 125(22):4531--40, 1998.","journal-title":"Drosophila. Development"},{"key":"e_1_3_2_1_12_1","series-title":"The IBM Research Symposia Series","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"Karp R. M.","year":"1972","unstructured":"R. M. Karp . Reducibility among combinatorial problems . In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations , The IBM Research Symposia Series , pages 85 -- 103 . Plenum Press , New York , 1972 . R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, The IBM Research Symposia Series, pages 85--103. Plenum Press, New York, 1972."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_21"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109666"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22146"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1242\/dev.027938"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-010-0121-5"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073842"},{"key":"e_1_3_2_1_20_1","volume-title":"Nov.","author":"Navlakha S.","year":"2011","unstructured":"S. Navlakha and Z. Bar-Joseph . Algorithms in nature: the convergence of systems biology and computational thinking. Molecular Systems Biology, 7(1) , Nov. 2011 . S. Navlakha and Z. Bar-Joseph. Algorithms in nature: the convergence of systems biology and computational thinking. Molecular Systems Biology, 7(1), Nov. 2011."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature08959"}],"event":{"name":"PODC '13: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Montr\u00e9al Qu\u00e9bec Canada","acronym":"PODC '13"},"container-title":["Proceedings of the 2013 ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2484239.2484247","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2484239.2484247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:41Z","timestamp":1750236521000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2484239.2484247"}},"subtitle":["an optimal distributed algorithm for maximal independent set selection"],"short-title":[],"issued":{"date-parts":[[2013,7,22]]},"references-count":21,"alternative-id":["10.1145\/2484239.2484247","10.1145\/2484239"],"URL":"https:\/\/doi.org\/10.1145\/2484239.2484247","relation":{},"subject":[],"published":{"date-parts":[[2013,7,22]]},"assertion":[{"value":"2013-07-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}