{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:33:51Z","timestamp":1787340831049,"version":"build-2736575974"},"reference-count":9,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1993,2]]},"abstract":"<jats:p>Given a set of n elements from the domain $\\{ {1, \\cdots ,m} \\}$, this paper investigates how to arrange them in a table of size n, so that searching for an element in the table can be done in constant time. Yao [J. Assoc. Comput. Mach., 28(1981), pp. 615\u2013628] has shown that this cannot be done when the domain is sufficiently large as a function of n.<\/jats:p>\n                  <jats:p>This paper gives a constructive solution when the domain m is polynomial in n, the number of elements, as well as a nonconstructive proof for m no larger than exponential in ${\\operatorname{poly}}(n)$. The authors improve upon a result of Yao and give better bounds on the maximum m for which implicit $O(1)$ probe search can be done. The results are achieved by showing the tight relationship between hashing and certain encoding problems called rainbows.<\/jats:p>","DOI":"10.1137\/0222001","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:38:56Z","timestamp":1109227136000},"page":"1-10","source":"Crossref","is-referenced-by-count":32,"title":["Implicit $O(1)$ Probe Search"],"prefix":"10.1137","volume":"22","author":[{"given":"Amos","family":"Fiat","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"M. Ajtai, J. Koml\u00f3s, E. Szemer\u00e9di,  Deterministic simulation in LOGSPACE,  Proc. 19th ACM Symposium on Theory of Computing,  1987,  132\u2013140","DOI":"10.1145\/28395.28410"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90018-7"},{"key":"R3","unstructured":"A. Cohen, A. Wigderson,  Multigraph amplification,  1989, manuscript"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"A. Fiat, M. Naor, J. P. Schmidt, A. Siegel,  Non-oblivious hashing,  Proc. 20th ACM Symposium on Theory of Computing, Chicago, IL,  367\u2013376","DOI":"10.1145\/62212.62248"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"R6","volume-title":"Ramsey theory","author":"Graham Ronald L.","year":"1980"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90035-9"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1145\/322261.322274"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185351"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0222001","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:51:10Z","timestamp":1787338270000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0222001"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["10.1137\/0222001"],"URL":"https:\/\/doi.org\/10.1137\/0222001","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}