On the public citation graph
Implicit $O(1)$ Probe Search
0 signed · 48 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.1016/0022-0000(88)90035-9openalex-snapshot
Expanders, randomness, or time versus space
inferredcites →https://doi.org/10.1016/0304-3975(88)90018-7openalex-snapshot
A tradeoff between search and update time for the implicit dictionary problem
inferredcites →https://doi.org/10.1109/sfcs.1991.185351openalex-snapshot
Simulating BPP using a general weak random source
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.1002/rsa.20359openalex-snapshot
Increasing the output length of zero‐error dispersers
inferred← citeshttps://doi.org/10.1007/11534273_6openalex-snapshot
The Complexity of Implicit and Space Efficient Priority Queues
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_18openalex-snapshot
Representing Trees of Higher Degree
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_87openalex-snapshot
Tables should be sorted (on random access machines)
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_16openalex-snapshot
Approximate Dictionaries
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_16openalex-snapshot
Approximate Dictionaries
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_34openalex-snapshot
Increasing the Output Length of Zero-Error Dispersers
inferred← citeshttps://doi.org/10.1007/978-3-642-14903-0_5openalex-snapshot
Increasing the Output Length of Zero-Error Dispersers
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_1-2openalex-snapshot
Abelian Hidden Subgroup Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_16-2openalex-snapshot
Approximate Dictionaries
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/bfb0049398openalex-snapshot
Membership in constant time and minimum space
inferred← citeshttps://doi.org/10.1007/s00453-004-1146-6openalex-snapshot
Representing Trees of Higher Degree
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/s0166-218x(00)00225-0openalex-snapshot
Representing graphs implicitly using almost optimal space
inferred← citeshttps://doi.org/10.1109/focs.2004.29openalex-snapshot
Extracting Randomness Using Few Independent Sources
inferred← citeshttps://doi.org/10.1109/focs.2016.26openalex-snapshot
Improved Two-Source Extractors, and Affine Extractors for Polylogarithmic Entropy
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00047openalex-snapshot
Tight Bounds for Classical Open Addressing
inferred← citeshttps://doi.org/10.1109/iadcc.2014.6779398openalex-snapshot
Perfect Hashing Base R-tree for multiple queries
inferred← citeshttps://doi.org/10.1137/0219054openalex-snapshot
The Spatial Complexity of Oblivious k -Probe Hash Functions
inferred← citeshttps://doi.org/10.1137/16m1096219openalex-snapshot
Two-Source Dispersers for Polylogarithmic Entropy and Improved Ramsey Graphs
inferred← citeshttps://doi.org/10.1137/20m1363649openalex-snapshot
Nearly Optimal Static Las Vegas Succinct Dictionary
inferred← citeshttps://doi.org/10.1137/s0097539700369909openalex-snapshot
Low Redundancy in Static Dictionaries with Constant Query Time
inferred← citeshttps://doi.org/10.1137/s0097539705447141openalex-snapshot
Extracting Randomness Using Few Independent Sources
inferred← citeshttps://doi.org/10.1137/s0097539795294165openalex-snapshot
Membership in Constant Time and Almost-Minimum Space
inferred← citeshttps://doi.org/10.1145/1328911.1328913openalex-snapshot
No sorting? better searching!
inferred← citeshttps://doi.org/10.1145/225058.225188openalex-snapshot
Explicit dispersers with polylog degree
inferred← citeshttps://doi.org/10.1145/273865.273915openalex-snapshot
Explicit OR-dispersers with polylogarithmic degree
inferred← citeshttps://doi.org/10.1145/3357713.3384274openalex-snapshot
Nearly optimal static Las Vegas succinct dictionary
inferred← citeshttps://doi.org/10.1145/3717823.3718215openalex-snapshot
Optimal Non-oblivious Open Addressing
inferred← citeshttps://doi.org/10.1145/3717823.3718278openalex-snapshot
Optimal Static Dictionary with Worst-Case Constant Query Time
inferred← citeshttps://doi.org/10.1145/3798129.3800823openalex-snapshot
Greedy Open Addressing Revisited: Beyond Yao’s Lower Bound
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2017.44openalex-snapshot
On-the-Fly Array Initialization in Less Space
inferred← citeshttps://doi.org/10.5555/1496770.1496856openalex-snapshot
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses
inferred← citeshttps://doi.org/10.7146/brics.v2i26.19928openalex-snapshot
Tables should be sorted (on random access machines)
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.