Parallel hashing---an efficient implementation of shared memory
Anna R. Karlin, Eli Upfal · 1986
Article Free Access Share on Parallel hashing—an efficient implementation of shared memory Authors: A R Karlin Computer Science Department, Stanford University Computer Science Department, Stanford UniversityView Profile , E Upfal IBM Almaden Research Center, Almaden, California IBM Almaden Research Center, Almaden, CaliforniaView Profile Authors Info & Claims STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computingNovember 1986Pages 160–168https://doi.org/10.1145/12130.12146Published:01 November 1986Publication History 64citation415DownloadsMetricsTotal Citations64Total Downloads415Last 12 Months17Last 6 weeks4 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF