On the public citation graph

Near‐perfect hashing of large word sets

0 signed · 18 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.1145/3532.3538openalex-snapshot
A polynomial time generator for minimal perfect hash functions
inferredcites →https://doi.org/10.1145/358027.358051openalex-snapshot
The study of an ordered minimal perfect hashing scheme
inferredcites →https://doi.org/10.1145/358800.358806openalex-snapshot
Reciprocal hashing
inferredcites →https://doi.org/10.1145/358808.358813openalex-snapshot
Minimal perfect hash functions made simple
inferredcites →https://doi.org/10.1145/359863.359887openalex-snapshot
Perfect hashing functions
inferredcites →https://doi.org/10.1145/953055.5899openalex-snapshot
Finding minimal perfect hash 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/spe.4380210104openalex-snapshot
A letter‐oriented perfect hashing scheme based upon sparse table compression
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_49openalex-snapshot
Graphs, hypergraphs and hashing
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90220-popenalex-snapshot
An optimal algorithm for generating minimal perfect hash functions
inferred← citeshttps://doi.org/10.1016/0306-4379(90)90001-6openalex-snapshot
Perfect hashing using sparse matrix packing
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00146-6openalex-snapshot
Perfect hashing
inferred← citeshttps://doi.org/10.1016/s0950-5849(02)00174-xopenalex-snapshot
Empirical studies of some hashing functions
inferred← citeshttps://doi.org/10.1109/69.277768openalex-snapshot
Using tries to eliminate pattern collisions in perfect hashing
inferred← citeshttps://doi.org/10.1109/adl.2000.848372openalex-snapshot
Copy detection systems for digital documents
inferred← citeshttps://doi.org/10.1109/scam.2014.40openalex-snapshot
Fast Flow Analysis with Godel Hashes
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/1131411.1131414openalex-snapshot
Optimal table lookup for reserved words in Ada
inferred← citeshttps://doi.org/10.1145/129617.129623openalex-snapshot
Practical minimal perfect hash functions for large databases
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.