{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T07:27:03Z","timestamp":1780471623204,"version":"3.54.1"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1993,3]]},"DOI":"10.1007\/bf01190898","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T11:57:59Z","timestamp":1108727879000},"page":"239-252","source":"Crossref","is-referenced-by-count":18,"title":["Clocked adversaries for hashing"],"prefix":"10.1007","volume":"9","author":[{"given":"Richard J.","family":"Lipton","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeffrey F.","family":"Naughton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"W. C. Athas and C. L. Seitz. Multicomputer: Message-passing concurrent computers.IEEE Computer, August 1988, pp. 9?24.","DOI":"10.1109\/2.73"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. L. Carter","year":"1979","unstructured":"J. L. Carter and M. N. Wegman. Universal classes of hash functions.Journal of Computer and System Sciences,18:143?154, 1979.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. InProceedings of the 29th IEEE Conference on the Foundations of Computer Science, pp. 524?531, 1988.","DOI":"10.1109\/SFCS.1988.21968"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"A. Karlin and E. Upfal. Parallel hashing?an efficient implementation of shared memory. InProceedings of the 27th Annual Symposium on Computer Science, 1986.","DOI":"10.1145\/12130.12146"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"G. F. Pfister and V. A. Norton. Hot-spot contention and combining in multistage interconnection networks. InProceedings of the International Conference on Parallel Processing, pp. 790?797, 1985.","DOI":"10.1109\/TC.1985.6312198"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"A. G. Ranade, How to emulate shared memory. InProceedings of the 28th Annual Symposium on Computer Science, pp. 185?194, 1987.","DOI":"10.1109\/SFCS.1987.32"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"E. Upfal and A. Wigderson. How to share memory in a distributed system. InProceedings of the Sixteenth ACM Symposium on the Theory of Computing, pp. 171?180, 1984.","DOI":"10.21236\/ADA327912"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01190898.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01190898\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01190898","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:56:16Z","timestamp":1586120176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01190898"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01190898"],"URL":"https:\/\/doi.org\/10.1007\/bf01190898","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}