{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:49:09Z","timestamp":1743090549525,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222115"},{"type":"electronic","value":"9783642222122"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22212-2_11","type":"book-chapter","created":{"date-parts":[[2011,7,21]],"date-time":"2011-07-21T07:22:50Z","timestamp":1311232970000},"page":"113-124","source":"Crossref","is-referenced-by-count":2,"title":["Partial is Full"],"prefix":"10.1007","author":[{"given":"Bernadette","family":"Charron-Bost","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"F\u00fcgger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jennifer L.","family":"Welch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Widder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/TCOM.1981.1094876","volume":"29","author":"E. Gafni","year":"1981","unstructured":"Gafni, E., Bertsekas, D.P.: Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Transactions on Communications\u00a029, 11\u201318 (1981)","journal-title":"IEEE Transactions on Communications"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Park, V.D., Corson, M.S.: A highly adaptive distributed routing algorithm for mobile wireless networks. In: 16th Conference on Computer Communications (Infocom), pp. 1405\u20131413 (1997)","DOI":"10.1109\/INFCOM.1997.631180"},{"key":"11_CR3","unstructured":"Ko, Y.B., Vaidya, N.H.: Geotora: a protocol for geocasting in mobile ad hoc networks. In: Proceedings of the 2000 International Conference on Network Protocols, ICNP 2000, pp. 240\u2013250 (2000)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Charron-Bost, B., Gaillard, A., Welch, J.L., Widder, J.: Routing without ordering. In: Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 145\u2013153 (2009)","DOI":"10.1145\/1583991.1584034"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Malpani, N., Welch, J.L., Vaidya, N.: Leader election algorithms for mobile ad hoc networks. In: Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communication (2000)","DOI":"10.1145\/345848.345871"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1109\/TPDS.2007.70792","volume":"19","author":"A. Derhab","year":"2008","unstructured":"Derhab, A., Badache, N.: A self-stabilizing leader election algorithm in highly dynamic ad hoc mobile networks. IEEE Trans. Parallel Distrib. Syst.\u00a019, 926\u2013939 (2008)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Ingram, R., Shields, P., Walter, J.E., Welch, J.L.: An asynchronous leader election algorithm for dynamic networks. In: Proceedings of the IEEE International Parallel & Distributed Processing Symposium, pp. 1\u201312 (2009)","DOI":"10.1109\/IPDPS.2009.5161028"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"K.M. Chandy","year":"1984","unstructured":"Chandy, K.M., Misra, J.: The drinking philosopher\u2019s problem. ACM Transactions on Programming Languages and Systems\u00a06, 632\u2013646 (1984)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/69558.69560","volume":"11","author":"V.C. Barbosa","year":"1989","unstructured":"Barbosa, V.C., Gafni, E.: Concurrency in heavily loaded neighborhood-constrained systems. ACM Trans. Program. Lang. Syst.\u00a011, 562\u2013584 (1989)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1109\/TPDS.2006.94","volume":"17","author":"S. Tirthapura","year":"2006","unstructured":"Tirthapura, S., Herlihy, M.: Self-stabilizing distributed queuing. IEEE Transactions on Parallel and Distributed Systems\u00a017, 646\u2013655 (2006)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K. Raymond","year":"1989","unstructured":"Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems\u00a07, 61\u201377 (1989)","journal-title":"ACM Transactions on Computer Systems"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jpdc.1996.0041","volume":"34","author":"M. Naimi","year":"1996","unstructured":"Naimi, M., Trehel, M., Arnold, A.: A log(n) distributed mutual exclusion algorithm based on path reversal. J. Parallel and Distributed Computing\u00a034, 1\u201313 (1996)","journal-title":"J. Parallel and Distributed Computing"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1023\/A:1012363200403","volume":"7","author":"J.E. Walter","year":"2001","unstructured":"Walter, J.E., Welch, J.L., Vaidya, N.H.: A mutual exclusion algorithm for ad hoc mobile networks. Wireless Networks\u00a07, 585\u2013600 (2001)","journal-title":"Wireless Networks"},{"key":"11_CR14","series-title":"LNCS","first-page":"99","volume-title":"SIROCCO 2011","author":"B. Charron-Bost","year":"2011","unstructured":"Charron-Bost, B., F\u00fcgger, M., Welch, J.L., Widder, J.: Full reversal routing as a linear dynamical system. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol.\u00a06796, pp. 99\u2013110. Springer, Heidelberg (2011)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Busch, C., Surapaneni, S., Tirthapura, S.: Analysis of link reversal routing algorithms for mobile ad hoc networks. In: Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 210\u2013219 (2003)","DOI":"10.1145\/777412.777446"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/S0097539704443598","volume":"35","author":"C. Busch","year":"2005","unstructured":"Busch, C., Tirthapura, S.: Analysis of link reversal routing algorithms. SIAM Journal on Computing\u00a035, 305\u2013326 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR17","unstructured":"Charron-Bost, B., F\u00fcgger, M., Welch, J.L., Widder, J.: Partial is full. Research Report 10\/2011, Technische Universit\u00e4t Wien, Institut f\u00fcr Technische Informatik, Treitlstr. 1-3\/182-2, 1040 Vienna, Austria (2011)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-05434-1_10","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"B. Charron-Bost","year":"2009","unstructured":"Charron-Bost, B., Welch, J.L., Widder, J.: Link reversal: How to play better to work less. In: Dolev, S. (ed.) ALGOSENSORS 2009. LNCS, vol.\u00a05804, pp. 88\u2013101. Springer, Heidelberg (2009)"}],"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-642-22212-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T07:14:29Z","timestamp":1741331669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22212-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222115","9783642222122"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22212-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}