On the public citation graph
On aspects of university and performance for closed hashing
0 signed · 28 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.1007/bf02126797openalex-snapshot
A lower bound for finding predecessors in Yao's cell probe model
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1109/sfcs.1979.26openalex-snapshot
New classes and applications of hash functions
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.1109/sfcs.1983.76openalex-snapshot
The program complexity of searching a table
inferredcites →https://doi.org/10.1109/sfcs.1988.21968openalex-snapshot
Dynamic Perfect Hashing: Upper and Lower Bounds
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/0215044openalex-snapshot
Collections of Functions for Perfect Hashing
inferredcites →https://doi.org/10.1137/0605009openalex-snapshot
On the Size of Separating Systems and Families of Perfect Hash Functions
inferredcites →https://doi.org/10.1145/800057.808705openalex-snapshot
On tape versus core an application of space efficient perfect hash functions to the invariance of space
inferredcites →https://doi.org/10.1145/828.1884openalex-snapshot
Storing a Sparse Table with 0 (1) Worst Case Access Time
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-57899-4_49openalex-snapshot
Graphs, hypergraphs and hashing
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00060openalex-snapshot
Chernoff Bounds and Reverse Hypercontractivity on HDX
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63450openalex-snapshot
On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications
inferred← citeshttps://doi.org/10.1145/100216.100245openalex-snapshot
The analysis of closed hashing under limited randomness
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/780542.780633openalex-snapshot
Uniform hashing in constant time and linear space
inferred← citeshttps://doi.org/10.5555/313559.313797openalex-snapshot
Chernoff-Hoeffding bounds for applications with limited independence
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.