{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:49:55Z","timestamp":1761662995655},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237188"},{"type":"electronic","value":"9783642237195"}],"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-23719-5_60","type":"book-chapter","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T09:14:33Z","timestamp":1314695673000},"page":"713-722","source":"Crossref","is-referenced-by-count":5,"title":["Optimal Discovery Strategies in White Space Networks"],"prefix":"10.1007","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ori","family":"Gurel-Gurevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eyal","family":"Lubetzky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Moscibroda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"60_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470277331","volume-title":"The probabilistic method","author":"N. Alon","year":"2008","unstructured":"Alon, N., Spencer, J.H.: The probabilistic method, 3rd edn. John Wiley, Chichester (2008)","edition":"3"},{"issue":"1","key":"60_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1017\/S0021900200016983","volume":"36","author":"S. Alpern","year":"1999","unstructured":"Alpern, S., Baston, V.J., Essegaier, S.: Rendezvous search on a graph. J. Appl. Probab.\u00a036(1), 223\u2013331 (1999)","journal-title":"J. Appl. Probab."},{"key":"60_CR3","volume-title":"The theory of search games and rendezvous, International Series in Operations Research & Management Science","author":"S. Alpern","year":"2003","unstructured":"Alpern, S., Gal, S.: The theory of search games and rendezvous, International Series in Operations Research & Management Science, vol.\u00a055. Kluwer Academic Publishers, Dordrecht (2003)"},{"issue":"4","key":"60_CR4","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1017\/S0021900200028011","volume":"27","author":"E.J. Anderson","year":"1990","unstructured":"Anderson, E.J., Weber, R.R.: The rendezvous problem on discrete locations. J. Appl. Probab.\u00a027(4), 839\u2013851 (1990)","journal-title":"J. Appl. Probab."},{"issue":"4","key":"60_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1594977.1592573","volume":"39","author":"P. Bahl","year":"2009","unstructured":"Bahl, P., Chandra, R., Moscibroda, T., Murty, R., Welsh, M.: White space net- working with Wi-Fi like connectivity. ACM SIGCOMM Computer Communication Review\u00a039(4), 27\u201338 (2009)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"60_CR6","doi-asserted-by":"crossref","unstructured":"Deb, S., Srinivasan, V., Maheshwari, R.: Dynamic spectrum access in DTV whitespaces: design rules, architecture and algorithms. In: Proc. of the 15th Annual International Conference on Mobile Computing and Networking, pp. 1\u201312 (2009)","DOI":"10.1145\/1614320.1614322"},{"key":"60_CR7","unstructured":"FCC press release, FCC adopts rules for unlicensed use of television white spaces, Technical Report 08-260, Federal Communications Commision (November 2008)"},{"key":"60_CR8","unstructured":"FCC press release, FCC frees up vacant TV airwaves for Super Wi-Fi technologies and other technologies, Technical Report 10-174, Federal Communications Commision (September 2010)"},{"key":"60_CR9","doi-asserted-by":"crossref","unstructured":"Janson, S., Luczak Tomasz, A., Rucinsk, a.: Random graphs, p. xii+333 (2000)","DOI":"10.1002\/9781118032718"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23719-5_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T12:08:48Z","timestamp":1560514128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23719-5_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237188","9783642237195"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23719-5_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}