On the public citation graph

Hashing, Load Balancing and Multiple Choice

https://doi.org/10.1561/0400000070
0 signed · 75 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/rsa.20426openalex-snapshot
Sharp load thresholds for cuckoo hashing
inferredcites →https://doi.org/10.1002/rsa.20427openalex-snapshot
Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables
inferredcites →https://doi.org/10.1002/rsa.3240030308openalex-snapshot
Simple Constructions of Almost k‐wise Independent Random Variables
inferredcites →https://doi.org/10.1002/rsa.3240040109openalex-snapshot
Addendum to “simple constructions of almost k‐wise independent random variables”
inferredcites →https://doi.org/10.1006/jcss.1996.0004openalex-snapshot
Randomness is Linear in Space
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-60922-9_46openalex-snapshot
Universal hashing and k-wise independent random variables via integer arithmetic without primes
inferredcites →https://doi.org/10.1007/978-3-540-45172-3_7openalex-snapshot
Simple Load Balancing for Distributed Hash Tables
inferredcites →https://doi.org/10.1007/978-3-642-02927-1_11openalex-snapshot
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
inferredcites →https://doi.org/10.1007/978-3-642-14165-2_19openalex-snapshot
Tight Thresholds for Cuckoo Hashing via XORSAT
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.1007/s00224-004-1195-xopenalex-snapshot
Space Efficient Hash Tables with Worst Case Constant Access Time
inferredcites →https://doi.org/10.1007/s00453-013-9840-xopenalex-snapshot
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash
inferredcites →https://doi.org/10.1007/s004930200021openalex-snapshot
Improved Pseudorandom Generators for Combinatorial Rectangles
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1016/0022-0000(81)90033-7openalex-snapshot
New hash functions and their use in authentication and set equality
inferredcites →https://doi.org/10.1016/0196-6774(86)90019-2openalex-snapshot
A fast and simple randomized parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1016/j.dam.2011.11.009openalex-snapshot
The universality of iterated hashing over variable-length strings
inferredcites →https://doi.org/10.1016/j.jda.2011.12.006openalex-snapshot
Chains-into-bins processes
inferredcites →https://doi.org/10.1016/j.jpdc.2013.10.008openalex-snapshot
Balls into non-uniform bins
inferredcites →https://doi.org/10.1016/j.tcs.2007.02.054openalex-snapshot
Balanced allocation and dictionaries with tightly packed constant size bins
inferredcites →https://doi.org/10.1016/j.tcs.2008.09.023openalex-snapshot
On weighted balls-into-bins games
inferredcites →https://doi.org/10.1016/s0020-0190(02)00500-8openalex-snapshot
Cuckoo hashing: Further analysis
inferredcites →https://doi.org/10.1017/cbo9780511581274openalex-snapshot
Concentration of Measure for the Analysis of Randomized Algorithms
inferredcites →https://doi.org/10.1017/cbo9780511813603openalex-snapshot
Probability and Computing
inferredcites →https://doi.org/10.1017/cbo9780511814075openalex-snapshot
Randomized Algorithms
inferredcites →https://doi.org/10.1017/s096354831400073xopenalex-snapshot
Orientability Thresholds for Random Hypergraphs
inferredcites →https://doi.org/10.1109/focs.2011.49openalex-snapshot
Balls and Bins: Smaller Hash Families and Faster Evaluation
inferredcites →https://doi.org/10.1137/0222053openalex-snapshot
Small-Bias Probability Spaces: Efficient Constructions and Applications
inferredcites →https://doi.org/10.1137/060658400openalex-snapshot
Uniform Hashing in Constant Time and Optimal Space
inferredcites →https://doi.org/10.1137/080728743openalex-snapshot
More Robust Hashing: Cuckoo Hashing with a Stash
inferredcites →https://doi.org/10.1137/090770928openalex-snapshot
An Analysis of Random-Walk Cuckoo Hashing
inferredcites →https://doi.org/10.1137/1.9781611974331.ch111openalex-snapshot
The Power of Two Choices with Simple Tabulation
inferredcites →https://doi.org/10.1137/1.9781611974782.97openalex-snapshot
On the insertion time of random walk cuckoo hashing
inferredcites →https://doi.org/10.1137/1.9781611975482.154openalex-snapshot
Derandomized Balanced Allocation
inferredcites →https://doi.org/10.1137/100797503openalex-snapshot
On the Insertion Time of Cuckoo Hashing
inferredcites →https://doi.org/10.1137/100800774openalex-snapshot
Tabulation-Based 5-Independent Hashing with Applications to Linear Probing and Second Moment Estimation
inferredcites →https://doi.org/10.1137/110827831openalex-snapshot
Linear Probing with 5-wise Independence
inferredcites →https://doi.org/10.1137/s0097539701386216openalex-snapshot
On Universal Classes of Extremely Random Constant-Time Hash Functions
inferredcites →https://doi.org/10.1137/s009753970444435xopenalex-snapshot
Balanced Allocations: The Heavily Loaded Case
inferredcites →https://doi.org/10.1137/s0097539795288490openalex-snapshot
Balanced Allocations
inferredcites →https://doi.org/10.1145/1109557.1109606openalex-snapshot
Balanced allocation on graphs
inferredcites →https://doi.org/10.1145/1323293.1294281openalex-snapshot
Dynamo
inferredcites →https://doi.org/10.1145/324133.324179openalex-snapshot
Linear hash functions
inferredcites →https://doi.org/10.1145/792538.792546openalex-snapshot
How asymmetry helps load balancing
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/964723.383071openalex-snapshot
Chord
inferredcites →https://doi.org/10.1147/rd.12.0130openalex-snapshot
Addressing for Random-Access Storage

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-84252-9_6openalex-snapshot
SSE and SSD: Page-Efficient Searchable Symmetric Encryption
inferred← citeshttps://doi.org/10.1007/978-3-031-31371-4_7openalex-snapshot
Improved Private Set Intersection for Sets with Small Entries
inferred← citeshttps://doi.org/10.1007/978-3-319-78372-7_5openalex-snapshot
Efficient Circuit-Based PSI via Cuckoo Hashing
inferred← citeshttps://doi.org/10.1007/978-981-99-8733-7_6openalex-snapshot
Cuckoo Commitments: Registration-Based Encryption and Key-Value Map Commitments for Large Spaces
inferred← citeshttps://doi.org/10.1007/s00607-024-01324-8openalex-snapshot
Analysis of strategies for scalable transaction creation in blockchains
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.05.004openalex-snapshot
Balanced allocation on hypergraphs
inferred← citeshttps://doi.org/10.1016/j.matcom.2024.08.034openalex-snapshot
An asymptotically optimal algorithm for generating bin cardinalities
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00081openalex-snapshot
Balanced Allocations: The Heavily Loaded Case with Deletions
inferred← citeshttps://doi.org/10.1109/tnet.2019.2957075openalex-snapshot
Load Imbalance and Caching Performance of Sharded Systems
inferred← citeshttps://doi.org/10.1109/wcnc45663.2020.9120531openalex-snapshot
Capacity Analysis of Distributed Computing Systems with Multiple Resource Types
inferred← citeshttps://doi.org/10.1137/1.9781611977073.74openalex-snapshot
Balanced Allocations: Caching and Packing, Twinning and Thinning
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch169openalex-snapshot
Balanced Allocations with Heterogeneous Bins: The Power of Memory
inferred← citeshttps://doi.org/10.1137/22m1541800openalex-snapshot
The Power of Two Choices in Graphical Allocation
inferred← citeshttps://doi.org/10.1137/23m1552231openalex-snapshot
The Power of Filling in Balanced Allocations
inferred← citeshttps://doi.org/10.1145/3179417openalex-snapshot
Asymptotically Optimal Load Balancing Topologies
inferred← citeshttps://doi.org/10.1145/3323165.3323203openalex-snapshot
Parallel Balanced Allocations
inferred← citeshttps://doi.org/10.1145/3456564openalex-snapshot
Enabling Service Cache in Edge Clouds
inferred← citeshttps://doi.org/10.1145/3490148.3538561openalex-snapshot
Brief Announcement
inferred← citeshttps://doi.org/10.1145/3490148.3538593openalex-snapshot
Balanced Allocations in Batches
inferred← citeshttps://doi.org/10.1145/3519270.3538428openalex-snapshot
Balanced Allocations with the Choice of Noise
inferred← citeshttps://doi.org/10.1145/3519935.3519995openalex-snapshot
The power of two choices in graphical allocation
inferred← citeshttps://doi.org/10.1145/3558481.3591088openalex-snapshot
Balanced Allocations in Batches: The Tower of Two Choices
inferred← citeshttps://doi.org/10.1145/3673900openalex-snapshot
An Improved Drift Theorem for Balanced Allocations
inferred← citeshttps://doi.org/10.1145/3689031.3696082openalex-snapshot
Themis: Finding Imbalance Failures in Distributed File Systems via a Load Variance Model
inferred← citeshttps://doi.org/10.1214/18-aap1437openalex-snapshot
Supermarket model on graphs
inferred← citeshttps://doi.org/10.17863/cam.101658openalex-snapshot
The Power of Filling in Balanced Allocations
inferred← citeshttps://doi.org/10.70675/6cfbaf7cz18b4z429dzbef8z5a05dc684a02openalex-snapshot
Constructions of advanced cryptographic primitives
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.