@inproceedings{464691ed4f8145a8815ebbea454e6cac,

title = "Non-oblivious hashing",

abstract = "Non-oblivious hashing, where the information gathered by performing {"}unsuccessful{"} probes determines the probe strategy, is introduced and used to obtain the following results for static lookup on full tables: a. An 0(1) worst case scheme that requires only logarithmic additional memory (improving on the [FKS84] linear space upper bound). b. An almost sure 0(1) probabilistic worst case scheme, without any additional memory (improving on previous logarithmic time upper bounds). c. Enhancements to hashing: Solving (a) and (b) in the multikey record environment, search can be performed under any key in time 0(1); finding the nearest neighbor, the rank, etc. in logarithmic time. Our non-oblivious upper bounds are much better than the appropriate oblivious lower bounds.",

author = "Amos Fiat and Moni Naor and Schmidt, {Jeanette P.} and Alan Siegel",

year = "1988",

doi = "10.1145/62212.62248",

language = "אנגלית",

isbn = "0897912640",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "367--376",

booktitle = "Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988",

note = "null ; Conference date: 02-05-1988 Through 04-05-1988",

}