On the public citation graph
Membership in constant time and minimum space
0 signed · 41 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/3-540-55719-9_77openalex-snapshot
Polynomial hash functions are reliable
inferredcites →https://doi.org/10.1007/3-540-56503-5_65openalex-snapshot
The bit probe complexity measure revisited
inferredcites →https://doi.org/10.1007/3-540-56939-1_77openalex-snapshot
Maintaining discrete probability distributions optimally
inferredcites →https://doi.org/10.1007/bfb0032018openalex-snapshot
A new universal class of hash functions and dynamic hashing in real time
inferredcites →https://doi.org/10.1016/0022-0000(85)90014-5openalex-snapshot
A linear-time algorithm for a special case of disjoint set union
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50006-0openalex-snapshot
Machine Models and Simulations
inferredcites →https://doi.org/10.1109/sfcs.1988.21968openalex-snapshot
Dynamic Perfect Hashing: Upper and Lower Bounds
inferredcites →https://doi.org/10.1145/321812.321820openalex-snapshot
Efficient Storage and Retrieval by Content and Address of Static Files
inferredcites →https://doi.org/10.1145/321892.321899openalex-snapshot
The Complexity of Some Simple Retrieval Problems
inferredcites →https://doi.org/10.1145/73007.73040openalex-snapshot
The cell probe complexity of dynamic data structures
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-48523-6_56openalex-snapshot
Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time
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/3-540-63307-3_80openalex-snapshot
Trans-dichotomous algorithms without multiplication — some upper and lower bounds
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_16openalex-snapshot
Approximate Dictionaries
inferred← citeshttps://doi.org/10.1007/978-3-030-59267-7_2openalex-snapshot
Partial Sums on the Ultra-Wide Word RAM
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_86openalex-snapshot
A Simple, Fast, and Compact Static Dictionary
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_5openalex-snapshot
Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_1-2openalex-snapshot
Abelian Hidden Subgroup Problem
inferred← citeshttps://doi.org/10.1007/s00224-012-9425-0openalex-snapshot
Pseudo-Random Graphs and Bit Probe Schemes with One-Sided Error
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00206-5openalex-snapshot
Storing information with extractors
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646100openalex-snapshot
Succinct representation of balanced parentheses, static trees and planar graphs
inferred← citeshttps://doi.org/10.1137/s0097539700369909openalex-snapshot
Low Redundancy in Static Dictionaries with Constant Query Time
inferred← citeshttps://doi.org/10.1137/s0097539795294165openalex-snapshot
Membership in Constant Time and Almost-Minimum Space
inferred← citeshttps://doi.org/10.1145/263105.263133openalex-snapshot
Small forwarding tables for fast routing lookups
inferred← citeshttps://doi.org/10.1145/3626721openalex-snapshot
ChainedFilter: Combining Membership Filters by Chain Rule
inferred← citeshttps://doi.org/10.4018/978-1-4666-2056-8.ch010openalex-snapshot
Timely Autonomic Adaptation of Publish/Subscribe Middleware in Dynamic Environments
inferred← citeshttps://doi.org/10.4018/jaras.2011100101openalex-snapshot
Timely Autonomic Adaptation of Publish/Subscribe Middleware in Dynamic Environments
inferred← citeshttps://doi.org/10.48550/arxiv.1102.5538openalex-snapshot
Pseudo-random graphs and bit probe schemes with one-sided error
inferred← citeshttps://doi.org/10.5296/npa.v2i3.429openalex-snapshot
Integrating Machine Learning Techniques to Adapt Protocols for QoS-enabled Distributed Real-time and Embedded Publish/Subscribe Middleware
inferred← citeshttps://doi.org/10.5555/314613.314845openalex-snapshot
Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries
inferred← citeshttps://doi.org/10.7146/brics.v2i26.19928openalex-snapshot
Tables should be sorted (on random access machines)
inferred← citeshttps://doi.org/10.7146/brics.v4i12.18803openalex-snapshot
Trans-Dichotomous Algorithms without Multiplication —some Upper and Lower Bounds
inferred← citeshttps://doi.org/10.7146/brics.v4i17.18813openalex-snapshot
Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries
inferred← citeshttps://doi.org/10.7146/brics.v5i28.19434openalex-snapshot
Low Redundancy in Dictionaries with O(1) Worst Case Lookup Time
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.