And for this new hash table, the time required for worst-case queries and insertions is proportional to (log x) 2 — far faster than x. This result directly contradicted Yao’s conjecture. Farach-Colton ...