{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:09:17Z","timestamp":1763467757332},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388753"},{"type":"electronic","value":"9783540388760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_13","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"112-123","source":"Crossref","is-referenced-by-count":12,"title":["Contention Resolution with Heterogeneous Job Sizes"],"prefix":"10.1007","author":[{"given":"Michael A.","family":"Bender","sequence":"first","affiliation":[]},{"given":"Jeremy T.","family":"Fineman","sequence":"additional","affiliation":[]},{"given":"Seth","family":"Gilbert","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"13_CR1","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1145\/360248.360253","volume":"19","author":"R.M. Metcalfe","year":"1976","unstructured":"Metcalfe, R.M., Boggs, D.R.: Ethernet: Distributed packet switching for local computer networks. CACM\u00a019(7), 395\u2013404 (1976)","journal-title":"CACM"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Abramson, N.: The ALOHA system \u2014 another alternative for computer communications. In: Proc. of AFIPS FJCC, vol.\u00a037, pp. 281\u2013285 (1970)","DOI":"10.21236\/AD0707853"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: Architectural support for lock-free data structures. In: Proc. of the 20th Intl. Conference on Computer Architecture, San Diego, California, pp. 289\u2013300 (1993)","DOI":"10.1145\/165123.165164"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Rajwar, R., Goodman, J.R.: Speculative lock elision: Enabling highly concurrent multithreaded execution. In: Proc. of the 34th Annual Intl. Symposium on Microarchitecture, Austin, Texas, pp. 294\u2013305 (2001)","DOI":"10.1109\/MICRO.2001.991127"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Ananian, C.S., Asanovi\u0107, K., Kuszmaul, B.C., Leiserson, C.E., Lie, S.: Unbounded transactional memory. In: Proc. of the 11th Intl. Symposium on High-Performance Computer Architecture, San Franscisco, California, pp. 316\u2013327 (2005)","DOI":"10.1109\/HPCA.2005.41"},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/274787.274816","volume":"45","author":"P.D. MacKenzie","year":"1998","unstructured":"MacKenzie, P.D., Plaxton, C.G., Rajaraman, R.: On contention resolution protocols and associated probabilistic phenomena. JACM\u00a045(2), 324\u2013378 (1998)","journal-title":"JACM"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Juels, A., Rivest, R.L., Szydlo, M.: The blocker tag: Selective blocking of RFID tags for consumer privacy. In: Conference on Computer and Communications Security, 103\u2013111 (2003)","DOI":"10.1145\/948109.948126"},{"key":"13_CR8","doi-asserted-by":"crossref","DOI":"10.1002\/0470868023","volume-title":"RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification","author":"K. Finkenzeller","year":"2003","unstructured":"Finkenzeller, K.: RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification, 2nd edn. John Wiley & Sons, Chichester (2003), E-book at, \n                    \n                      books24x7.com","edition":"2"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Ger\u00e9b-Graus, M., Tsantilas, T.: Efficient optical communication in parallel computers. In: Proc. of the 4th Annual Symposium on Parallel Algorithms and Architectures, pp. 41\u201348 (1992)","DOI":"10.1145\/140901.140906"},{"key":"13_CR10","first-page":"345","volume":"5","author":"R.I. Greenberg","year":"1989","unstructured":"Greenberg, R.I., Leiserson, C.E.: Randomized routing on fat-trees. Advances in Computing Research\u00a05, 345\u2013374 (1989)","journal-title":"Advances in Computing Research"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M., He, S., Kuszmaul, B.C., Leiserson, C.E.: Adversarial contention resolution for simple channels. In: 17th Annual Symposium on Parallelism in Algorithms and Architectures, pp. 325\u2013332 (2005)","DOI":"10.1145\/1073970.1074023"},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"589","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. JACM\u00a032(3), 589\u2013596 (1985)","journal-title":"JACM"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/23005.23006","volume":"34","author":"A.G. Greenberg","year":"1987","unstructured":"Greenberg, A.G., Flajolet, P., Ladner, R.E.: Estimating the multiplicities of conflicts to speed their resolution in multiple access channels. JACM\u00a034(2), 289\u2013325 (1987)","journal-title":"JACM"},{"issue":"4","key":"13_CR14","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1137\/S0097539793259483","volume":"26","author":"L.A. Goldberg","year":"1997","unstructured":"Goldberg, L.A., Jerrum, M., Leighton, T., Rao, S.: Doubly logarithmic communication algorithms for optical-communication parallel computers. SIAM Journal on Computing\u00a026(4), 1100\u20131119 (1997)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"13_CR15","doi-asserted-by":"publisher","first-page":"1829","DOI":"10.1137\/S0097539795290507","volume":"28","author":"L.A. Goldberg","year":"1999","unstructured":"Goldberg, L.A., Matias, Y., Rao, S.: An optical simulation of shared memory. SIAM Journal on Computing\u00a028(5), 1829\u20131847 (1999)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:16:48Z","timestamp":1619507808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11841036_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}