Converting high probability into nearly-constant time---with applications to parallel hashing
Yossi Matias, Uzi Vishkin · 1991
Article Converting high probability into nearly-constant time—with applications to parallel hashing Share on Authors: Yossi Matias Univ. of Maryland, College Park Univ. of Maryland, College ParkView Profile , Uzi Vishkin Univ. of Maryland, College Park Univ. of Maryland, College ParkView Profile Authors Info & Claims STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of ComputingJanuary 1991 Pages 307–316https://doi.org/10.1145/103418.103453Published:03 January 1991 68citation339DownloadsMetricsTotal Citations68Total Downloads339Last 12 Months7Last 6 weeks2 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 SiteGet Access