{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T10:01:26Z","timestamp":1760522486040,"version":"3.32.0"},"reference-count":21,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2007,4,1]],"date-time":"2007-04-01T00:00:00Z","timestamp":1175385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":2335,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2007,4]]},"DOI":"10.1016\/j.dam.2006.08.009","type":"journal-article","created":{"date-parts":[[2006,11,1]],"date-time":"2006-11-01T01:25:28Z","timestamp":1162344328000},"page":"898-903","source":"Crossref","is-referenced-by-count":11,"title":["Faster deterministic wakeup in multiple access channels"],"prefix":"10.1016","volume":"155","author":[{"given":"Gianluca","family":"De Marco","sequence":"first","affiliation":[]},{"given":"Marco","family":"Pellegrini","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Sburlati","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1991","series-title":"Data Networks","author":"Bertsekas","key":"10.1016\/j.dam.2006.08.009_bib1"},{"key":"10.1016\/j.dam.2006.08.009_bib2","doi-asserted-by":"crossref","unstructured":"B. Chlebus, L. Gasieniec, D. Kowalski, T. Radzik, On the wake-up problem in radio networks, in: Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP) 2005, to appear.","DOI":"10.1007\/11523468_29"},{"key":"10.1016\/j.dam.2006.08.009_bib3","doi-asserted-by":"crossref","unstructured":"B. Chlebus, D. Kowalski, 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.","DOI":"10.1145\/1011767.1011806"},{"key":"10.1016\/j.dam.2006.08.009_bib4","unstructured":"M. Chrobak, L. Gasieniec, D. Kowalski, 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."},{"issue":"1\u20133","key":"10.1016\/j.dam.2006.08.009_bib5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0304-3975(03)00281-0","article-title":"Efficient constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels","volume":"306","author":"De Bonis","year":"2003","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2006.08.009_bib6","doi-asserted-by":"crossref","unstructured":"G. De Marco, M. Pellegrini, G. Sburlati, Faster deterministic wakeup in multiple access channels, in: Proceedings of the Ninth Italian Conference on Theoretical Computer Science, Lecture Notes in Computer Science, Springer, Berlin, 2005, pp. 196\u2013204.","DOI":"10.1007\/11560586_16"},{"year":"2000","series-title":"Combinatorial Group Testing and its Applications","author":"Du","key":"10.1016\/j.dam.2006.08.009_bib7"},{"key":"10.1016\/j.dam.2006.08.009_bib8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.7146\/math.scand.a-10523","article-title":"On the integers relatively prime to n and on a number-theoretic function considered by Jacobsthal","volume":"11","author":"Erd\u00f6s","year":"1962","journal-title":"Math. Scand."},{"key":"10.1016\/j.dam.2006.08.009_bib9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02772959","article-title":"Families of finite sets in which no set is covered by the union of r others","volume":"51","author":"Erd\u00f6s","year":"1985","journal-title":"Israel J. Math."},{"key":"10.1016\/j.dam.2006.08.009_bib10","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/TIT.1985.1057022","article-title":"A perspective on multiaccess channels","volume":"31","author":"Gallager","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"10.1016\/j.dam.2006.08.009_bib11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/S0895480100376022","article-title":"The wakeup problem in synchronous broadcast systems","volume":"14","author":"Ga\u00b8sieniec","year":"2001","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.dam.2006.08.009_bib12","doi-asserted-by":"crossref","unstructured":"J. Goodman, A.G. Greenberg, N. Madras, P. March, On the stability of Ethernet, 17th ACM Symposium on Theory of Computing, STOC, 1985, pp. 379\u2013387.","DOI":"10.1145\/22145.22187"},{"key":"10.1016\/j.dam.2006.08.009_bib13","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1145\/3828.214125","article-title":"A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels","volume":"32","author":"Greenberg","year":"1985","journal-title":"J. ACM"},{"year":"1975","series-title":"An Introduction to the Theory of Numbers","author":"Hardy","key":"10.1016\/j.dam.2006.08.009_bib14"},{"key":"10.1016\/j.dam.2006.08.009_bib15","doi-asserted-by":"crossref","unstructured":"J. Hastad, T. Leighton, B. Rogoff, Analisys of backoff protocols for multiple access channels, 19th ACM Symposium on Theory of Computing, STOC, 1987, pp. 241\u2013253.","DOI":"10.1145\/28395.28422"},{"key":"10.1016\/j.dam.2006.08.009_bib16","doi-asserted-by":"crossref","unstructured":"P. Indyk, Deterministic superimposed coding with application to pattern matching, 38th Symposium on Foundations of Computer Science, FOCS, 1997, pp. 127\u2013136.","DOI":"10.1109\/SFCS.1997.646101"},{"key":"10.1016\/j.dam.2006.08.009_bib17","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1515\/dema-1978-0121","article-title":"On the problem of Jacobsthal","volume":"11","author":"Iwaniec","year":"1978","journal-title":"Demonstratio Math."},{"key":"10.1016\/j.dam.2006.08.009_bib18","doi-asserted-by":"crossref","unstructured":"T. Jurdzi\u0144ski, G. Stachowiak, Probabilistic algorithms for the wakeup problem in single-hop radio networks, ISAAC 2002, Lecture Notes in Computer Science vol. 2518, 2002, pp.535\u2013549.","DOI":"10.1007\/3-540-36136-7_47"},{"key":"10.1016\/j.dam.2006.08.009_bib19","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","article-title":"Nonrandom binary superimposed codes","volume":"10","author":"Kautz","year":"1964","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"10.1016\/j.dam.2006.08.009_bib20","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1109\/TIT.1985.1057020","article-title":"An asymptotically optimal nonadaptive algorithm for conflict resolution in multiple-access channels","volume":"31","author":"Koml\u00f3s","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"year":"1981","series-title":"Computer Networks","author":"Tannenbaum","key":"10.1016\/j.dam.2006.08.009_bib21"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X06003933?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X06003933?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T19:14:41Z","timestamp":1736622881000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X06003933"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4]]},"references-count":21,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2007,4]]}},"alternative-id":["S0166218X06003933"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2006.08.009","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2007,4]]}}}