On the public citation graph

A polynomial time generator for minimal perfect hash functions

0 signed · 50 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/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.21236/ad0705364openalex-snapshot
GRAPH THEORY
inferredcites →https://doi.org/10.4159/harvard.9780674419193openalex-snapshot
Relativ Frequency of English Speech Sounds

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.4380191005openalex-snapshot
Near‐perfect hashing of large word sets
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-51364-7_1openalex-snapshot
A short review of high speed compilation
inferred← citeshttps://doi.org/10.1007/3-540-51364-7_9openalex-snapshot
The INDIA lexic generator
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.1007/978-3-030-85610-6_17openalex-snapshot
BRIDGE: Administering Small Anonymous Longitudinal HCI Studies with Snowball-Type Sampling
inferred← citeshttps://doi.org/10.1007/bf01932700openalex-snapshot
An algebraic approach to Cichelli's perfect hashing
inferred← citeshttps://doi.org/10.1007/bf01940874openalex-snapshot
Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
inferred← citeshttps://doi.org/10.1007/bf01990535openalex-snapshot
Optimal dynamic multi-attribute hashing for range queries
inferred← citeshttps://doi.org/10.1007/bf02017345openalex-snapshot
Minimal perfect hashing in polynomial time
inferred← citeshttps://doi.org/10.1007/s004539900059openalex-snapshot
Derandomization, Witnesses for Boolean Matrix Multiplication and Construction of Perfect Hash Functions
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90096-8openalex-snapshot
An ordered minimal perfect hashing scheme with single parameter
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/0020-0190(94)00108-1openalex-snapshot
Finding succinct ordered minimal perfect hash functions
inferred← citeshttps://doi.org/10.1016/0164-1212(94)00024-hopenalex-snapshot
The study of letter-oriented hashing schemes
inferred← citeshttps://doi.org/10.1016/0306-4379(90)90001-6openalex-snapshot
Perfect hashing using sparse matrix packing
inferred← citeshttps://doi.org/10.1016/j.cag.2017.08.012openalex-snapshot
Exclusive grouped spatial hashing
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00016-2openalex-snapshot
The self-indexed search algorithm: A bit-level approach to minimal perfect hashing
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00146-6openalex-snapshot
Perfect hashing
inferred← citeshttps://doi.org/10.1080/0025570x.1995.11996271openalex-snapshot
Generating a Rotation Reduction Perfect Hashing Function
inferred← citeshttps://doi.org/10.1080/02533839.1998.9670401openalex-snapshot
Applying hashing search and fuzzy fault‐tolerant algorithms for the fast recognition of multi‐font printed Chinese characters
inferred← citeshttps://doi.org/10.1093/comjnl/39.6.547openalex-snapshot
A Family of Perfect Hashing Methods
inferred← citeshttps://doi.org/10.1109/2.7056openalex-snapshot
Hashing for dynamic and static internal tables
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/icci.1992.227626openalex-snapshot
A simple perfect hashing method for static sets
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/1141911.1141926openalex-snapshot
Perfect spatial hashing
inferred← citeshttps://doi.org/10.1145/125187.125200openalex-snapshot
Order-preserving minimal perfect hash functions and information retrieval
inferred← citeshttps://doi.org/10.1145/129617.129623openalex-snapshot
Practical minimal perfect hash functions for large databases
inferred← citeshttps://doi.org/10.1145/1317353.1317368openalex-snapshot
Perfect hash functions for large dictionaries
inferred← citeshttps://doi.org/10.1145/133160.133209openalex-snapshot
A faster algorithm for constructing minimal perfect hash functions
inferred← citeshttps://doi.org/10.1145/142040.142077openalex-snapshot
An undergraduate project to compute minimal perfect hashing functions
inferred← citeshttps://doi.org/10.1145/1516241.1516251openalex-snapshot
An efficient hash-based searching for specimens in the museum's exhibit
inferred← citeshttps://doi.org/10.1145/170791.170839openalex-snapshot
Parallel construction of minimal perfect hashing functions with neural networks
inferred← citeshttps://doi.org/10.1145/3411763.3451794openalex-snapshot
HIDE: Short IDs for Robust and Anonymous Linking of Users Across Multiple Sessions in Small HCI Experiments
inferred← citeshttps://doi.org/10.1145/3797036openalex-snapshot
Modern Minimal Perfect Hashing: A Survey
inferred← citeshttps://doi.org/10.1145/5600.5899openalex-snapshot
Finding minimal perfect hash functions
inferred← citeshttps://doi.org/10.1145/63500.63521openalex-snapshot
File organization using composite perfect hashing
inferred← citeshttps://doi.org/10.1145/75427.75440openalex-snapshot
A more cost effective algorithm for finding perfect hash functions
inferred← citeshttps://doi.org/10.1145/953055.5899openalex-snapshot
Finding minimal perfect hash functions
inferred← citeshttps://doi.org/10.1145/96749.98233openalex-snapshot
Order preserving minimal perfect hash functions and information retrieval
inferred← citeshttps://doi.org/10.70675/88966cfaz558cz41c2za654za94e2acbe3dfopenalex-snapshot
Practical considerations on cryptanalytic time-memory trade-offs
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.