On the public citation graph

Minimal perfect hashing in polynomial time

0 signed · 20 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/s0022-0000(74)80029-2openalex-snapshot
Fast modular transforms
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/828.1884openalex-snapshot
Storing a Sparse Table with 0 (1) Worst Case Access Time
inferredcites →https://doi.org/10.2307/2283566openalex-snapshot
Introduction to Mathematical Statistics.
inferredcites →https://doi.org/10.2307/2291439openalex-snapshot
Introduction to Mathematical Statistics.
inferredcites →https://doi.org/10.2307/2982264openalex-snapshot
Introduction to Mathematical Statistics.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-53504-7_85openalex-snapshot
Minimal perfect hashing for large sets of data
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_49openalex-snapshot
Graphs, hypergraphs and hashing
inferred← citeshttps://doi.org/10.1007/978-1-4419-8590-3_9openalex-snapshot
External Perfect 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/j.cag.2017.08.012openalex-snapshot
Exclusive grouped spatial hashing
inferred← citeshttps://doi.org/10.1016/j.ins.2021.01.038openalex-snapshot
Secure two-party input-size reduction: Challenges, solutions and applications
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00146-6openalex-snapshot
Perfect hashing
inferred← citeshttps://doi.org/10.1109/scam.2014.40openalex-snapshot
Fast Flow Analysis with Godel Hashes
inferred← citeshttps://doi.org/10.1145/1141911.1141926openalex-snapshot
Perfect spatial hashing
inferred← citeshttps://doi.org/10.1145/3797036openalex-snapshot
Modern Minimal Perfect Hashing: A Survey
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.