Polynomial hash functions are reliable (Q5204320): Difference between revisions

@@ Property / author @@
-Nicholas J. Pippenger
@@ Property / author: Nicholas J. Pippenger / rank @@
-Normal rank
@@ Property / author @@
+Nicholas J. Pippenger
@@ Property / author: Nicholas J. Pippenger / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-55719-9_77
+Normal rank
@@ Property / OpenAlex ID @@
+W1576564521
@@ Property / OpenAlex ID: W1576564521 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast and simple randomized parallel algorithm for the maximal independent set problem
+Normal rank
@@ Property / cites work @@
+Universal classes of hash functions
@@ Property / cites work: Universal classes of hash functions / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of two-point based sampling
@@ Property / cites work: On the power of two-point based sampling / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Perfect Hashing: Upper and Lower Bounds
@@ Property / cites work: Dynamic Perfect Hashing: Upper and Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+Q4038677
@@ Property / cites work: Q4038677 / rank @@
+Normal rank
@@ Property / cites work @@
+Storing a Sparse Table with             <i>0</i>             (1) Worst Case Access Time
+Normal rank
@@ Property / cites work @@
+Q3138962
@@ Property / cites work: Q3138962 / rank @@
+Normal rank
@@ Property / cites work @@
+Two results on tables
@@ Property / cites work: Two results on tables / rank @@
+Normal rank
@@ Property / cites work @@
+On a set of almost deterministic k-independent random variables
+Normal rank
@@ Property / cites work @@
+Parallel hashing
@@ Property / cites work: Parallel hashing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4369384
@@ Property / cites work: Q4369384 / rank @@
+Normal rank
@@ Property / cites work @@
+A complexity theory of efficient parallel algorithms
+Normal rank
@@ Property / cites work @@
+A Simple Parallel Algorithm for the Maximal Independent Set Problem
+Normal rank
@@ Property / cites work @@
+Q4162697
@@ Property / cites work: Q4162697 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3219752
@@ Property / cites work: Q3219752 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
+Normal rank
@@ Property / cites work @@
+How to emulate shared memory
@@ Property / cites work: How to emulate shared memory / rank @@
+Normal rank
@@ Property / cites work @@
+The Spatial Complexity of Oblivious <i>k</i>-Probe Hash Functions
+Normal rank
@@ Property / cites work @@
+New hash functions and their use in authentication and set equality
+Normal rank
@@ Property / cites work @@
+Should Tables Be Sorted?
@@ Property / cites work: Should Tables Be Sorted? / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5204320