{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:57:18Z","timestamp":1743065838199,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642160226"},{"type":"electronic","value":"9783642160233"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16023-3_44","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T20:41:49Z","timestamp":1284928909000},"page":"573-587","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Storage Capacity of Labeled Graphs"],"prefix":"10.1007","author":[{"given":"Dana","family":"Angluin","sequence":"first","affiliation":[]},{"given":"James","family":"Aspnes","sequence":"additional","affiliation":[]},{"given":"Rida A.","family":"Bazzi","sequence":"additional","affiliation":[]},{"given":"Jiang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"David","family":"Eisenstat","sequence":"additional","affiliation":[]},{"given":"Goran","family":"Konjevod","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,20]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Albertson, M.O.: Distinguishing Cartesian powers of graphs. Electronic Journal of Combinatorics 12, N17 (2005)","DOI":"10.37236\/1984"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Albertson, M.O., Collins, K.L.: Symmetry breaking in graphs. Electronic Journal of Combinatorics 3(1), R18 (1996)","DOI":"10.37236\/1242"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Chan, M., Fischer, M.J., Jiang, H., Peralta, R.: Stably computable properties of network graphs. In: Proc. 1st IEEE International Conference on Distributed Computing in Sensor Systems: pp. 63\u201374 (2005)","DOI":"10.1007\/11502593_8"},{"key":"44_CR4","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Urn automata. Technical Report YALEU\/DCS\/TR-1280, Yale University Department of Computer Science (November 2003)"},{"issue":"4","key":"44_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D. Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing\u00a018(4), 235\u2013253 (2006)","journal-title":"Distributed Computing"},{"key":"44_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-89707-1_5","volume-title":"Middleware for Network Eccentric and Mobile Applications","author":"J. Aspnes","year":"2009","unstructured":"Aspnes, J., Ruppert, E.: An introduction to population protocols. In: Garbinato, B., Miranda, H., Rodrigues, L. (eds.) Middleware for Network Eccentric and Mobile Applications, pp. 97\u2013120. Springer, Heidelberg (2009)"},{"key":"44_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"issue":"11","key":"44_CR8","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM\u00a017(11), 643\u2013644 (1974)","journal-title":"Communications of the ACM"},{"key":"44_CR9","unstructured":"Guerraoui, R., Ruppert, E.: Even small birds are unique: Population protocols with identifiers. Technical Report CSE-2007-04, Department of Computer Science and Engineering, York University (2007)"},{"key":"44_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-642-02930-1_40","volume-title":"Automata, Languages and Programming","author":"R. Guerraoui","year":"2009","unstructured":"Guerraoui, R., Ruppert, E.: Names trump malice: Tiny mobile agents can tolerate byzantine failures. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 484\u2013495. Springer, Heidelberg (2009)"},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Itkis, G., Levin, L.A.: Fast and lean self-stabilizing asynchronous protocols. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 226\u2013239 (1994)","DOI":"10.1109\/SFCS.1994.365691"},{"key":"44_CR12","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. John Wiley & Sons, Chichester (2000)"},{"key":"44_CR13","first-page":"400","volume-title":"STOC","author":"S. Lindell","year":"1992","unstructured":"Lindell, S.: A logspace algorithm for tree canonization (extended abstract). In: STOC, pp. 400\u2013404. ACM, New York (1992)"},{"key":"44_CR14","series-title":"Prentice-Hall series in automatic computation","volume-title":"Computation: Finite and infinite machines","author":"M.L. Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: Finite and infinite machines. Prentice-Hall series in automatic computation. Prentice-Hall, Inc., Englewood Cliffs (1967)"},{"key":"44_CR15","doi-asserted-by":"crossref","unstructured":"Russell, A., Sundaram, R.: A note on the asymptotics and computational complexity of graph distinguishability. Electronic Journal of Combinatorics 5(1), R23 (1998)","DOI":"10.37236\/1361"},{"issue":"3","key":"44_CR16","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1137\/0209036","volume":"9","author":"A. Sch\u00f6nhage","year":"1980","unstructured":"Sch\u00f6nhage, A.: Storage modification machines. SIAM J. Comput.\u00a09(3), 490\u2013508 (1980)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16023-3_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T22:46:07Z","timestamp":1740523567000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-16023-3_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642160226","9783642160233"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16023-3_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]},"assertion":[{"value":"20 September 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}