Recursive bounds for perfect hashing (Q5939232): Difference between revisions

@@ Property / cites work @@
+An upper bound on the zero-error list-coding capacity
+Normal rank
@@ Property / cites work @@
+Q3686615
@@ Property / cites work: Q3686615 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4745752
@@ Property / cites work: Q4745752 / rank @@
+Normal rank
@@ Property / cites work @@
+Families of finite sets in which no set is covered by the union of two others
+Normal rank
@@ Property / cites work @@
+On the Size of Separating Systems and Families of Perfect Hash Functions
+Normal rank
@@ Property / cites work @@
+Q4053473
@@ Property / cites work: Q4053473 / rank @@
+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 @@
+Compressing inconsistent data
@@ Property / cites work: Compressing inconsistent data / rank @@
+Normal rank
@@ Property / cites work @@
+New bounds for perfect hashing via information theory
+Normal rank
@@ Property / cites work @@
+Perfect Hashing and Probability
@@ Property / cites work: Perfect Hashing and Probability / rank @@
+Normal rank
@@ Property / cites work @@
+Should Tables Be Sorted?
@@ Property / cites work: Should Tables Be Sorted? / rank @@
+Normal rank