25,161
edits
Changes
no edit summary
'''Nicolaas Govert de Bruijn''', (July 9, 1918 – February 17, 2012 <ref>[http://processalgebra.blogspot.de/2012/02/nicolaas-govert-de-bruijn-1918-2012.html Process Algebra Diary: Nicolaas Govert de Bruijn (1918-2012)]</ref>)<br/>
was a Dutch mathematician, covering many areas of mathematics. Eponym of the [[De Bruijn Sequence|De Bruijn Sequences]] <ref>[https://en.wikipedia.org/wiki/De_Bruijn_sequence De Bruijn sequence from Wikipedia]</ref> - as used for instance in computer chess programming to [[BitScan#DeBruijnMultiplation|scan bits]] of set-wise representations such as [[Bitboards]] <ref>[[Charles Leiserson|Charles E. Leiserson]], [[Harald Prokop]] and , [[Keith H. Randall]] ('''1998'''). ''Using de Bruijn Sequences to Index a 1 in a Computer Word''. [http://supertech.csail.mit.edu/papers/debruijn.pdf pdf]</ref>.
According to De Bruijn himself <ref>[[Nicolaas de Bruijn]] ('''1975'''). ''Acknowledgement of priority to C. Flye Sainte-Marie on the counting of circular arrangements of 2n zeros and ones that show each n-letter word exactly once''. Technical Report, Technische Hogeschool Eindhoven, [http://alexandria.tue.nl/repository/books/252901.pdf pdf]</ref>, the existence of De Bruijn sequences for each order were first proved, for the case of alphabets with two elements, by '''Camille Flye Sainte-Marie''' in 1894, whereas the generalization to larger alphabets is originally due to [[Mathematician#Ehrenfest|Tanja van Ardenne-Ehrenfest]] <ref>[[Nicolaas de Bruijn]] ('''1985'''). ''In Memoriam T. van Ardenne-Ehrenfest''. [http://alexandria.tue.nl/repository/freearticles/597575.pdf pdf]</ref> and himself.
