Pith. sign in

REVIEW 3 major objections 3 minor 1 cited by

Quadratic Probing Revisited: Smoothed Analysis and the Fall of Robin Hood

T0 review · 3 major / 3 minor · reviewed 2026-08-02 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Quadratic probing becomes optimal if the least-travelled key wins

desk verdict A serious theory paper with a real fixed-offset result and a genuine smoothing-based separation, but the abstract overclaims a Θ(log ε^{-1}) for smoothed anti-Robin Hood that the body only proves as O. read the letter →

arxiv 2607.13247 v1 pith:TYEG47P5 submitted 2026-07-14 cs.DS

Yang Hu , William Kuszmaul , Jingxun Liang , Stefan Walzer , Huacheng Yu , Renfei Zhou This is my paper · ORCID
classification cs.DS MSC 68P0568P2068W2060C05
keywords quadraticprobinganti-RobinHoodorderingsmoothedanalysisopenaddressingprobabilisticmethodexpectedquerytimehashtable
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to settle a half-century-old question about quadratic probing by changing one design choice: the collision-ordering rule. It argues that when collisions are resolved by favouring the key that has travelled the least (anti-Robin Hood ordering), essentially every quadratic-probing-like scheme achieves the conjectured ideal: expected query time O(log ε⁻¹) and amortized insertion time O(ε⁻¹) at load factor 1−ε. In contrast, the widely used Robin Hood rule, which favours the most-travelled key, provably loses a factor of √ε, with expected query time Θ(ε⁻¹/²) in the smoothed model. The results are obtained through a smoothed variant of quadratic probing and then extended by the probabilistic method to almost every fixed-offset degree-d probing sequence, with the honest caveat that the exact quadratic sequence 0,1,4,9,... remains unanalyzed.

What carries the argument

The argument rests on three pieces. First, a concentration framework for local intervals: in a table with anti-Robin Hood ordering, the number of free slots in any interval of K slots depends only on keys hashing into a nearby window and changes by at most one when a single key is added, yielding exponential tail bounds. Second, a negative-feedback loop: if many keys survive past displacement K, then the K-reveal must contain many free slots in the next interval, and a typical key probes enough of them that the chance it survives to displacement 5K drops by a constant factor; this forces the tail of displacements to decay like K^{-1/2} (degree 2) and yields the O(log ε⁻¹) bound by summing ov

What would settle it

Simulate deterministic quadratic probing (offset sequence 0,1,4,9,16,...) under anti-Robin Hood ordering at load 1−ε for ε = 0.1, 0.01, 0.001 and measure the expected successful-query time. If the growth is closer to ε⁻¹/² rather than log ε⁻¹, the smoothed-versus-deterministic transfer fails. Conversely, finding one degree-2 fixed-offset sequence for which the expected query time grows faster than O(log ε⁻¹) would contradict the 'almost every' claim of Theorem 3.3.

Watch

Extended reading notes

Core claim

The central claim is that anti-Robin Hood ordering rescues quadratic-style probing. For random fixed-offset degree-d probing with d≥2, the paper proves (Theorem 3.3) that with probability 1−δ over the choice of the shared offset sequence, the resulting table supports worst-case expected query time O(log ε⁻¹) simultaneously for every table size n and every slack ε above a logarithmic threshold, with amortized insertion time O(ε⁻¹). This matches the long-conjectured performance of quadratic probing and is best possible for any fixed-offset anti-Robin Hood table. Separately, for smoothed degree-d probing with Robin Hood ordering (Theorem 4.1), the paper proves expected displacement O(ε⁻¹) and e

Load-bearing premise

The paper's headline separation—Robin Hood falling to Θ(ε⁻¹/²) while anti-Robin Hood reaches O(log ε⁻¹)—is proved in a smoothed model in which each key independently samples its offsets, and the exact quadratic probing sequence remains unanalyzed; if that smoothed model is not a faithful proxy, the separation may not transfer to actual quadratic probing.

Editorial extensions

If this is right

  • There exist concrete quadratic-probing-like hash tables with provably optimal O(log ε⁻¹) expected query time and O(ε⁻¹) amortized insertion time at load 1−ε, under anti-Robin Hood ordering.
  • Since the bound is tight for any fixed-offset anti-Robin Hood scheme, degree 2 is the smallest probing degree that fully escapes linear-probing clustering.
  • Robin Hood ordering is shown to be the wrong choice for quadratic-style probing: it provably degrades query time to Θ(ε⁻¹/²) in the smoothed model.
  • The smoothed analysis identifies smoothed quadratic anti-Robin Hood probing as the best scheme among the considered options, and motivates studying it further.
  • If the smoothed model faithfully reflects real quadratic probing, the long-conjectured O(log ε⁻¹) behavior is not only plausible but generic among nearby probe sequences.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A testable consequence: in simulation, deterministic quadratic probing (offsets 1,4,9,...) with anti-Robin Hood ordering should show near-logarithmic expected successful query times at high load; if it instead exhibits Θ(ε⁻¹/²) scaling, the smoothed model is not a faithful proxy.
  • The negative-feedback-loop mechanism is not tied to polynomial offsets; it may transfer to other structured probe families, potentially yielding optimal anti-Robin Hood tables with even more cache-friendly offsets.
  • The probabilistic-method result suggests an explicit derandomization problem: construct a single fixed-offset degree-2 sequence, ideally as close to squares as possible, that provably satisfies the O(log ε⁻¹) bound.
  • The Robin Hood frontier process could be reused to analyze other history-independent insertion policies where the priority rule is monotone in displacement.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 3 minor

Summary. The paper revisits quadratic probing through two randomized models: smoothed degree-d probing, where each key activates positive offset k independently with probability k^{-(d-1)/d}, and random fixed-offset degree-d probing, where all keys share a single random offset sequence r_j drawn uniformly from [αj^d, α(j+1)^d). The main formal results are: (i) for anti-Robin Hood ordering, an expected query-time upper bound O(log ε^{-1}) for d ≥ 2 and O(ε^{1-2/d}) for d < 2 at load 1−ε, including a simultaneous-all-(n,ε) version for fixed-offset sequences (Theorem 3.3); (ii) for Robin Hood ordering in smoothed probing, E[disp(x)] = O(ε^{-1}) and E[pc(x)] = O(ε^{-1/d}) (Theorem 4.1); and (iii) lower bounds, including a total-displacement lower bound, a smoothed Robin Hood lower bound Ω(ε^{-1/d}), and a logarithmic lower bound Ω(log ε^{-1}) for every fixed-offset anti-Robin Hood scheme (Theorem 5.4). The abstract goes further and claims Θ(log ε^{-1}) for smoothed anti-Robin Hood, but the body proves only O(log ε^{-1}) in that model; the matching lower bound is proved only for fixed-offset schemes.

Significance. If the main claims are correct, this is a substantial advance on a half-century-old problem. In particular, Theorem 3.3 gives, via the probabilistic method, fixed-offset polynomial probing sequences that, under anti-Robin Hood ordering, achieve the conjectured-optimal O(log ε^{-1}) expected query time simultaneously over all admissible load factors and table sizes, and Theorem 5.4 shows this is optimal among all fixed-offset anti-Robin Hood schemes. The proof machinery—local concentration bounds, the negative-feedback loop for short displacements, the drift/coupling arguments, the Robin Hood frontier process, and the technique of deriving lower bounds from upper-tail estimates—is original and is presented in considerable detail. The fixed-offset results and the Robin Hood lower bounds appear well supported. The paper is also careful to separate what is proved from what remains open for the exact quadratic sequence, although some headline phrasing blurs this distinction. The main issues are that the abstract and parts of the introduction overclaim the smoothed anti-Robin Hood Θ result, and one insertion-time corollary is internally inconsistent with the paper's own query-time bound.

major comments (3)
  1. [Abstract, Section 1.1, Table 1, Corollary 3.18, Theorem 5.4] The abstract states that smoothed quadratic probing with anti-Robin Hood ordering achieves expected query time Θ(log ε^{-1}), and Section 1.1 says the smoothed degree-d tradeoffs are tight for d ≤ 2. The body does not prove this. Corollary 3.18 gives only O(log ε^{-1}) for smoothed degree-d anti-Robin Hood, and Table 1 correctly lists O, not Θ, for this row. The matching lower bound, Theorem 5.4, is proved only for fixed-offset schemes, where all keys share one increasing offset sequence and the proof uses a synchronous round structure plus Harris's inequality on monotone events in the shared sequence; neither ingredient transfers to the per-key independent activation model of smoothed probing. Consequently the Θ(log ε^{-1}) claim for the smoothed model is an overclaim, and the claim that the tradeoffs are tight for d ≤ 2 in the smoothed setting is not supported by Corollary 5.3 or Corol
  2. [Section 4, Corollary 4.2, Eq. (1), Table 1] Corollary 4.2 states that the amortized expected insertion time under Robin Hood smoothed degree-d probing is O(ε^{-1}). This is inconsistent with Theorem 4.1, which gives E[pc(x)] = O(ε^{-1/d}), and with the paper's own conversion rule (1), f(ε) = -d/dε g(ε). If g(ε) = E[pc] = Θ(ε^{-1/d}), the derivative is Θ(ε^{-1-1/d}), not Θ(ε^{-1}); if one differentiates E[disp] = Θ(ε^{-1}), one gets Θ(ε^{-2}). Table 1 and the introduction correctly list Θ(ε^{-1-1/d}) (e.g., Θ(ε^{-3/2}) for d = 2). Corollary 4.2 as written is therefore an error and should be corrected to Θ(ε^{-1-1/d}).
  3. [Section 1.1, Abstract] The framing of the 'Fall of Robin Hood' as a statement about quadratic probing itself is stronger than what is proven. The separation between Robin Hood and anti-Robin Hood is proven in the smoothed model (Theorem 4.1 and Corollary 3.18), and the anti-Robin Hood optimality for fixed-offset schemes is proven in Theorem 5.4, but the exact quadratic probe sequence remains unanalyzed. The paper is admirably explicit about this in the abstract and Section 1.1, yet the title and the introductory discussion of questions (1)–(3) present the conclusions as answers for quadratic probing. This should be rephrased so that the model dependence is prominent in the headline statements, not only in the technical sections.
minor comments (3)
  1. [Section 1.1, first bullet] The statement that stable degree-d probing takes Ω(ε^{-1}) time for negative queries is asserted without proof or citation. If it is a known result, a reference should be supplied; if it is a folklore fact, a one-sentence argument would help.
  2. [Table 1] The table is internally consistent with the body, but it would be helpful to mark explicitly which rows are Θ and which are only O for the smoothed anti-Robin Hood model, given the discrepancy between the abstract and Table 1.
  3. [Section 5.1, Lemma 5.1] The proof of (26) is terse for the case of ε bounded away from zero. It is true that a positive constant lower bound holds, but the exposition would be clearer if the Poisson approximation were used directly, or if the constant were tracked explicitly.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found: the main bounds are proved from explicit stochastic lemmas, and self-citations are contextual only.

full rationale

The paper's derivation chain is self-contained and does not reduce any claimed prediction to its inputs. The anti-Robin Hood upper bounds are built from explicit concentration inequalities (Proposition 3.5), a negative-feedback displacement lemma (Lemma 3.9), and a long-displacement tail lemma (Lemma 3.14); Theorem 3.3 then follows from the drift inequality (Lemma 3.16) applied to these estimates. The Robin Hood upper bounds are derived independently through the frontier process (Lemma 4.6) and a transfer between Poissonized, right-unbounded, and cyclic models. The lower bounds in Section 5 use an ordering-independent total-displacement lower bound (Lemma 5.1) and then truncate first moments using upper-tail estimates that were already proved earlier in the paper; this is a standard and legitimate use of proven upper bounds, not a circular reliance on the conclusion. Theorem 5.4 gives a standalone lower bound for all fixed-offset anti-Robin Hood schemes. No parameter is fitted to data and then renamed as a prediction, and no central premise is imported from a self-citation. The only notable internal inconsistency is that the abstract claims a matching Θ(log ε^{-1}) for smoothed anti-Robin Hood while the body proves only O(log ε^{-1}) and Table 1 correctly states O; this is a correctness/consistency issue, not circularity. Self-citations such as [KX24] are used only to describe background state of the art and do not support any new theorem. Accordingly, the circularity score is 0.

Assumptions & free parameters 0 free parameters · 4 assumptions · 2 invented entities

The central results rest on two model definitions (smoothed and random fixed-offset degree-d probing), the standard fully-random-hash assumption, and Poissonization. No free parameters are fitted to data; the constants α, C_fin, C_sim, C*, k0 are universal constants in proofs, and ε, n, d are inputs. The new models are concrete and implementable, so they are not unexplained postulates.

assumptions (4)
  • domain assumption The base hash function h: [U]→[n] is uniformly random and fully independent.
    Standard assumption in open-addressing analysis; used throughout (Section 2 Preliminaries). Without it none of the probabilistic arguments hold.
  • ad hoc to paper Smoothed degree-d probing: each key includes each positive offset k independently with activation probability p(k)=k^{-(d-1)/d} (Definition 2.2).
    This defines the smoothed model; it is a designed model, not derived, and is the object of the RH analysis and Corollary 3.18.
  • ad hoc to paper Random fixed-offset degree-d probing: offsets r_j sampled uniformly from [αj^d, α(j+1)^d) for a fixed α>0 (Definition 2.3).
    Defines the concrete probe sequences; the bulk of Section 3 analyzes this model. The results are stated for this distribution, not for all polynomial offsets.
  • standard math Poissonization and fixed-load transfer (Lemma 4.4 and the Poissonized model in Section 3.2).
    Used to decouple home-position counts; transfer to fixed load via coupling and constant-probability events. Standard technique.
invented entities (2)
  • Smoothed degree-d probing independent evidence
    purpose: A randomized probe-sequence model in which each key's offset sequence is a random subset with activation probability k^{-(d-1)/d}, used as a tractable proxy for deterministic polynomial probing.
    It is a defined data structure with falsifiable query-time predictions, not a metaphysical entity; the paper also proves a separate concrete result for fixed-offset sequences, so the overall conclusions do not hang on this entity alone.
  • Random fixed-offset degree-d probing independent evidence
    purpose: A concrete family of probe sequences sharing one random offset sequence; the paper proves almost every such sequence is optimal under anti-RH.
    A concrete scheme whose existence is established by the probabilistic method; it can be instantiated and tested, so it carries independent falsifiable predictions.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Quadratic Probing Revisited: Smoothed Analysis and the Fall of Robin Hood." pith.science (2026). https://pith.science/paper/TYEG47P5

@misc{pith2026260713247,
  author       = {Pith},
  title        = {Pith review of: Quadratic Probing Revisited: Smoothed Analysis and the Fall of Robin Hood},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/TYEG47P5}},
  note         = {Machine review of arXiv:2607.13247}
}
abstract

Quadratic probing is one of the most widely used open-addressing hash-table schemes in practice, but after more than half a century, even its most basic performance guarantees remain poorly understood. In this paper, we revisit quadratic probing through the lens of a smoothed variant in which each key follows a random probe sequence where its $k$th probe is expected at offset $\Theta(k^2)$. This is simultaneously a toy model for better understanding regular quadratic probing and a natural hashing scheme in its own right. We analyse smoothed quadratic probing for both Robin Hood ordering and anti-Robin Hood ordering and reveal a surprising separation: At load factor $1-\varepsilon$, anti-Robin Hood achieves an expected query time of $\Theta(\log \varepsilon^{-1})$, which matches the conjectured expected average successful query time for regular quadratic probing, while Robin Hood falls short at $\Theta(\varepsilon^{-1/2})$. Our analysis generalises to degree-$d$ probing for any $d \ge 1$ with expected query time $O(\max(\log \varepsilon^{-1}, \varepsilon^{1-2/d}))$ for anti-Robin Hood and $\Theta(\varepsilon^{-1/d})$ for Robin Hood. Finally, we go beyond smoothed analysis: using the probabilistic method, we show that for every $d \ge 2$, almost every random fixed-offset degree-$d$ probing sequence achieves expected query time $O(\log \varepsilon^{-1})$ under anti-Robin Hood ordering, simultaneously over all admissible table sizes and load factors. Thus, while quadratic probing itself remains elusive, we prove that essentially all quadratic-probing-like fixed-offset schemes achieve the ideal performance under the anti-Robin Hood ordering.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Simple Analysis of Quadratic Probing and Other Open Addressing Schemes

    cs.DS 2026-08 conditional novelty 7.0 of 10

    Fixed-offset open addressing has constant expected insertion cost at load factor up to 35.74%, and quadratic probing up to 37.61%.

Reference graph

Works this paper leans on

142 extracted references · 1 linked inside Pith · cited by 1 Pith paper

  1. [1]

    Bender, Mart \' i n Farach-Colton, Rotem Oshman, and Noa Schiller

    Hagit Attiya, Michael A. Bender, Mart \' i n Farach-Colton, Rotem Oshman, and Noa Schiller. History-independent concurrent hash tables, 2025

    2025

  2. [2]

    Ordered hash tables

    Ole Amble and Donald Ervin Knuth. Ordered hash tables. The Computer Journal , 17(2):135--142, January 1974

    1974

  3. [3]

    De-amortized cuckoo hashing: Provable worst-case performance and experimental results

    Yuriy Arbitman, Moni Naor, and Gil Segev. De-amortized cuckoo hashing: Provable worst-case performance and experimental results. In International Colloquium on Automata, Languages, and Programming , pages 107--118. Springer, 2009

    2009

  4. [4]

    Backyard cuckoo hashing: constant worst-case operations with a succinct representation

    Yuriy Arbitman, Moni Naor, and Gil Segev. Backyard cuckoo hashing: constant worst-case operations with a succinct representation. In Proc. 51st IEEE Symposium on Foundations of Computer Science (FOCS) , pages 787--796, 2010

    2010

  5. [5]

    Locally uniform hashing

    Ioana O Bercea, Lorenzo Beretta, Jonas Klausen, Jakob B k Tejs Houen, and Mikkel Thorup. Locally uniform hashing. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages 1440--1470. IEEE, 2023

    2023

  6. [6]

    Bender, Alex Conway, Mart \'i n Farach-Colton , William Kuszmaul, and Guido Tagliavini

    Michael A. Bender, Alex Conway, Mart \'i n Farach-Colton , William Kuszmaul, and Guido Tagliavini. Iceberg hashing: optimizing many hash-table criteria at once. Journal of the ACM , 70(6), November 2023

    2023

  7. [7]

    O(1) insertion for random walk d-ary cuckoo hashing up to the load threshold

    Tolson Bell and Alan Frieze. O(1) insertion for random walk d-ary cuckoo hashing up to the load threshold. In 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) , pages 106--119. IEEE, 2024

    2024

  8. [8]

    Bender, Mart \'i n Farach-Colton , John Kuszmaul, and William Kuszmaul

    Michael A. Bender, Mart \'i n Farach-Colton , John Kuszmaul, and William Kuszmaul. Modern hashing made simple. In Proc. 7th Symposium on Simplicity in Algorithms (SOSA) , pages 363--373, 2024

    2024

Show all 142 references
  1. [9]

    IBM's early computers

    Charles J Bashe, Lyle R Johnson, John H Palmer, and Emerson W Pugh. IBM's early computers . MIT press, 1986

    1986

  2. [10]

    Tight analyses of ordered and unordered linear probing

    Mark Braverman and William Kuszmaul. Tight analyses of ordered and unordered linear probing. In 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) , pages 606--635. IEEE, 2024

    2024

  3. [11]

    Linear probing revisited: Tombstones mark the demise of primary clustering

    Michael A Bender, Bradley C Kuszmaul, and William Kuszmaul. Linear probing revisited: Tombstones mark the demise of primary clustering. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) , pages 1171--1182. IEEE, 2022

    2021

  4. [12]

    Tight bounds for classical open addressing

    Michael A Bender, William Kuszmaul, and Renfei Zhou. Tight bounds for classical open addressing. In 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) , pages 636--657. IEEE, 2024

    2024

  5. [13]

    Optimal non-oblivious open addressing

    Michael A Bender, William Kuszmaul, and Renfei Zhou. Optimal non-oblivious open addressing. In Proceedings of the 57th Annual ACM Symposium on Theory of Computing , pages 268--277, 2025

    2025

  6. [14]

    Reducing the retrieval time of scatter storage techniques

    Richard P Brent. Reducing the retrieval time of scatter storage techniques. Communications of the ACM , 16(2):105--109, 1973

    1973

  7. [15]

    Robin hood hashing

    Pedro Celis. Robin hood hashing . University of Waterloo, 1986

    1986

  8. [16]

    Learn hash table the hard way -- part 1: Probe distributions

    Felix Chern. Learn hash table the hard way -- part 1: Probe distributions. https://web.archive.org/web/20170710154109/https://www.idryman.org/blog/2017/07/04/learn-hash-table-the-hard-way/, July 2017. Archived by the Internet Archive on 2017-07-10. Original URL: https://www.id...

    2017

  9. [17]

    Ian Munro

    Pedro Celis, Per - ke Larson, and J. Ian Munro. Robin Hood hashing (preliminary report). In 26th Annual Symposium on Foundations of Computer Science (FOCS'85) , pages 281--288, Portland, Oregon, USA, 21--23 October 1985

    1985

  10. [18]

    Dynamic perfect hashing: Upper and lower bounds

    Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer Auf Der Heide, Hans Rohnert, and Robert E Tarjan. Dynamic perfect hashing: Upper and lower bounds. SIAM Journal on Computing , 23(4):738--761, 1994

    1994

  11. [19]

    Hashing for statistics over k-partitions

    S ren Dahlgaard, Mathias B k Tejs Knudsen, Eva Rotenberg, and Mikkel Thorup. Hashing for statistics over k-partitions. In 2015 IEEE 56th Annual Symposium on Foundations of Computer Science , pages 1292--1310. IEEE, 2015

    2015

  12. [20]

    Applications of a splitting trick

    Martin Dietzfelbinger and Michael Rink. Applications of a splitting trick. In International Colloquium on Automata, Languages, and Programming , pages 354--365. Springer, 2009

    2009

  13. [21]

    Balanced allocation and dictionaries with tightly packed constant size bins

    Martin Dietzfelbinger and Christoph Weidling. Balanced allocation and dictionaries with tightly packed constant size bins. Theoretical Computer Science , 380(1):47--68, 2007

    2007

  14. [22]

    Goodrich, Michael Mitzenmacher, and Pawe Pszona

    David Eppstein, Michael T. Goodrich, Michael Mitzenmacher, and Pawe Pszona. Wear minimization for cuckoo hashing: How not to throw a lot of eggs into one basket. Proceedings of the International Symposium on Experimental Algorithms (SEA) , pages 162--173, 2014

    2014

  15. [23]

    Optimal bounds for open addressing without reordering

    Mart \' n Farach-Colton, Andrew Krapivin, and William Kuszmaul. Optimal bounds for open addressing without reordering. In 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) , pages 594--605. IEEE, 2024

    2024

  16. [24]

    On the insertion time of random walk cuckoo hashing

    Alan Frieze and Tony Johansson. On the insertion time of random walk cuckoo hashing. Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 1497--1502, 2017

    2017

  17. [25]

    An analysis of random-walk cuckoo hashing

    Alan Frieze, P\'all Melsted, and Michael Mitzenmacher. An analysis of random-walk cuckoo hashing. Proceedings of the 2009 International Conference on Randomization and Computation (RANDOM) , 2009

    2009

  18. [26]

    Implicit O(1) probe search

    Amos Fiat and Moni Naor. Implicit O(1) probe search. SIAM Journal on Computing , 22(1):1--10, 1993

    1993

  19. [27]

    Non-oblivious hashing

    Amos Fiat, Moni Naor, Jeanette Schmidt, and Alan Siegel. Non-oblivious hashing. In Proc. 20th ACM Symposium on Theory of Computing (STOC) , pages 367--376, 1988

    1988

  20. [28]

    Balanced allocation through random walk

    Alan Frieze and Samantha Petti. Balanced allocation through random walk. Information Processing Letters , 131:39--43, 2018

    2018

  21. [29]

    On the insertion time of cuckoo hashing

    Nikolaos Fountoulakis, Konstantinos Panagiotou, and Angelika Steger. On the insertion time of cuckoo hashing. SIAM Journal on Computing , 42(6):2156--2181, 2013

    2013

  22. [30]

    Spirakis

    Dimitris Fotakis, Rasmus Pagh, Peter Sanders, and Paul G. Spirakis. Space efficient hash tables with worst case constant access time. Theory of Computing Systems , 38(2):229--248, 2005

    2005

  23. [31]

    Cache-oblivious dictionaries and multimaps with negligible failure probability

    Michael T Goodrich, Daniel S Hirschberg, Michael Mitzenmacher, and Justin Thaler. Cache-oblivious dictionaries and multimaps with negligible failure probability. In Mediterranean Conference on Algorithms , pages 203--218. Springer, 2012

    2012

  24. [32]

    David Gale and Lloyd S. Shapley. College admissions and the stability of marriage. The American Mathematical Monthly , 69(1):9--15, 1962

    1962

  25. [33]

    The analysis of double hashing

    Leo J Guibas and Endre Szemeredi. The analysis of double hashing. In Proceedings of the eighth annual ACM symposium on Theory of computing , pages 187--191, 1976

    1976

  26. [34]

    The analysis of double hashing

    Leo J Guibas and Endre Szemeredi. The analysis of double hashing. Journal of Computer and System Sciences , 16(2):226--274, 1978

    1978

  27. [35]

    Theodore E. Harris. A lower bound for the critical probability in a certain percolation process. Mathematical Proceedings of the Cambridge Philosophical Society , 56(1):13--20, 1960

    1960

  28. [36]

    The quadratic hash method when the table size is a power of 2

    F Robert A Hopgood and J Davenport. The quadratic hash method when the table size is a power of 2. The Computer Journal , 15(4):314--315, 1972

    1972

  29. [37]

    John William Hatfield and Paul R. Milgrom. Matching with contracts. American Economic Review , 95(4):913--935, 2005

    2005

  30. [38]

    Fundamentals of data structures in C

    Ellis Horowitz, Sartaj Sahni, and Susan Anderson-Freed. Fundamentals of data structures in C . WH Freeman & Co., 1992

    1992

  31. [39]

    305 RAMAC Programmer's Guide , December 1958

    International Business Machines Corporation . 305 RAMAC Programmer's Guide , December 1958. 12/58 printing

    1958

  32. [40]

    The cubic search method

    Romuald Jagielski. The cubic search method. In International Symposium on Mathematical Foundations of Computer Science , pages 372--376. Springer, 1976

    1976

  33. [41]

    A faster algorithm for cuckoo insertion and bipartite matching in large graphs

    Megha Khosla and Avishek Anand. A faster algorithm for cuckoo insertion and bipartite matching in large graphs. Algorithmica , 81(9):3707--3724, 2019

    2019

  34. [42]

    Efficient d-ary cuckoo hashing at high load factors by bubbling up

    William Kuszmaul and Michael Mitzenmacher. Efficient d-ary cuckoo hashing at high load factors by bubbling up. Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 3931--3952, 2025

    2025

  35. [43]

    More robust hashing: Cuckoo hashing with a stash

    Adam Kirsch, Michael Mitzenmacher, and Udi Wieder. More robust hashing: Cuckoo hashing with a stash. SIAM Journal on Computing , 39(4):1543--1561, 2010

    2010

  36. [44]

    Notes on “open” addressing

    Donald E Knuth. Notes on “open” addressing. Unpublished memorandum , 1962

    1962

  37. [45]

    The Art of Computer Programming: Volume 3: Sorting and Searching

    Donald E Knuth. The Art of Computer Programming: Volume 3: Sorting and Searching . Addison-Wesley Professional, 1998

    1998

  38. [46]

    A hash table without hash functions, and how to get the most out of your random bits

    William Kuszmaul. A hash table without hash functions, and how to get the most out of your random bits. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) , pages 991--1001. IEEE, 2022

    2022

  39. [47]

    Towards an analysis of quadratic probing

    William Kuszmaul and Zoe Xi. Towards an analysis of quadratic probing. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024) , pages 103--1. Schloss Dagstuhl--Leibniz-Zentrum f \"u r Informatik, 2024

    2024

  40. [48]

    Data structures and algorithms in Java

    Robert Lafore. Data structures and algorithms in Java . Sams publishing, 2017

    2017

  41. [49]

    Tight cell-probe lower bounds for dynamic succinct dictionaries

    Tianxiao Li, Jingxun Liang, Huacheng Yu, and Renfei Zhou. Tight cell-probe lower bounds for dynamic succinct dictionaries. In Proc. 64th IEEE Symposium on Foundations of Computer Science (FOCS) , pages 1842--1862, 2023

    2023

  42. [50]

    Dynamic dictionary with subconstant wasted bits per key

    Tianxiao Li, Jingxun Liang, Huacheng Yu, and Renfei Zhou. Dynamic dictionary with subconstant wasted bits per key. In Proc. 35th ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 171--207, 2024

    2024

  43. [51]

    More analysis of double hashing

    George Lueker and Mariko Molodowitch. More analysis of double hashing. In Proceedings of the twentieth annual ACM symposium on Theory of computing , pages 354--359, 1988

    1988

  44. [52]

    More analysis of double hashing

    George S Lueker and Mariko Molodowitch. More analysis of double hashing. Combinatorica , 13(1):83--96, 1993

    1993

  45. [53]

    Succinct filters for sets of unknown sizes

    Mingmou Liu, Yitong Yin, and Huacheng Yu. Succinct filters for sets of unknown sizes. In Proc. 47th International Colloquium on Automata, Languages and Programming (ICALP) , pages 79:1--79:19, 2020

    2020

  46. [54]

    Programming technique: An improved hash code for scatter storage

    Ward Douglas Maurer. Programming technique: An improved hash code for scatter storage. Communications of the ACM , 11(1):35--38, 1968

    1968

  47. [55]

    Techniques for collision resolution in hash tables with open addressing

    J Ian Munro and Pedro Celis. Techniques for collision resolution in hash tables with open addressing. In FJCC , pages 601--610, 1986

    1986

  48. [56]

    Peeling arguments and double hashing

    Michael Mitzenmacher and Justin Thaler. Peeling arguments and double hashing. In 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton) , pages 1118--1125. IEEE, 2012

    2012

  49. [57]

    Data structures and algorithms using Python

    Rance D Necaise. Data structures and algorithms using Python . Wiley Publishing, 2010

    2010

  50. [58]

    Uniform hashing in constant time and linear space

    Anna \" O stlin and Rasmus Pagh. Uniform hashing in constant time and linear space. In Lawrence L. Larmore and Michel X. Goemans, editors, Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003), June 9--11, 2003, San Diego, CA, USA , pages 622--628. ACM, 2003

    2003

  51. [59]

    Low redundancy in static dictionaries with o (1) worst case lookup time

    Rasmus Pagh. Low redundancy in static dictionaries with o (1) worst case lookup time. In Proceedings of the 26th International Colloquium on Automata, Languages and Programming , pages 595--604, 1999

    1999

  52. [60]

    Addressing for random-access storage

    W Wesley Peterson. Addressing for random-access storage. IBM journal of Research and Development , 1(2):130--146, 1957

    1957

  53. [61]

    Uniform hashing in constant time and optimal space

    Anna Pagh and Rasmus Pagh. Uniform hashing in constant time and optimal space. SIAM Journal on Computing , 38(1):85--96, 2008

    2008

  54. [62]

    Cuckoo hashing

    Rasmus Pagh and Flemming Friche Rodler. Cuckoo hashing. Journal of Algorithms , 51(2):122--144, 2004

    2004

  55. [63]

    Succinct dynamic dictionaries and trees

    Rajeev Raman and Srinivasa Rao Satti. Succinct dynamic dictionaries and trees. In Proc. 30th International Colloquium on Automata, Languages and Programming (ICALP) , pages 357--368, 2003

    2003

  56. [64]

    On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications (extended abstract)

    Alan Siegel. On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications (extended abstract). In 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1...

    1989

  57. [65]

    On universal classes of extremely random constant time hash functions and their time-space tradeoff

    Alan Siegel. On universal classes of extremely random constant time hash functions and their time-space tradeoff. Technical Report TR1995-684, Computer Science Department, New York University, April 1995. Month (April) commonly cited in later bibliographies

    1995

  58. [66]

    On universal classes of extremely random constant-time hash functions

    Alan Siegel. On universal classes of extremely random constant-time hash functions. SIAM Journal on Computing , 33(3):505--543, 2004

    2004

  59. [67]

    Simple tabulation, fast expanders, double tabulation, and high independence

    Mikkel Thorup. Simple tabulation, fast expanders, double tabulation, and high independence. In 2013 IEEE 54th Annual Symposium on Foundations of Computer Science , pages 90--99. IEEE, 2013

    2013

  60. [68]

    \' E tude critique de la notion de collectif

    Jean Ville. \' E tude critique de la notion de collectif . Monographies des probabilit\' e s. Gauthier-Villars, Paris, 1939

    1939

  61. [69]

    Insertion time of random walk cuckoo hashing below the peeling threshold

    Stefan Walzer. Insertion time of random walk cuckoo hashing below the peeling threshold. Proceedings of the 30th Annual European Symposium on Algorithms (ESA) , 244(87):1--11, 2022

    2022

  62. [70]

    Data Structures and Algorithm Analysis in C++

    Mark Allen Weiss. Data Structures and Algorithm Analysis in C++ . Pearson, 4 edition, 2014

    2014

  63. [71]

    Uniform hashing is optimal

    Andrew C Yao. Uniform hashing is optimal. Journal of the ACM (JACM) , 32(3):687--693, 1985

    1985

  64. [72]

    Journal of Algorithms , volume=

    Cuckoo hashing , author=. Journal of Algorithms , volume=. 2004 , publisher=

    2004

  65. [73]

    2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton) , pages=

    Peeling arguments and double hashing , author=. 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton) , pages=. 2012 , organization=

    2012

  66. [74]

    Proceedings of the eighth annual ACM symposium on Theory of computing , pages=

    The analysis of double hashing , author=. Proceedings of the eighth annual ACM symposium on Theory of computing , pages=

  67. [75]

    Journal of Computer and System Sciences , volume=

    The analysis of double hashing , author=. Journal of Computer and System Sciences , volume=. 1978 , publisher=

    1978

  68. [76]

    Proceedings of the twentieth annual ACM symposium on Theory of computing , pages=

    More analysis of double hashing , author=. Proceedings of the twentieth annual ACM symposium on Theory of computing , pages=

  69. [77]

    Combinatorica , volume=

    More analysis of double hashing , author=. Combinatorica , volume=. 1993 , publisher=

    1993

  70. [78]

    2017 , publisher=

    Data structures and algorithms in Java , author=. 2017 , publisher=

    2017

  71. [79]

    2010 , publisher=

    Data structures and algorithms using Python , author=. 2010 , publisher=

    2010

  72. [80]

    1992 , publisher=

    Fundamentals of data structures in C , author=. 1992 , publisher=

    1992

  73. [81]

    International Symposium on Mathematical Foundations of Computer Science , pages=

    The cubic search method , author=. International Symposium on Mathematical Foundations of Computer Science , pages=. 1976 , organization=

    1976

  74. [82]

    2017 , month = jul, day =

    Chern, Felix , title =. 2017 , month = jul, day =

    2017

  75. [83]

    2014 , isbn =

    Weiss, Mark Allen , title =. 2014 , isbn =

    2014

  76. [84]

    Communications of the ACM , volume=

    Programming technique: An improved hash code for scatter storage , author=. Communications of the ACM , volume=. 1968 , publisher=

    1968

  77. [85]

    51st International Colloquium on Automata, Languages, and Programming (ICALP 2024) , pages=

    Towards an Analysis of Quadratic Probing , author=. 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024) , pages=. 2024 , organization=

    2024

  78. [86]

    The Computer Journal , volume=

    The quadratic hash method when the table size is a power of 2 , author=. The Computer Journal , volume=. 1972 , publisher=

    1972

  79. [87]

    1986 , publisher=

    Robin hood hashing , author=. 1986 , publisher=

    1986

  80. [88]

    1958 , month = dec, type =

    1958

  81. [89]

    , title =

    Gale, David and Shapley, Lloyd S. , title =. The American Mathematical Monthly , volume =. 1962 , doi =

    1962

  82. [90]

    , title =

    Hatfield, John William and Milgrom, Paul R. , title =. American Economic Review , volume =. 2005 , doi =

    2005

  83. [91]

    and Farach-Colton, Mart

    Attiya, Hagit and Bender, Michael A. and Farach-Colton, Mart. History-Independent Concurrent Hash Tables , year =. 2503.21016 , archiveprefix =

    arXiv

  84. [92]

    Ordered hash tables , volume = 17, year = 1974, bdsk-url-1 =

    Amble, Ole and Knuth, Donald Ervin , doi =. Ordered hash tables , volume = 17, year = 1974, bdsk-url-1 =. The Computer Journal , month = JAN, number = 2, pages =

    1974

  85. [93]

    26th Annual Symposium on Foundations of Computer Science (FOCS'85) , doi =

    Pedro Celis and Per. 26th Annual Symposium on Foundations of Computer Science (FOCS'85) , doi =. 1985 , bdsk-url-1 =

    1985

  86. [94]

    IBM journal of Research and Development , volume=

    Addressing for random-access storage , author=. IBM journal of Research and Development , volume=. 1957 , publisher=

    1957

  87. [95]

    1986 , publisher=

    IBM's early computers , author=. 1986 , publisher=

    1986

  88. [96]

    Unpublished memorandum , year=

    Notes on “open” addressing , author=. Unpublished memorandum , year=

  89. [97]

    1998 , publisher=

    The Art of Computer Programming: Volume 3: Sorting and Searching , author=. 1998 , publisher=

    1998

  90. [98]

    Ville, Jean , title =

  91. [99]

    , title =

    Harris, Theodore E. , title =. Mathematical Proceedings of the Cambridge Philosophical Society , volume =. 1960 , doi =

    1960

  92. [100]

    , TITLE =

    Fotakis, Dimitris and Pagh, Rasmus and Sanders, Peter and Spirakis, Paul G. , TITLE =. Theory of Computing Systems , PUBLISHER =. 2005 , NUMBER =

    2005

  93. [101]

    Proceedings of the 30th Annual European Symposium on Algorithms (ESA) , pages =

    Walzer, Stefan , title =. Proceedings of the 30th Annual European Symposium on Algorithms (ESA) , pages =. 2022 , volume =. doi:10.4230/LIPIcs.ESA.2022.87 , annote =

    2022 doi

  94. [102]

    Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , year =

    Frieze, Alan and Johansson, Tony , title =. Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , year =

    2017

  95. [103]

    SIAM Journal on Computing , volume =

    Fountoulakis, Nikolaos and Panagiotou, Konstantinos and Steger, Angelika , title =. SIAM Journal on Computing , volume =. 2013 , doi =

    2013

  96. [104]

    An Analysis of Random-Walk Cuckoo Hashing , journal=

    Alan Frieze and P\'all Melsted and Michael Mitzenmacher , year=. An Analysis of Random-Walk Cuckoo Hashing , journal=

  97. [105]

    A Faster Algorithm for Cuckoo Insertion and Bipartite Matching in Large Graphs

    Khosla, Megha and Anand, Avishek , biburl =. A Faster Algorithm for Cuckoo Insertion and Bipartite Matching in Large Graphs. , url =. Algorithmica , keywords =

  98. [106]

    and Mitzenmacher, Michael and Pszona, Pawe

    Eppstein, David and Goodrich, Michael T. and Mitzenmacher, Michael and Pszona, Pawe. Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket. Proceedings of the International Symposium on Experimental Algorithms (SEA). 2014

    2014

  99. [107]

    Balanced allocation and dictionaries with tightly packed constant size bins , journal =

    Martin Dietzfelbinger and Christoph Weidling , keywords =. Balanced allocation and dictionaries with tightly packed constant size bins , journal =. 2007 , notet =. doi:https://doi.org/10.1016/j.tcs.2007.02.054 , url =

    2007 doi

  100. [108]

    Balanced allocation through random walk , journal =

    Alan Frieze and Samantha Petti , keywords =. Balanced allocation through random walk , journal =. 2018 , issn =. doi:https://doi.org/10.1016/j.ipl.2017.11.010 , url =

    2018 doi

  101. [109]

    Efficient

    William Kuszmaul and Michael Mitzenmacher , editor =. Efficient. Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages =. 2025 , url =. doi:10.1137/1.9781611978322.133 , timestamp =

    2025 doi

  102. [110]

    2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) , pages=

    O(1) insertion for random walk d-ary cuckoo hashing up to the load threshold , author=. 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) , pages=. 2024 , organization=

    2024

  103. [111]

    1988 , booktitle =

    Non-oblivious hashing , author =. 1988 , booktitle =

    1988

  104. [112]

    Implicit

    Fiat, Amos and Naor, Moni , year =. Implicit. SIAM Journal on Computing , volume =

  105. [113]

    Proceedings of the 57th Annual ACM Symposium on Theory of Computing , pages=

    Optimal Non-Oblivious Open Addressing , author=. Proceedings of the 57th Annual ACM Symposium on Theory of Computing , pages=

  106. [114]

    2003 , booktitle =

    Succinct dynamic dictionaries and trees , author =. 2003 , booktitle =

    2003

  107. [115]

    Proceedings of the 26th International Colloquium on Automata, Languages and Programming , pages=

    Low Redundancy in Static Dictionaries with O (1) Worst Case Lookup Time , author=. Proceedings of the 26th International Colloquium on Automata, Languages and Programming , pages=

  108. [116]

    2010 , booktitle =

    Backyard cuckoo hashing: constant worst-case operations with a succinct representation , author =. 2010 , booktitle =

    2010

  109. [117]

    2023 , month = nov, journal =

    Iceberg hashing: optimizing many hash-table criteria at once , author =. 2023 , month = nov, journal =

    2023

  110. [118]

    2024 , booktitle =

    Modern hashing made simple , author =. 2024 , booktitle =

    2024

  111. [119]

    2023 , booktitle =

    Tight cell-probe lower bounds for dynamic succinct dictionaries , author =. 2023 , booktitle =

    2023

  112. [120]

    2024 , booktitle =

    Dynamic dictionary with subconstant wasted bits per key , author =. 2024 , booktitle =

    2024

  113. [121]

    2020 , booktitle =

    Succinct filters for sets of unknown sizes , author =. 2020 , booktitle =

    2020

  114. [122]

    Communications of the ACM , volume=

    Reducing the retrieval time of scatter storage techniques , author=. Communications of the ACM , volume=. 1973 , publisher=

    1973

  115. [123]

    , author=

    Techniques for Collision Resolution in Hash Tables with Open Addressing. , author=. FJCC , pages=

  116. [124]

    2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) , pages=

    Tight Bounds for Classical Open Addressing , author=. 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) , pages=. 2024 , organization=

    2024

  117. [125]

    2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) , pages=

    Optimal Bounds for Open Addressing Without Reordering , author=. 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) , pages=. 2024 , organization=

    2024

  118. [126]

    Journal of the ACM (JACM) , volume=

    Uniform hashing is optimal , author=. Journal of the ACM (JACM) , volume=. 1985 , publisher=

    1985

  119. [127]

    2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) , pages=

    Linear probing revisited: Tombstones mark the demise of primary clustering , author=. 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) , pages=. 2022 , organization=

    2021

  120. [128]

    2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) , pages=

    Tight Analyses of Ordered and Unordered Linear Probing , author=. 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) , pages=. 2024 , organization=

    2024

  121. [129]

    SIAM Journal on Computing , volume=

    Dynamic perfect hashing: Upper and lower bounds , author=. SIAM Journal on Computing , volume=. 1994 , publisher=

    1994

  122. [130]

    International Colloquium on Automata, Languages, and Programming , pages=

    De-amortized cuckoo hashing: Provable worst-case performance and experimental results , author=. International Colloquium on Automata, Languages, and Programming , pages=. 2009 , organization=

    2009

  123. [131]

    SIAM Journal on Computing , volume=

    More robust hashing: Cuckoo hashing with a stash , author=. SIAM Journal on Computing , volume=. 2010 , publisher=

    2010

  124. [132]

    Mediterranean Conference on Algorithms , pages=

    Cache-oblivious dictionaries and multimaps with negligible failure probability , author=. Mediterranean Conference on Algorithms , pages=. 2012 , organization=

    2012

  125. [133]

    2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) , pages=

    A hash table without hash functions, and how to get the most out of your random bits , author=. 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) , pages=. 2022 , organization=

    2022

  126. [134]

    30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989 , pages =

    Alan Siegel , title =. 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989 , pages =. 1989 , doi =

    1989

  127. [135]

    1995 , url =

    Alan Siegel , title =. 1995 , url =

    1995

  128. [136]

    SIAM Journal on Computing , volume =

    Anna Pagh and Rasmus Pagh , title =. SIAM Journal on Computing , volume =. 2008 , doi =

    2008

  129. [137]

    SIAM Journal on Computing , volume =

    Alan Siegel , title =. SIAM Journal on Computing , volume =. 2004 , doi =

    2004

  130. [138]

    Uniform hashing in constant time and linear space , booktitle =

    Anna. Uniform hashing in constant time and linear space , booktitle =. 2003 , doi =

    2003

  131. [139]

    2015 IEEE 56th Annual Symposium on Foundations of Computer Science , pages=

    Hashing for statistics over k-partitions , author=. 2015 IEEE 56th Annual Symposium on Foundations of Computer Science , pages=. 2015 , organization=

    2015

  132. [140]

    2013 IEEE 54th Annual Symposium on Foundations of Computer Science , pages=

    Simple tabulation, fast expanders, double tabulation, and high independence , author=. 2013 IEEE 54th Annual Symposium on Foundations of Computer Science , pages=. 2013 , organization=

    2013

  133. [141]

    2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=

    Locally uniform hashing , author=. 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) , pages=. 2023 , organization=

    2023

  134. [142]

    International Colloquium on Automata, Languages, and Programming , pages=

    Applications of a splitting trick , author=. International Colloquium on Automata, Languages, and Programming , pages=. 2009 , organization=

    2009

Pith tools

Reviewed August 2, 2026 · model on record in the stance chip above.