On the public citation graph
Using tries to eliminate pattern collisions in perfect hashing
0 signed · 40 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/spe.4380191005openalex-snapshot
Near‐perfect hashing of large word sets
inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1016/0306-4379(90)90001-6openalex-snapshot
Perfect hashing using sparse matrix packing
inferredcites →https://doi.org/10.1016/0898-1221(83)90016-0openalex-snapshot
Minimal and almost minimal perfect hash function search with application to natural language lexicon design
inferredcites →https://doi.org/10.1109/2.7056openalex-snapshot
Hashing for dynamic and static internal tables
inferredcites →https://doi.org/10.1109/tse.1983.236866openalex-snapshot
The Study of a New Perfect Hash Scheme
inferredcites →https://doi.org/10.1137/0215044openalex-snapshot
Collections of Functions for Perfect Hashing
inferredcites →https://doi.org/10.1145/129617.129623openalex-snapshot
Practical minimal perfect hash functions for large databases
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/358808.358813openalex-snapshot
Minimal perfect hash functions made simple
inferredcites →https://doi.org/10.1145/368336.368352openalex-snapshot
Handling identifies as internal symbols in language processors
inferredcites →https://doi.org/10.1145/75427.75440openalex-snapshot
A more cost effective algorithm for finding perfect hash 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.1145/953055.5899openalex-snapshot
Finding minimal perfect hash functions
inferredcites →https://doi.org/10.13182/nse68-a19548openalex-snapshot
The Art of Computer Programming
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-44977-9_9openalex-snapshot
Implementation of Dictionaries via Automata and Decision Trees
inferred← citeshttps://doi.org/10.1007/s10115-015-0873-0openalex-snapshot
A compression method of double-array structures using linear functions
inferred← citeshttps://doi.org/10.1016/j.ipm.2006.04.004openalex-snapshot
A compact static double-array keeping character codes
inferred← citeshttps://doi.org/10.1016/j.ipm.2014.04.004openalex-snapshot
Compression of double array structures for fixed length keywords
inferred← citeshttps://doi.org/10.1093/comjnl/45.2.213openalex-snapshot
Exact Analyses of a Simple Heuristic Employed in Array Compression
inferred← citeshttps://doi.org/10.1109/30.477224openalex-snapshot
Teletext data change detection and noiseless data compression
inferred← citeshttps://doi.org/10.1109/69.738363openalex-snapshot
Reducing the storage requirements of a perfect hash function
inferred← citeshttps://doi.org/10.1109/hpcs.1992.759098openalex-snapshot
Group address recognition with perfect hashing hardware - Extended abstract
inferred← citeshttps://doi.org/10.1145/202176.202179openalex-snapshot
A comparison of three strategies for computing letter oriented, minimal perfect hashing functions
inferred← citeshttps://doi.org/10.1145/3797036openalex-snapshot
Modern Minimal Perfect Hashing: A Survey
inferred← citeshttps://doi.org/10.1504/ijcat.2015.071971openalex-snapshot
Double array structures based on byte segmentation for n-gram
inferred← citeshttps://doi.org/10.1504/ijista.2015.074331openalex-snapshot
A new compression method for double-array structures by a hierarchical representation
inferred← citeshttps://doi.org/10.1504/ijista.2015.074336openalex-snapshot
A construction method by divided double array structures
inferred← citeshttps://doi.org/10.5555/1756384.1756395openalex-snapshot
Implementation of dictionaries via automata and decision trees
inferred← citeshttps://doi.org/10.7763/ijcte.2014.v6.855openalex-snapshot
A Retrieval Method for Double Array Structures by Using Byte N-Gram
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.