Matches in SemOpenAlex for { <https://semopenalex.org/work/W200648432> ?p ?o ?g. }
Showing items 1 to 84 of
84
with 100 items per page.
- W200648432 endingPage "76" @default.
- W200648432 startingPage "62" @default.
- W200648432 abstract "Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold improvement in speed over direct methods based on degree 3 polynomials.In this paper, we show that if the pre-computed tables are made 5-universal, then the hash value becomes 5-universal without any other change to the computation. Relatively this leads to even bigger gains since the direct methods for 5-universal hashing use degree 4 polynomials. Experimentally, we find that our method can gain up to an order of magnitude in speed over direct 5-universal hashing.Some of the most popular randomized algorithms have been proved to have the desired expected running time using 5-universal hashing, e.g., a non-recursive variant of quicksort takes O(n log n) expected time [Karloff Raghavan JACM'93], and linear probing does updates and searches in O(1) expected time [Pagh et al. SICOMP'09]. In contrast, inputs have been constructed leading to much worse expected performance with some of the classic primality based 2-universal hashing schemes.In the context of linear probing, we compare our new fast 5-universal hashing experimentally with the fastest known plain universal hashing. We know that any reasonable hashing scheme will work on random input, but from Pagh et al., we know that 5-universal hashing leads to good expected performance on all input. We use a dense interval as an example of a structured yet realistic input, wanting to see if this could push the fastest multiplication-shift based plain universal hashing into bad performance. Even though our 5-universal hashing itself is slower than the fast plain universal hashing, it makes linear probing much more robust." @default.
- W200648432 created "2016-06-24" @default.
- W200648432 creator A5017227883 @default.
- W200648432 creator A5039232562 @default.
- W200648432 date "2010-01-16" @default.
- W200648432 modified "2023-09-26" @default.
- W200648432 title "Tabulation based 5-universal hashing and linear probing" @default.
- W200648432 cites W1546441687 @default.
- W200648432 cites W1551533237 @default.
- W200648432 cites W1970309382 @default.
- W200648432 cites W1979795732 @default.
- W200648432 cites W1982689753 @default.
- W200648432 cites W1985623009 @default.
- W200648432 cites W1993217935 @default.
- W200648432 cites W2026784425 @default.
- W200648432 cites W2039852170 @default.
- W200648432 cites W2052207834 @default.
- W200648432 cites W2059271645 @default.
- W200648432 cites W2071179368 @default.
- W200648432 cites W2144399314 @default.
- W200648432 cites W3198160809 @default.
- W200648432 cites W76038825 @default.
- W200648432 hasPublicationYear "2010" @default.
- W200648432 type Work @default.
- W200648432 sameAs 200648432 @default.
- W200648432 citedByCount "6" @default.
- W200648432 countsByYear W2006484322012 @default.
- W200648432 countsByYear W2006484322015 @default.
- W200648432 crossrefType "proceedings-article" @default.
- W200648432 hasAuthorship W200648432A5017227883 @default.
- W200648432 hasAuthorship W200648432A5039232562 @default.
- W200648432 hasConcept C11413529 @default.
- W200648432 hasConcept C116058348 @default.
- W200648432 hasConcept C122907437 @default.
- W200648432 hasConcept C138111711 @default.
- W200648432 hasConcept C187062812 @default.
- W200648432 hasConcept C33923547 @default.
- W200648432 hasConcept C36375716 @default.
- W200648432 hasConcept C38652104 @default.
- W200648432 hasConcept C41008148 @default.
- W200648432 hasConcept C67388219 @default.
- W200648432 hasConcept C80444323 @default.
- W200648432 hasConcept C99138194 @default.
- W200648432 hasConceptScore W200648432C11413529 @default.
- W200648432 hasConceptScore W200648432C116058348 @default.
- W200648432 hasConceptScore W200648432C122907437 @default.
- W200648432 hasConceptScore W200648432C138111711 @default.
- W200648432 hasConceptScore W200648432C187062812 @default.
- W200648432 hasConceptScore W200648432C33923547 @default.
- W200648432 hasConceptScore W200648432C36375716 @default.
- W200648432 hasConceptScore W200648432C38652104 @default.
- W200648432 hasConceptScore W200648432C41008148 @default.
- W200648432 hasConceptScore W200648432C67388219 @default.
- W200648432 hasConceptScore W200648432C80444323 @default.
- W200648432 hasConceptScore W200648432C99138194 @default.
- W200648432 hasLocation W2006484321 @default.
- W200648432 hasOpenAccess W200648432 @default.
- W200648432 hasPrimaryLocation W2006484321 @default.
- W200648432 hasRelatedWork W1514336682 @default.
- W200648432 hasRelatedWork W1546441687 @default.
- W200648432 hasRelatedWork W1551533237 @default.
- W200648432 hasRelatedWork W1851100088 @default.
- W200648432 hasRelatedWork W1979795732 @default.
- W200648432 hasRelatedWork W1982689753 @default.
- W200648432 hasRelatedWork W1985623009 @default.
- W200648432 hasRelatedWork W1993091968 @default.
- W200648432 hasRelatedWork W2014586253 @default.
- W200648432 hasRelatedWork W2026784425 @default.
- W200648432 hasRelatedWork W2039852170 @default.
- W200648432 hasRelatedWork W2052207834 @default.
- W200648432 hasRelatedWork W2059271645 @default.
- W200648432 hasRelatedWork W2063844956 @default.
- W200648432 hasRelatedWork W2071179368 @default.
- W200648432 hasRelatedWork W2082162447 @default.
- W200648432 hasRelatedWork W2107371087 @default.
- W200648432 hasRelatedWork W2144399314 @default.
- W200648432 hasRelatedWork W25594804 @default.
- W200648432 hasRelatedWork W2081155845 @default.
- W200648432 isParatext "false" @default.
- W200648432 isRetracted "false" @default.
- W200648432 magId "200648432" @default.
- W200648432 workType "article" @default.