N. G. de Bruijn - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 16 from 16

2013

Remarks on Penrose TilingsN. G. de Bruijn. In Ronald L. Graham, Jaroslav Nesetril, Steve Butler, editors, The Mathematics of Paul Erdős I. pages 461-481, Springer, 2013. [doi]

2006

Sum of a Series: 11131N. G. de Bruijn, Rolf Richberg. tamm, 113(7):661-662, 2006. [doi]

2005

Problem 11131N. G. de Bruijn. tamm, 112(2):180, 2005. [doi]

2000

Jaap Seidel 80N. G. de Bruijn. dcc, 21(1/3):7-10, 2000.

1999

A Model for Associative Memory, a Basis for Thinking and ConsciousnessN. G. de Bruijn. icalp 1999: 74-89 [doi]

1998

Philosophical Aspects of Computerized Verification of MathematicsN. G. de Bruijn. tableaux 1998: 1-9 [doi]

1994

Highlighting the Lambda-free Fragment of AutomathN. G. de Bruijn. tphol 1994: 81-96

1992

Penrose patterns are almost entirely determined by two pointsN. G. de Bruijn. DM, 106-107:97-104, 1992. [doi]

1991

Telescopic Mappings in Typed Lambda CalculusN. G. de Bruijn. iandc, 91(2):189-204, April 1991.

1988

The use of justification systems for integrated semanticsN. G. de Bruijn. jic 1990: 9-24

1984

Some Machines Defined bu Directed GraphsN. G. de Bruijn. TCS, 32:309-319, 1984.

1983

Denumerations of rooted trees and multisetsN. G. de Bruijn. DAM, 6(1):25-33, 1983. [doi]

1974

Sorting by means of swappingsN. G. de Bruijn. DM, 9(4):333-339, 1974. [doi]

1972

Enumeration of Mapping PatternsN. G. de Bruijn. JCT, 12(1):14-20, 1972.

Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremN. G. de Bruijn. Indagationes Mathematicae, 34(5):381-392, 1972.

1967

Additional comments on a problem in concurrent programming controlN. G. de Bruijn. CACM, 10(3):137-138, 1967. [doi]

Sign in or sign up to see more results.

runs on WebDSL