{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:40:30Z","timestamp":1737502830287,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_32","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"304-318","source":"Crossref","is-referenced-by-count":0,"title":["Quantum Sampling for Balanced Allocations"],"prefix":"10.1007","author":[{"given":"Kazuo","family":"Iwama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akinori","family":"Kawachi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeru","family":"Yamashita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"S. Aaronson, \u201cQuantum Lower Bound for the Collision Problem,\u201d Proceedings of the 34th ACM Symposium on Theory of Computing, 635\u2013642, 2002.","DOI":"10.1145\/509907.509999"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y. Azar","year":"1999","unstructured":"Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal, \u201cBalanced Allocations,\u201d SIAM Journal on Computing, Vol. 29, No. 1, 180\u2013200, 1999.","journal-title":"SIAM Journal on Computing"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"M. Adler, S. Chakarabarti, M. Mitzenmacher, and L. Rasmussen, \u201cParallel Randomized Load Balancing,\u201d Proceedings of the 27th ACM Symposium on Theory of Computing, 238\u2013247, 1995.","DOI":"10.1145\/225058.225131"},{"issue":"4\u20135","key":"32_CR4","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M. Boyer","year":"1998","unstructured":"M. Boyer, G. Brassard, P. H\u00f8yer, and A. Tapp, \u201cTight Bounds on Quantum Searching,\u201d Fortschritte der Physik, vol. 46(4\u20135), 493\u2013505, 1998.","journal-title":"Fortschritte der Physik"},{"key":"32_CR5","unstructured":"G. Brassard, P. H\u00f8yer, M. Mosca, and A. Tapp, \u201cQuantum amplitude amplification and estimation\u201d, Quantum Computation and Quantum Information: A Millennium Volume, AMS Contemporary Mathematics Series, May 2000."},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"P. Berenbrink, A. Czumaj, A. Steger, and B. V\u00f6cking, \u201cBalanced Allocations: The Heavily Loaded Case,\u201d Proceedings of the 32nd ACM Symposium on Theory of Computing, 745\u2013754, 2000.","DOI":"10.1145\/335305.335411"},{"key":"32_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BFb0054319","volume-title":"Proceedings of 3rd Latin American Symposium on Theoretical Informatics (LATIN\u201998)","author":"G. Brassard","year":"1998","unstructured":"G. Brassard, P. H\u00f8yer and A. Tapp, \u201cQuantum cryptanalysis of hash and claw-free functions,\u201d Proceedings of 3rd Latin American Symposium on Theoretical Informatics (LATIN\u201998), Vol. 1380 of Lecture Notes in Computer Science, 163\u2013169, 1998."},{"key":"32_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/BFb0055105","volume-title":"Proceedings of the 25th International Colloquium on Automata, Languages, and Programming","author":"G. Brassard","year":"1998","unstructured":"G. Brassard, P. H\u00f8yer, and A. Tapp, \u201cQuantum Counting,\u201d Proceedings of the 25th International Colloquium on Automata, Languages, and Programming, Vol. 1443 of Lecture Notes in Computer Science, 820\u2013831, 1998."},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"H. Buhrman, C. D\u00fcrr, M. Heiligman, P. H\u00f8yer, F. Magniez, M. Santha, and R. de Wolf, \u201cQuantum Algorithm for Element Distinctness\u201d, Proceedings of the 16th IEEE Conference on Computational Complexity, 131\u2013137, 2001.","DOI":"10.1109\/CCC.2001.933880"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"D. P. Chi and J. Kim, \u201cQuantum Database Searching by a Single Query,\u201d Lecture at First NASA International Conference on Quantum Computing and Quantum Communications, 1998.","DOI":"10.1007\/3-540-49208-9_11"},{"key":"32_CR11","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"T. H. Cormen, C. E. Leiserson and R. L. Rivest, \u201cIntroduction to Algorithms,\u201d Cambridge, Mass.: MIT Press, 1990."},{"key":"32_CR12","unstructured":"C. D\u00fcrr and P. H\u00f8yer \u201cA Quantum Algorithm for Finding the Minimum,\u201d LANL preprint, http:\/\/xxx.lanl.gov\/archive\/quant-ph\/9607014."},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"L. K. Grover, \u201cA fast quantum mechanical algorithm for database search,\u201d Proceedings of the 28th ACM Symposium on Theory of Computing, 212\u2013218, 1996.","DOI":"10.1145\/237814.237866"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"L. K. Grover, \u201cA framework for fast quantum mechanical algorithms,\u201d Proceedings of the 30th ACM Symposium on Theory of Computing, 53\u201356, 1998.","DOI":"10.1145\/276698.276712"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"L. K. Grover, \u201cRapid sampling through quantum computing,\u201d Proceedings of the 32nd ACM Symposium on Theory of Computing, 618\u2013626, 2000.","DOI":"10.1145\/335305.335389"},{"key":"32_CR16","volume-title":"Urn Models and Their Application","author":"N. Johnson","year":"1977","unstructured":"N. Johnson, and S. Kotz, \u201cUrn Models and Their Application,\u201d John Wily & Sons, New York, 1977."},{"key":"32_CR17","volume-title":"Random Allocations","author":"V. Kolchin","year":"1978","unstructured":"V. Kolchin, B. Sevastyanov, and V. Chistyakov, \u201cRandom Allocations,\u201d John Wiley & Sons, New York, 1978."},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"G. L. Long, \u201cGrover Algorithm with Zero Theoretical Failure Rate,\u201d Physical Review A, Vol. 6 4022307, June, 2001.","DOI":"10.1103\/PhysRevA.64.022307"},{"key":"32_CR19","unstructured":"M. Mitzenmacher, \u201cThe Power of Two Choices in Randomized Load Balancing,\u201d Ph.D. Thesis, 1996."},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"R. Motwani, and P. Raghavan, \u201cRandomized Algorithms,\u201d Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511814075"},{"key":"32_CR21","unstructured":"Y. Shi, \u201cQuantum Lower Bounds for the Collision and the Element Distinctness Problems,\u201d Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, 513\u2013519, 2002."},{"issue":"5","key":"32_CR22","doi-asserted-by":"publisher","first-page":"1414","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P. W. Shor","year":"1997","unstructured":"P. W. Shor, \u201cAlgorithms for Quantum Computation: Discrete Log and Factoring\u201d, SIAM Journal of Computing, Vol. 26, No. 5, 1414\u20131509, 1997.","journal-title":"SIAM Journal of Computing"},{"key":"32_CR23","doi-asserted-by":"crossref","unstructured":"B. V\u00f6cking, \u201cHow Asymmetry Helps Load Balancing,\u201d Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, 131\u2013140, 1999.","DOI":"10.1109\/SFFCS.1999.814585"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T23:25:49Z","timestamp":1737501949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}