Editing Hash table (section)

==History==
The idea of hashing arose independently in different places. In January 1953, [[Hans Peter Luhn]] wrote an internal [[IBM]] memorandum that used hashing with chaining.  The first example of [[open addressing]] was proposed by A. D. Linh, building on Luhn's memorandum.<ref name="knuth"/>{{rp|p=547}} Around the same time, [[Gene Amdahl]], [[Elaine M. McGraw]], [[Nathaniel Rochester (computer scientist)|Nathaniel Rochester]], and [[Arthur Samuel (computer scientist)|Arthur Samuel]] of [[IBM Research]] implemented hashing for the [[IBM 701]] [[Assembly language#Assembler|assembler]].{{r|Konheim|p=124}} Open addressing with linear probing is credited to Amdahl, although [[Andrey Ershov]] independently had the same idea.<ref name="Konheim">{{cite book |doi=10.1002/9780470630617 |title=Hashing in Computer Science |date=2010 |last1=Konheim |first1=Alan G. |isbn=978-0-470-34473-6 }}</ref>{{rp|pp=124–125}} The term "open addressing" was coined by [[W. Wesley Peterson]] in his article which discusses the problem of search in large files.<ref name="hashhist">{{cite book |doi=10.1201/9781420035179 |title=Handbook of Data Structures and Applications |date=2004 |isbn=978-0-429-14701-2 |editor-last1=Mehta |editor-last2=Mehta |editor-last3=Sahni |editor-first1=Dinesh P. |editor-first2=Dinesh P. |editor-first3=Sartaj }}</ref>{{rp|p=15}}

The first [[Academic publishing|published]] work on hashing with chaining is credited to [[Arnold Dumey]], who discussed the idea of using remainder modulo a prime as a hash function.{{r|hashhist|p=15}} The word "hashing" was first published in an article by Robert Morris.{{r|Konheim|p=126}} A [[Analysis of algorithms|theoretical analysis]] of linear probing was submitted originally by Konheim and Weiss.{{r|hashhist|p=15}}