https://hackerpaper.kaipfister.de/p/1904.02861/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=35453161urn:hackerpapers:mention:1904.02861:35453161Wed, 05 Apr 2023 12:42:51 GMT<p>One important caveat: it is widely believed that randomization does make a big difference for data structures problems. For example hash tables (which use random hash functions) take O(1) time per operation, but it is conjectured that no deterministic data structure can match this. There are also problems in online algorithms where randomization provably changes what is possible, for example the &quot;cup game problem.&quot; (https://arxiv.org/abs/1904.02861) Finally, although randomized primality testing (1970s) is often credited as the start of randomized algorithms as a field, it&#x27;s worth noting that…</p><p><a href="https://hackerpaper.kaipfister.de/p/1904.02861/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DS