Additional comments on a problem in concurrent programming control. - N. G. de Bruijn (Commun. ACM, 1967)

Enumeration of Mapping Patterns. - N. G. de Bruijn (J. Comb. Theory A, 1972)

Sorting by means of swappings. - N. G. de Bruijn (Discret. Math., 1974)

Denumerations of rooted trees and multisets. - N. G. de Bruijn (Discret. Appl. Math., 1983)

Some Machines Defined bu Directed Graphs. - N. G. de Bruijn (Theor. Comput. Sci., 1984)

The use of justification systems for integrated semantics. - N. G. de Bruijn (Conference on Computer Logic, 1988)

Telescopic Mappings in Typed Lambda Calculus - N. G. de Bruijn (Inf. Comput., 1991)

Penrose patterns are almost entirely determined by two points. - N. G. de Bruijn (Discret. Math., 1992)

Highlighting the Lambda-free Fragment of Automath. - N. G. de Bruijn (TPHOLs, 1994)

Philosophical Aspects of Computerized Verification of Mathematics. - N. G. de Bruijn (TABLEAUX, 1998)

A Model for Associative Memory, a Basis for Thinking and Consciousness. - N. G. de Bruijn (ICALP, 1999)

Jaap Seidel 80. - N. G. de Bruijn (Des. Codes Cryptogr., 2000)

Problem 11131. - N. G. de Bruijn (Am. Math. Mon., 2005)

Sum of a Series: 11131. - N. G. de Bruijn; Rolf Richberg (Am. Math. Mon., 2006)

Remarks on Penrose Tilings. - N. G. de Bruijn (The Mathematics of Paul Erdős I, 2013)