61 search results - page 4 / 13 » Some Open Questions Related to Cuckoo Hashing |
JCT
2010
14 years 4 months ago
2010
It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
79
Voted
FOGA
1992
14 years 10 months ago
1992
The building-block hypothesis states that the GA works well when short, low-order, highly-fit schemas recombine to form even more highly fit higher-order schemas. The ability to p...
72
Voted
ACL
2010
14 years 7 months ago
2010
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to...
156
Voted
PODS
2009
ACM
15 years 10 months ago
2009
ACM
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...