Clocked adversaries for hashing
- 1 March 1993
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 9 (3) , 239-252
- https://doi.org/10.1007/bf01190898
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Multicomputers: message-passing concurrent computersComputer, 1988
- Dynamic perfect hashing: upper and lower boundsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- How to emulate shared memoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Parallel hashing---an efficient implementation of shared memoryPublished by Association for Computing Machinery (ACM) ,1986
- “Hot spot” contention and combining in multistage interconnection networksIEEE Transactions on Computers, 1985
- How to Share Memory in a Distributed System.Published by Defense Technical Information Center (DTIC) ,1984
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979