Expected Length of the Longest Probe Sequence in Hash Code Searching

Gastón H. Gonnet

doi:10.1145/322248.322254

Abstract

article Free AccessExpected Length of the Longest Probe Sequence in Hash Code Searching Author: Gaston H. Gonnet Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1 Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1View Profile Authors Info & Claims Journal of the ACMVolume 28Issue 2April 1981 pp 289–304https://doi.org/10.1145/322248.322254Published:01 April 1981Publication History 164citation1,698DownloadsMetricsTotal Citations164Total Downloads1,698Last 12 Months162Last 6 weeks24 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

Keywords

CitationHash functionComputer scienceSequence (biology)Code (set theory)Information retrievalLibrary scienceProgramming languageBiology

Affiliated Institutions

University of Waterloo CA

Related Publications

LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares

Christopher C. Paige , Michael A. Saunders

article Free AccessLSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares Authors: Christopher C. Paige School of Computer Science, McGill University, Montreal,...

1982 ACM Transactions on Mathematical Soft... 4282 citations

Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems

Christopher C. Paige , Michael A. Saunders

article Free AccessArtifacts AvailableArtifacts Evaluated & Reusable Share on Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems Authors: Christopher C. Pai...

1982 ACM Transactions on Mathematical Soft... 771 citations

The Area-Time Complexity of Binary Multiplication

Richard P. Brent , H. T. Kung

article Free AccessThe Area-Time Complexity of Binary Multiplication Authors: R. P. Brent The Australian National University, Canberra, ACT 2600, Australia The Australian Nation...

1981 Journal of the ACM 198 citations

Algorithm 630

A. Buckley , A. Lenir

article Free AccessArtifacts AvailableArtifacts Evaluated & Reusable Share on Algorithm 630: BBVSCG–a variable-storage algorithm for function minimization Authors: A. Buckley De...

1985 ACM Transactions on Mathematical Soft... 33 citations

Ubiquitous B-Tree

Douglas E. Comer

article Free Access Share on Ubiquitous B-Tree Author: Douglas Comer Computer Science Department, Purdue University, West Lafayette, Indiana Computer Science Department, Purdue ...

1979 ACM Computing Surveys 1814 citations

Publication Info

Year: 1981
Type: article
Volume: 28
Issue: 2
Pages: 289-304
Citations: 235
Access: Closed

External Links

View on DOI.org

Social Impact

Altmetric

Expected Length of the Longest Probe Sequence in Hash Code Searching

PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

235

OpenAlex

Cite This

APA Style

                            
                                    Gastón H. Gonnet
                                
                            (1981). 
                            Expected Length of the Longest Probe Sequence in Hash Code Searching. 
                            Journal of the ACM
                            , 28
                            (2)
                            , 289-304.
                            https://doi.org/10.1145/322248.322254

Identifiers

DOI: 10.1145/322248.322254