Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (Q1923858): Difference between revisions

@@ Property / cites work @@
+A fast and simple randomized parallel algorithm for the maximal independent set problem
+Normal rank
@@ Property / cites work @@
+Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
+Normal rank
@@ Property / cites work @@
+On the exponent of all pairs shortest path problem
+Normal rank
@@ Property / cites work @@
+Q4230366
@@ Property / cites work: Q4230366 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2798999
@@ Property / cites work: Q2798999 / rank @@
+Normal rank
@@ Property / cites work @@
+Simulating (log             <sup>c</sup>             <i>n</i>             )-wise independence in NC
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+Implicit $O(1)$ Probe Search
@@ Property / cites work: Implicit $O(1)$ Probe Search / rank @@
+Normal rank
@@ Property / cites work @@
+Nonoblivious hashing
@@ Property / cites work: Nonoblivious hashing / rank @@
+Normal rank
@@ Property / cites work @@
+On the Size of Separating Systems and Families of Perfect Hash Functions
+Normal rank
@@ Property / cites work @@
+Storing a Sparse Table with             <i>0</i>             (1) Worst Case Access Time
+Normal rank
@@ Property / cites work @@
+Witnesses for Boolean matrix multiplication and for transitive closure
+Normal rank
@@ Property / cites work @@
+A fast parallel algorithm for the maximal independent set problem
+Normal rank
@@ Property / cites work @@
+Fredman–Komlós bounds and information theory
@@ Property / cites work: Fredman–Komlós bounds and information theory / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple Parallel Algorithm for the Maximal Independent Set Problem
+Normal rank
@@ Property / cites work @@
+Removing randomness in parallel computation without a processor penalty
+Normal rank
@@ Property / cites work @@
+The effect of table expansion on the program complexity of perfect hash functions
+Normal rank
@@ Property / cites work @@
+Q3219751
@@ Property / cites work: Q3219751 / rank @@
+Normal rank
@@ Property / cites work @@
+The probabilistic method yields deterministic parallel algorithms
+Normal rank
@@ Property / cites work @@
+Small-Bias Probability Spaces: Efficient Constructions and Applications
+Normal rank
@@ Property / cites work @@
+Perfect Hashing and Probability
@@ Property / cites work: Perfect Hashing and Probability / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic construction of deterministic algorithms: approximating packing integer programs
+Normal rank
@@ Property / cites work @@
+The Spatial Complexity of Oblivious <i>k</i>-Probe Hash Functions
+Normal rank
@@ Property / cites work @@
+Q3481743
@@ Property / cites work: Q3481743 / rank @@
+Normal rank
@@ Property / cites work @@
+Storing a sparse table
@@ Property / cites work: Storing a sparse table / rank @@
+Normal rank