linear probing
... that Donald Knuth's analysis of the linear probing strategy for resolving collisions in hash tables has been called "a landmark in the analysis of algorithms"?
... that <a href="./Donald_Knuth" id="mwBSw" rel="mw:WikiLink" title="Donald Knuth">Donald Knuth</a>'s analysis of the <b id="mwBS0"><a href="./Linear_probing" id="mwBS4" rel="mw:WikiLink" title="Linear probing">linear probing</a></b> strategy for resolving <a class="mw-redirect mw-disambig" href="./Collision_(computer_science)" id="mwBS8" rel="mw:WikiLink" title="Collision (computer science)">collisions</a> in <a href="./Hash_table" id="mwBTA" rel="mw:WikiLink" title="Hash table">hash tables</a> has been called "a landmark in the analysis of algorithms"?