The following pages link to Perfect Hashing and Probability (Q4314156):
Displayed 20 items.
- On two continuum armed bandit problems in high dimensions (Q260274) (← links)
- Separating systems and oriented graphs of diameter two (Q864898) (← links)
- On separating systems (Q875044) (← links)
- Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem (Q988577) (← links)
- Generalized hashing and parent-identifying codes. (Q1417959) (← links)
- Some intriguing upper bounds for separating hash families (Q1729948) (← links)
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (Q1923858) (← links)
- Beating Fredman-Komlós for perfect \(k\)-hashing (Q2077264) (← links)
- Bipartite Hansel results for hypergraphs (Q2198970) (← links)
- New bounds for perfect \(k\)-hashing (Q2217492) (← links)
- Interval Packing and Covering in the Boolean Lattice (Q2785370) (← links)
- Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
- On the Circuit Complexity of Perfect Hashing (Q3088172) (← links)
- Beating Fredman-Komlós for Perfect k-Hashing. (Q5091253) (← links)
- Covering Complete <i>r</i>-Graphs with Spanning Complete <i>r</i>-Partite <i>r</i>-Graphs (Q5199506) (← links)
- Separating Hash Families: A Johnson-type bound and New Constructions (Q5298169) (← links)
- Separation and Witnesses (Q5322994) (← links)
- Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem (Q5323046) (← links)
- Recursive bounds for perfect hashing (Q5939232) (← links)
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings (Q6131199) (← links)