On the public citation graph

Uniform hashing is optimal

0 signed · 37 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.1016/0020-0190(78)90014-5openalex-snapshot
There is no fast single hashing algorithm
inferredcites →https://doi.org/10.1080/00029890.1974.11993556openalex-snapshot
Computer Science and Its Relation to Mathematics
inferredcites →https://doi.org/10.1145/321707.321722openalex-snapshot
A Note on the Efficiency of Hashing Functions

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.ch12openalex-snapshot
The Uniform Hashing Model
inferred← citeshttps://doi.org/10.1002/9780470630617.ch14openalex-snapshot
Double Hashing
inferred← citeshttps://doi.org/10.1002/9780470630617.ch15openalex-snapshot
Optimum Hashing
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_25openalex-snapshot
Space Efficient Hash Tables with Worst Case Constant Access Time
inferred← citeshttps://doi.org/10.1007/978-3-322-94707-9_4openalex-snapshot
Speicherverwaltung
inferred← citeshttps://doi.org/10.1007/bf01202791openalex-snapshot
More analysis of double hashing
inferred← citeshttps://doi.org/10.1007/s00224-004-1195-xopenalex-snapshot
Space Efficient Hash Tables with Worst Case Constant Access Time
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90210-xopenalex-snapshot
Self-adjusting and split sequence hash tables
inferred← citeshttps://doi.org/10.1016/j.ins.2005.12.001openalex-snapshot
Hashing via finite field
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.047openalex-snapshot
Unique permutation hashing
inferred← citeshttps://doi.org/10.1016/s0098-3004(03)00037-2openalex-snapshot
Hash functions and triangular mesh reconstruction
inferred← citeshttps://doi.org/10.1023/b:heur.0000019985.94952.ebopenalex-snapshot
Lock-Gain Based Graph Partitioning
inferred← citeshttps://doi.org/10.1109/4.75001openalex-snapshot
A chip set for lossless image compression
inferred← citeshttps://doi.org/10.1109/euc.2008.55openalex-snapshot
Exponential Hashing in Finite Fields
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00045openalex-snapshot
Optimal Bounds for Open Addressing Without Reordering
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00047openalex-snapshot
Tight Bounds for Classical Open Addressing
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/s0097539701386216openalex-snapshot
On Universal Classes of Extremely Random Constant-Time Hash Functions
inferred← citeshttps://doi.org/10.1137/s0097539793255722openalex-snapshot
The Tree Model for Hashing: Lower and Upper Bounds
inferred← citeshttps://doi.org/10.1142/s0129054103002242openalex-snapshot
DOUBLE HASHING WITH MULTIPLE PASSBITS
inferred← citeshttps://doi.org/10.1145/100216.100245openalex-snapshot
The analysis of closed hashing under limited randomness
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/3717823.3718215openalex-snapshot
Optimal Non-oblivious Open Addressing
inferred← citeshttps://doi.org/10.1145/3772375openalex-snapshot
Speeding Up Hash Tables
inferred← citeshttps://doi.org/10.1145/3798129.3800823openalex-snapshot
Greedy Open Addressing Revisited: Beyond Yao’s Lower Bound
inferred← citeshttps://doi.org/10.1145/380752.380836openalex-snapshot
On the cell probe complexity of membership and perfect hashing
inferred← citeshttps://doi.org/10.1145/380752.380844openalex-snapshot
Anti-persistence
inferred← citeshttps://doi.org/10.1145/42267.42274openalex-snapshot
External hashing with limited internal storage
inferred← citeshttps://doi.org/10.1145/62212.62246openalex-snapshot
More analysis of double hashing
inferred← citeshttps://doi.org/10.1145/77600.77619openalex-snapshot
The cost distribution of clustering in random probing
inferred← citeshttps://doi.org/10.2514/1.g006688openalex-snapshot
Review of the k-Vector and Its Relation to Classical Data Structures
inferred← citeshttps://doi.org/10.3390/a16110500openalex-snapshot
Two-Way Linear Probing Revisited
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.