On the public citation graph

More analysis of double hashing

0 signed · 32 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1016/0020-0190(78)90014-5openalex-snapshot
There is no fast single hashing algorithm
inferredcites →https://doi.org/10.1016/0022-0000(78)90046-6openalex-snapshot
The analysis of double hashing
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1145/321707.321722openalex-snapshot
A Note on the Efficiency of Hashing Functions
inferredcites →https://doi.org/10.1145/3828.3836openalex-snapshot
Uniform hashing is optimal
inferredcites →https://doi.org/10.1145/62212.62246openalex-snapshot
More analysis of double hashing
inferredcites →https://doi.org/10.1145/73007.73041openalex-snapshot
On aspects of university and performance for closed hashing
inferredcites →https://doi.org/10.1145/77600.77619openalex-snapshot
The cost distribution of clustering in random probing
inferredcites →https://doi.org/10.1214/aoms/1177698243openalex-snapshot
Monotone Convergence of Binomial Probabilities and a Generalization of Ramanujan's Equation
inferredcites →https://doi.org/10.2307/2005383openalex-snapshot
The Art of Computer Programming, Vol. 3: Sorting and Searching

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470630617.ch14openalex-snapshot
Double Hashing
inferred← citeshttps://doi.org/10.1006/jagm.2000.1138openalex-snapshot
Median Bounds and Their Application
inferred← citeshttps://doi.org/10.1016/b978-0-12-823395-5.00015-xopenalex-snapshot
Data deduplication concepts
inferred← citeshttps://doi.org/10.1016/j.ins.2005.12.001openalex-snapshot
Hashing via finite field
inferred← citeshttps://doi.org/10.1109/allerton.2012.6483344openalex-snapshot
Peeling arguments and double hashing
inferred← citeshttps://doi.org/10.1109/aqtr.2018.8402794openalex-snapshot
A genetic algorithm for obtaining memory constrained near-perfect hashing
inferred← citeshttps://doi.org/10.1109/ispan.2005.47openalex-snapshot
External Double Hashing with Choice
inferred← citeshttps://doi.org/10.1109/mascots.2007.21openalex-snapshot
Efficient External Table Reordering
inferred← citeshttps://doi.org/10.1137/1.9781611974324.1openalex-snapshot
More Analysis of Double Hashing for Balanced Allocations
inferred← citeshttps://doi.org/10.1137/1.9781611974324.2openalex-snapshot
A New Approach to Analyzing Robin Hood Hashing
inferred← citeshttps://doi.org/10.1137/s0097539701386216openalex-snapshot
On Universal Classes of Extremely Random Constant-Time Hash Functions
inferred← citeshttps://doi.org/10.1137/s009753970444630xopenalex-snapshot
A Probabilistic Study on Combinatorial Expanders and Hashing
inferred← citeshttps://doi.org/10.1142/s0129054103002242openalex-snapshot
DOUBLE HASHING WITH MULTIPLE PASSBITS
inferred← citeshttps://doi.org/10.1145/1095890.1095904openalex-snapshot
Segmented hash
inferred← citeshttps://doi.org/10.1145/2612669.2612684openalex-snapshot
Balanced allocations and double hashing
inferred← citeshttps://doi.org/10.1145/380752.380844openalex-snapshot
Anti-persistence
inferred← citeshttps://doi.org/10.1145/780542.780634openalex-snapshot
Almost random graphs with simple hash functions
inferred← citeshttps://doi.org/10.3390/a16110500openalex-snapshot
Two-Way Linear Probing Revisited
inferred← citeshttps://doi.org/10.3934/math.2026407openalex-snapshot
$ \mathfrak{B} $-statistical core and ideal core of double sequences in $ 2 $-normed spaces via RH-regular families
inferred← citeshttps://doi.org/10.48550/arxiv.1209.5360openalex-snapshot
Balanced Allocations and Double Hashing
inferred← citeshttps://doi.org/10.82308/45910openalex-snapshot
Two-way hashing with separate chaining and linear probing
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.