Keep pulling the thread on Hans-Peter Luhn.
A hash table invented by Andrew Karpiven while he was an undergraduate at Rutgers University provided a counterexample to Andrew Yao's 1985 conjecture on the optimality of uniform probing.
The hash table developed by Andrew Karpiven and his collaborators achieves a near-constant average query time, a result previously thought to be impossible by Andrew Yao.
The new hash table developed by Andrew Karpiven's team maintains a fixed average query time regardless of how full the table is, even at 100% capacity.
A research paper by Andrew Karpiven's team concludes that for hash tables, there is no fundamental trade-off between space (memory usage) and time (query speed).
A team at Google surpassed a key milestone in quantum error correction.
The first test run of Google's Willow 72-qubit processor showed a 40% to 50% improvement in error suppression.
Google's quantum AI team demonstrated that as they increased the size of their error correction code, the error rate was cut in half, confirming an exponential reduction in errors.
MIT researcher Ryan Williams proved in a paper that algorithms can always be converted to use significantly less memory (space) than previously thought.
A paper by Ryan Williams demonstrates that a computation taking 'T' units of time can be simulated using only approximately the square root of T in memory space.
In 1985, computer scientist Andrew Yao concluded that the 'uniform probing' approach for hash tables was the best possible.
A new hash table constructed by Andrew Karpiven and his collaborators improves performance by not always inserting data into the first available empty slot.
Google's quantum AI team tested a new 72-qubit processor, codenamed Willow, after a year of improving qubit design.