On the public citation graph
Hashing for dynamic and static internal tables
0 signed · 53 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.1093/comjnl/29.3.277openalex-snapshot
A Letter-oriented Minimal Perfect Hashing Scheme
inferredcites →https://doi.org/10.1109/ms.1985.232067openalex-snapshot
An Interactive System for Finding Perfect Hash Functions
inferredcites →https://doi.org/10.1109/tse.1983.236866openalex-snapshot
The Study of a New Perfect Hash Scheme
inferredcites →https://doi.org/10.1145/182.358446openalex-snapshot
A Monte Carlo study of Cichelli hash-function solvability
inferredcites →https://doi.org/10.1145/320083.320092openalex-snapshot
Extendible hashing—a fast access method for dynamic files
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/359038.3084011openalex-snapshot
Technical Response to: On Cichelli's Minimal Perfect Hash Functions Method
inferredcites →https://doi.org/10.1145/362575.362578openalex-snapshot
Key-to-address transform techniques
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/947955.947957openalex-snapshot
A letter oriented minimal perfect hashing function
inferredcites →https://doi.org/10.1145/953055.5899openalex-snapshot
Finding minimal perfect hash functions
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-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.1002/gepi.21910openalex-snapshot
Computing a Synthetic Chronic Psychosocial Stress Measurement in Multiple Datasets and its Application in the Replication of G × E Interactions of the EBF1 Gene
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_49openalex-snapshot
Graphs, hypergraphs and hashing
inferred← citeshttps://doi.org/10.1007/s11277-010-0110-9openalex-snapshot
Low-Cost Identifiers for Ubiquitous Computing
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(96)00028-2openalex-snapshot
Storage-efficient data structure for large lookup dictionaries
inferred← citeshttps://doi.org/10.1016/0306-4379(90)90001-6openalex-snapshot
Perfect hashing using sparse matrix packing
inferred← citeshttps://doi.org/10.1016/s0164-1212(98)10089-4openalex-snapshot
A displacement addressing method for letter-oriented keys
inferred← citeshttps://doi.org/10.1016/s0306-4573(98)00011-9openalex-snapshot
Hardware-assisted algorithm for full-text large-dictionary string matching using n-gram hashing
inferred← citeshttps://doi.org/10.1016/s0736-5853(96)00025-1openalex-snapshot
Knowledge representation and construction in hypermedia environments
inferred← citeshttps://doi.org/10.1093/comjnl/39.6.547openalex-snapshot
A Family of Perfect Hashing Methods
inferred← citeshttps://doi.org/10.1109/69.277768openalex-snapshot
Using tries to eliminate pattern collisions in perfect hashing
inferred← citeshttps://doi.org/10.1109/empdp.1994.592492openalex-snapshot
A BDD Package For A Massively Parallel SIMD Architecture
inferred← citeshttps://doi.org/10.1109/hicss.1990.205277openalex-snapshot
Fault tolerant hashing and information retrieval using back propagation
inferred← citeshttps://doi.org/10.1109/icsmc.1995.538341openalex-snapshot
A hierarchical clustering strategy for very large fuzzy databases
inferred← citeshttps://doi.org/10.1109/mpcs.1994.367081openalex-snapshot
A data parallel approach to Boolean function manipulation using BDDs
inferred← citeshttps://doi.org/10.1109/scam.2014.40openalex-snapshot
Fast Flow Analysis with Godel Hashes
inferred← citeshttps://doi.org/10.1109/simsym.1991.151508openalex-snapshot
GAME: an object-oriented approach to computer animation in flexible manufacturing system modelling
inferred← citeshttps://doi.org/10.1109/wons.2005.2openalex-snapshot
Abbreviated Dynamic Source Routing: Source Routing with Non-Unique Network Identifiers
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
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/174666.174667openalex-snapshot
On randomization in sequential and distributed algorithms
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/3077136.3080798openalex-snapshot
Efficient Data Structures for MassiveN-Gram Datasets
inferred← citeshttps://doi.org/10.1145/3302913openalex-snapshot
Handling Massive N -Gram Datasets Efficiently
inferred← citeshttps://doi.org/10.1145/3797036openalex-snapshot
Modern Minimal Perfect Hashing: A Survey
inferred← citeshttps://doi.org/10.1147/rd.342.0289openalex-snapshot
Simulation of embedded memories by defective hashing
inferred← citeshttps://doi.org/10.1590/0101-7438.2015.035.02.0423openalex-snapshot
SOME ILLUSTRATIVE EXAMPLES ON THE USE OF HASH TABLES
inferred← citeshttps://doi.org/10.1631/fitee.1900121openalex-snapshot
MDLB: a metadata dynamic load balancing mechanism based on reinforcement learning
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.