64 (When) is hash table lookup O(1)? 2012-03-12T19:01:07.577

33 Why is it best to use a prime number as a mod in a hashing function? 2013-04-04T19:36:37.447

26 Hash tables versus binary trees 2012-03-13T00:30:42.750

22 How Does Populating Pastry's Routing Table Work? 2012-05-23T22:02:33.000

18 For what kind of data are hash table operations O(1)? 2012-03-17T21:55:43.600

13 Universal Hashing in Practice 2013-10-16T00:21:41.770

13 What does "non-pathological data" mean? 2014-06-14T11:16:42.333

11 Hashing using search trees instead of lists 2012-05-08T21:46:33.920

11 What are the advantages of cuckoo hashing over dynamic perfect hashing? 2015-01-22T04:08:59.273

10 Why is a (collision-less) hashtable lookup really O(1)? 2016-01-30T19:37:15.767

9 How are hash tables O(1) taking into account hashing speed? 2014-06-15T16:41:05.980

8 How to avoid cascading resizes when resizing hash tables? 2014-08-18T19:15:53.080

7 Origins of the term "distributed hash table" 2012-07-23T09:43:04.950

7 Hash table collisions: why use a linked list if we can use a hash set? 2015-12-29T09:57:38.040

6 How are hash table's values stored physically in memory? 2015-02-26T23:51:31.037

6 Building static hash table with particular collisions 2016-02-14T17:34:57.590

5 Counting different words in text using hashing 2012-05-14T16:41:35.327

5 Proof that probability that hashing with open addressing needs more than $k$ attempts is $2^{-k}$ at most 2013-10-06T22:13:05.387

5 Double Hashing and Variations for Bloom Filters 2015-02-08T08:40:39.483

5 What is the advantage of seperate chaining over open addressing? 2015-06-06T17:10:08.450

5 How to resize a large, distributed hash table? 2015-11-15T13:33:40.913

5 Is FKS hashing really linear space? 2016-07-05T16:28:20.623

5 Optimizing hash table for common subset of keys? 2016-08-05T01:50:50.187

4 Using hash tables instead of lists for buckets in hash tables 2012-07-04T14:54:28.810

4 How should I design a hash table where all the keys are permutations? 2015-02-21T17:46:26.780

4 What exactly is a hash function? 2015-04-29T17:02:22.823

4 Balanced allocation-Hash table- overflow probability 2015-11-03T14:32:52.420

4 Confusion with analysis of hashing with chaining 2016-03-02T07:52:22.513

4 Why are hash map look-ups assumed to be $O(1)$ on average 2016-07-28T12:41:49.490

4 How to store $n$ numbers with space $O(n)$ bits and access time $O(1)$? 2017-09-06T07:43:39.473

3 Why can't we use a hash tables for collision resolving in hash tables? 2012-10-28T03:50:29.827

3 Hash table collision probability 2013-03-04T21:20:01.743

3 What is this hash of array data structure called? 2013-12-18T18:20:44.957

3 Why does the following function distribute things in a binomial distribution? 2014-03-28T00:27:13.283

3 Why does appending permutations of servers at the end of hash table avoid bottlenecks? 2014-03-28T00:36:28.957

3 How can you iterate through a hash table in constant time? 2014-10-14T11:48:25.173

3 Where does the terminology of open addressing resp. closed hashing come from? 2014-11-11T00:59:41.460

3 Probability of probing $t$ locations in a Cuckoo hash is $O(\frac{1}{2^{t/2}})$ locations in the worst case 2014-12-01T06:38:17.607

3 Memory usage of a BST or hash table? 2015-08-14T13:52:08.483

3 Hash-Table in Practice 2015-10-19T19:28:51.210

3 Hash Table: Relation between position of a value and Hash table size 2015-11-18T13:31:36.560

3 Do cryptographic hash function solve clustering problems with linear probing? 2016-12-16T20:50:44.267

3 What is the easiest solution to check if a rational number is in the Cantor set? 2017-02-06T14:42:47.017

3 How to sort an array $A[1..n]$ with $\sqrt n$ distinct elements in $\Theta(n)$ time and $\Theta(\sqrt n)$ space? 2017-06-07T19:04:49.040

3 Knuth's proof of O(1) for linear probing 2017-09-08T17:46:51.403

3 What data structure should I use for storing my data? 2017-11-29T10:47:59.787

2 How do the following Hash Functions compare? 2012-10-27T03:38:30.673

2 Modulo hash function and multiples of three 2012-10-26T02:36:33.613

2 Hash function - uniformity / strong universality 2013-03-10T22:21:18.860

2 How to get expected running time of hash table? 2013-03-12T23:20:41.050

2 Are those definitions of universal hash family equivalent? 2013-05-21T16:00:59.023

2 Find similar vector by Locality Sensitive Hashing 2013-07-18T14:41:29.760

2 Why should one not use a 2^p size hash table when using the division method as a hash function? 2013-12-15T21:58:43.020

2 The theoretical upper bounds for duplicate detection in a set of objects? 2013-12-21T01:22:35.833

2 Efficient representation of a given surjective function $\{1 \ldots N\} \rightarrow \{1 \ldots M\}$ when $N \gg M$ 2014-09-27T09:13:48.843

2 How to find expected number of slots of a certain size k in hash table? 2014-09-04T03:08:29.650

2 Show that the following family of hash functions is $2$-wise independent but not $3$-wise independent 2014-12-01T22:07:09.993

2 Tradoff between space and false positive rate when using bloom filters 2014-12-08T10:00:09.847

2 Improve the runtime of hashtable operations by keeping lists in sorted order 2015-02-24T20:13:13.307

2 Collisions in independent hashing 2015-08-12T20:45:08.387

2 Storing variable length Keys in hash table itself 2015-09-23T16:43:04.013

2 What is the formal analysis with Simple Uniform Hashing that the load factor is $\alpha = \frac{n}{m}$ 2016-02-16T00:02:26.873

2 Determine if there are 2 integers in 2 separate arrays add up to a given number 2016-02-21T22:09:33.003

2 Does hashing under the Simple Uniform Hashing Assumption battle worst-case adversaries the same way quick sort does? 2016-03-01T23:48:19.763

2 Does my simple, static hash table have O(1) worst case lookup? 2016-04-05T12:59:21.533

2 Constraint on Universal set of hash functions 2016-05-26T20:25:56.527

2 What are the substitues for Kolmogorov Complexity to analyse Hashing 2016-08-09T06:48:50.623

2 Static hash tables 2017-06-21T21:27:14.683

2 How exactly Hashing performs better than a Binary Search? 2017-06-29T21:29:26.423

2 "Hash" Probing? 2017-07-28T07:07:16.080

2 Cuckoo filters for non powers-of-2 2017-09-29T17:30:47.883

2 hash-table subsets 2017-12-11T20:35:44.113

1 Is open adressing with prime steps bijective? 2012-05-22T08:09:20.643

1 Sequential hash tree traversal 2013-05-10T07:16:57.917

1 Double hashing - probe count probabilities 2013-07-25T21:06:45.597

1 Hashing a Specific Range Of a Character Array 2013-12-11T10:59:54.037

1 Proving that collision is less likely if the table size is prime in case modulo arithmetic is used 2014-02-26T09:35:01.783

1 Hash tables - probing for collisions run time 2014-05-11T08:04:49.390

1 Prove that this family of hash function is $3$-wise independent, but not $4$-wise independent 2014-12-03T23:02:57.090

1 What needs to be done after deleting an item in a hash table built under opening addressing with linear probing 2014-12-17T02:40:35.747

1 Why can't hash tables provide O(n) sorting? 2015-06-18T09:58:24.993

1 Problem occurring when changing hash table size 2015-06-22T14:47:09.570

1 How would you implement truly random hash functions in practice? 2015-06-24T14:38:09.877

1 Find unique vectors by linear algorithm 2015-10-30T20:34:10.173

1 Different probabilistic statement for Simple Uniform Hashing 2016-02-16T00:23:45.530

1 How do you express the theorem statement about unsuccessful search on average-case for unsuccessful searches in hashing with quantifiers? 2016-02-16T04:28:58.660

1 Understanding hashtable performance in the worst-case 2016-05-17T11:59:59.953

1 improving java 8's implement to hash map using avl tree 2016-05-21T16:07:32.453

1 Shifting deletion algorithm for linear-probing hash table 2016-06-29T21:17:21.243

1 Average number of collisions before successful insertion into hash table 2016-10-22T09:08:55.737

1 Generate collision resistant identifiers with two-way hashing 2016-11-07T20:12:54.657

1 Hash functions producing uniform outputs 2017-01-02T17:03:31.470

1 Hash table where items can fall into multiple buckets. What's the name of the data scrtucture? 2017-02-14T11:37:58.957

1 Quadratic probing maximum load factor with $c_1 = c_2 = 0.5$ to guarantee successful insertion 2017-02-15T10:02:16.690

1 When using a hash and a collision occurs and linear probing is used how is that item found again 2017-04-23T21:12:37.437

1 Cuckoo hashing proof of cycle 2017-05-11T09:14:35.057

1 Probability that all indices divisible by 100 in a hash table with linear probing are occupied 2017-07-21T14:45:20.137

1 Hash table: When is it suitable to use modulo power of 2? 2017-09-22T10:14:36.110

1 Print maximum frequency number in an array(with slight modification) 2017-09-25T08:13:59.807