On the public citation graph

Collections of Functions for Perfect Hashing

0 signed · 27 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.1109/sfcs.1982.80openalex-snapshot
On the program size of perfect and universal hash functions
inferredcites →https://doi.org/10.1137/0211017openalex-snapshot
Geometric Problems with Application to Hashing
inferredcites →https://doi.org/10.1145/322261.322274openalex-snapshot
Should Tables Be Sorted?
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/359168.359175openalex-snapshot
Storing a sparse table
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.4153/cjm-1960-016-5openalex-snapshot
Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture

What points at this work

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

inferred← citeshttps://doi.org/10.1002/scj.4690200710openalex-snapshot
A fast digital search algorithm using a double‐array structure
inferred← citeshttps://doi.org/10.1007/978-3-319-55595-9_2openalex-snapshot
Technologies for Greener Internet of Things Systems
inferred← citeshttps://doi.org/10.1007/bf02074879openalex-snapshot
The effect of table expansion on the program complexity of perfect hash functions
inferred← citeshttps://doi.org/10.1016/0020-0255(92)90113-mopenalex-snapshot
A practical method for implementing string pattern matching machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.10.015openalex-snapshot
Hash function design for cloud storage data auditing
inferred← citeshttps://doi.org/10.1080/00207169408804348openalex-snapshot
An algorithm for dynamic processing of dawg's
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.1109/32.31365openalex-snapshot
An efficient digital search algorithm by using a double-array structure
inferred← citeshttps://doi.org/10.1109/69.277768openalex-snapshot
Using tries to eliminate pattern collisions in perfect hashing
inferred← citeshttps://doi.org/10.1109/cmpsac.1988.17222openalex-snapshot
An efficient digital search algorithm by using a double-array structure
inferred← citeshttps://doi.org/10.1109/naecon.1994.332942openalex-snapshot
An introduction to the S SPIN hash function: making more out of the multidimensional array
inferred← citeshttps://doi.org/10.1109/sfcs.1983.76openalex-snapshot
The program complexity of searching a table
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267781openalex-snapshot
Fault tolerant graphs, perfect hash functions and disjoint paths
inferred← citeshttps://doi.org/10.1137/0219054openalex-snapshot
The Spatial Complexity of Oblivious k -Probe Hash Functions
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/146585.146591openalex-snapshot
Nonoblivious hashing
inferred← citeshttps://doi.org/10.1145/62212.62248openalex-snapshot
Non-oblivious hashing
inferred← citeshttps://doi.org/10.1145/73007.73041openalex-snapshot
On aspects of university and performance for closed hashing
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.