{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:27:06Z","timestamp":1725550026546},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291060"},{"type":"electronic","value":"9783540320241"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560586_16","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:08:27Z","timestamp":1129817307000},"page":"196-204","source":"Crossref","is-referenced-by-count":1,"title":["Faster Deterministic Wakeup in Multiple Access Channels"],"prefix":"10.1007","author":[{"given":"Gianluca","family":"De Marco","sequence":"first","affiliation":[]},{"given":"Marco","family":"Pellegrini","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Sburlati","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","volume":"45","author":"R. Bar-Yehuda","year":"1992","unstructured":"Bar-Yehuda, R., Goldreich, O., Itai, A.: On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap between Determinism and Randomization. Journal of Computer and System Sciences\u00a045, 104\u2013126 (1992)","journal-title":"Journal of Computer and System Sciences"},{"key":"16_CR2","volume-title":"Data Networks","author":"D. Bertsekas","year":"1991","unstructured":"Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Englewood Cliffs (1991)"},{"unstructured":"Chrobak, M., Gasieniec, L., Kowalski, D.: The Wake-Up problem in multi-hop radio networks. In: Proceedings of 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 992\u20131000 (2004)","key":"16_CR3"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/11523468_29","volume-title":"Automata, Languages and Programming","author":"B. Chlebus","year":"2005","unstructured":"Chlebus, B., Gasieniec, L., Kowalski, D., Radzik, T.: On the Wake-up Problem in Radio Networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 347\u2013359. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Chlebus, B., Kowalski, D.: A better wake-up in radio networks. In: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (PODC 2004), pp. 266\u2013274 (2004)","key":"16_CR5","DOI":"10.1145\/1011767.1011806"},{"issue":"1-3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0304-3975(03)00281-0","volume":"306","author":"A. Bonis De","year":"2003","unstructured":"De Bonis, A., Vaccaro, U.: Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels. Theoretical Computer Science\u00a0306(1-3), 223\u2013243 (2003)","journal-title":"Theoretical Computer Science"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0020-0190(00)00178-2","volume":"79","author":"G. Marco De","year":"2001","unstructured":"De Marco, G., Pelc, A.: Faster broadcasting in unknown radio networks. Information Processing Letters\u00a079, 53\u201356 (2001)","journal-title":"Information Processing Letters"},{"key":"16_CR8","volume-title":"Combinatorial Group Testing and its Applications","author":"D.Z. Du","year":"2000","unstructured":"Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and its Applications. World Scientific, Singapore (2000)"},{"key":"16_CR9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.7146\/math.scand.a-10523","volume":"11","author":"P. Erd\u00f6s","year":"1962","unstructured":"Erd\u00f6s, P.: On the Integers Relatively Prime to n and on a Number-Theoretic Function Considered by Jacobsthal. Math. Scand.\u00a011, 163\u2013170 (1962)","journal-title":"Math. Scand."},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF02772959","volume":"51","author":"P. Erd\u00f6s","year":"1985","unstructured":"Erd\u00f6s, P., Frankl, P., F\u00fcredi, Z.: Families of Finite Sets in Which no Set Is Covered by the Union of r Others. Israel J. Math.\u00a051, 75\u201389 (1985)","journal-title":"Israel J. Math."},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/TIT.1985.1057022","volume":"31","author":"R. Gallager","year":"1985","unstructured":"Gallager, R.: A Perspective on Multiaccess Channels. IEEE Trans. on Information Theory\u00a031, 124\u2013142 (1985)","journal-title":"IEEE Trans. on Information Theory"},{"doi-asserted-by":"crossref","unstructured":"Goodman, J., Greenberg, A.G., Madras, N., March, P.: On the stability of Ethernet. In: 17th ACM symposium on Theory of computing, STOC, pp. 379\u2013387 (1985)","key":"16_CR12","DOI":"10.1145\/22145.22187"},{"issue":"2","key":"16_CR13","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/S0895480100376022","volume":"14","author":"L. Ga\u0327sieniec","year":"2001","unstructured":"Ga\u0327sieniec, L., Pelc, A., Peleg, D.: The Wakeup Problem in Synchronous Broadcast Systems. SIAM J. Discrete Math.\u00a014(2), 207\u2013222 (2001)","journal-title":"SIAM J. Discrete Math."},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/3828.214125","volume":"32","author":"A.G. Greenberg","year":"1985","unstructured":"Greenberg, A.G., Winograd, S.: A Lower Bound on the Time Needed in the Worst Case to Resolve Conflicts Deterministically in Multiple Access Channels. J. ACM\u00a032, 596\u2013598 (1985)","journal-title":"J. ACM"},{"key":"16_CR15","volume-title":"An Introduction to the Theory of Numbers","author":"G.H. Hardy","year":"1975","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers, 4th edn. Clarendon Press, Oxford (1975)","edition":"4"},{"doi-asserted-by":"crossref","unstructured":"Hastad, J., Leighton, T., Rogoff, B.: Analisys of Backoff Protocols for Multiple Access Channels. In: 19th ACM symposium on Theory of computing, STOC, pp. 241\u2013253 (1987)","key":"16_CR16","DOI":"10.1145\/28395.28422"},{"doi-asserted-by":"crossref","unstructured":"Indyk, P.: Deterministic Superimposed Coding with Application to Pattern Matching. In: 38th Symposium on Foundations of Computer Science, FOCS, pp. 127\u2013136 (1997)","key":"16_CR17","DOI":"10.1109\/SFCS.1997.646101"},{"key":"16_CR18","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1515\/dema-1978-0121","volume":"11","author":"H. Iwaniec","year":"1978","unstructured":"Iwaniec, H.: On the problem of Jacobstahl. Demonstratio Mathematica\u00a011, 225\u2013231 (1978)","journal-title":"Demonstratio Mathematica"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/3-540-36136-7_47","volume-title":"Algorithms and Computation","author":"T. Jurdzi\u0144ski","year":"2002","unstructured":"Jurdzi\u0144ski, T., Stachowiak, G.: Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 535\u2013549. Springer, Heidelberg (2002)"},{"issue":"2","key":"16_CR20","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/TIT.1985.1057020","volume":"31","author":"J. Koml\u00f3s","year":"1985","unstructured":"Koml\u00f3s, J., Greenberg, A.G.: An Asymptotically Optimal Nonadaptive Algorithm for Conflict Resolution in Multiple-Access Channels. IEEE Trans. on Information Theory\u00a031(2), 302\u2013306 (1985)","journal-title":"IEEE Trans. on Information Theory"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"W.H. Kautz","year":"1964","unstructured":"Kautz, W.H., Singleton, R.C.: Nonrandom binary superimposed codes. IEEE Trans. Inform. Theory\u00a010, 363\u2013377 (1964)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"16_CR22","volume-title":"Computer Networks","author":"A. Tannenbaum","year":"1981","unstructured":"Tannenbaum, A.: Computer Networks. Prentice-Hall, Englewood Cliffs (1981)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560586_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T11:08:55Z","timestamp":1586516935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560586_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291060","9783540320241"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11560586_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}