N. G. de Bruijn

According to our database, N. G. de Bruijn authored at least 15 papers between 1967 and 2013.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2013

Remarks on Penrose Tilings.

N. G. de Bruijn

Proceedings of the Mathematics of Paul Erdős I, 2013

2006

Sum of a Series: 11131.

N. G. de Bruijn, Rolf Richberg

Am. Math. Mon., 2006

2005

Problem 11131.

N. G. de Bruijn

Am. Math. Mon., 2005

2000

Jaap Seidel 80.

N. G. de Bruijn

Des. Codes Cryptogr., 2000

1999

A Model for Associative Memory, a Basis for Thinking and Consciousness.

N. G. de Bruijn

Proceedings of the Automata, 1999

1998

Philosophical Aspects of Computerized Verification of Mathematics.

N. G. de Bruijn

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1998

1994

Highlighting the Lambda-free Fragment of Automath.

N. G. de Bruijn

Proceedings of the Higher Order Logic Theorem Proving and Its Applications, 1994

1992

Penrose patterns are almost entirely determined by two points.

N. G. de Bruijn

Discret. Math., 1992

1991

Telescopic Mappings in Typed Lambda Calculus

N. G. de Bruijn

Inf. Comput., April, 1991

1988

The use of justification systems for integrated semantics.

N. G. de Bruijn

Proceedings of the COLOG-88, 1988

1984

Some Machines Defined bu Directed Graphs.

N. G. de Bruijn

Theor. Comput. Sci., 1984

1983

Denumerations of rooted trees and multisets.

N. G. de Bruijn

Discret. Appl. Math., 1983

1974

Sorting by means of swappings.

N. G. de Bruijn

Discret. Math., 1974

1972

Enumeration of Mapping Patterns.

N. G. de Bruijn

J. Comb. Theory A, 1972

1967

Additional comments on a problem in concurrent programming control.

N. G. de Bruijn

Commun. ACM, 1967