De N.g. Bruijn
#138,142
Most Influential Person Now
De N.g. Bruijn's AcademicInfluence.com Rankings
De N.g. Bruijnmathematics Degrees
Mathematics
#6553
World Rank
#9057
Historical Rank
Measure Theory
#1423
World Rank
#1786
Historical Rank
Download Badge
Computer Science Mathematics
De N.g. Bruijn's Degrees
- PhD Mathematics University of Amsterdam
Why Is De N.g. Bruijn Influential?
(Suggest an Edit or Addition)De N.g. Bruijn's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem (1972) (1226)
- Algebraic theory of Penrose's non-periodic tilings of the plane. II (1981) (333)
- A survey of the project Automath (1980) (258)
- The mathematical language AUTOMATH, its usage, and some of its extensions (1970) (239)
- The Mathematical Vernacular, A Language for Mathematics with Typed Sets (1994) (104)
- On Mahler's partition problem (1948) (101)
- Generalization of polya’s fundamental theorem in enumerative combinatorial analysis (1959) (79)
- Uncertainty principles in Fourier analysis (1967) (78)
- On the number of uncancelled elements in the sieve of Eratosthenes (1950) (78)
- A namefree lambda calculus with facilities for internal definition of expressions and segments (1978) (73)
- Acknowledgement of priority to C. Flye Sainte-Marie on the counting of circular arrangements of $2^n$ zeros and ones that show each n-letter word exactly once (1975) (65)
- Automath A Language for Mathematics (1973) (59)
- Generalizing Automath by means of a lambda-typed lambda calculus (1987) (50)
- Permutations with given ups and downs (1970) (45)
- Lambda calculus with namefree formulas involving symbols that represent reference transforming mappings (1978) (39)
- Filling boxes with bricks (1969) (36)
- Quasicrystals and their Fourier transform (1986) (36)
- On the zeros of composition-polynomials (1947) (31)
- On some linear functional equations (2022) (30)
- The asymptotically periodic behavior of the solutions of some linear functional equations (1949) (29)
- A sorting machine (1983) (27)
- Updown generation of Penrose patterns (1990) (27)
- Embedding theorems for infinite groups (1957) (27)
- The Electrostatic Field of a Point Charge Inside a Cylinder, in Connection with Wave Guide Theory (1947) (26)
- A survey of generalizations of Pólya's enumeration theorem (1971) (24)
- On the roles of types in mathematics (1995) (22)
- Reflections on Automath (1994) (22)
- Some extensions of Automath : the AUT-4 family (1994) (19)
- Exact finite models for minimal propositional calculus over a finite alphabet (1975) (19)
- Checking mathematics with computer assistance (1991) (18)
- A note on weak diamond properties (1978) (16)
- Enumerative combinatorial problems concerning structures (1963) (13)
- Some theorems on the roots of polynomials (1949) (11)
- A problem of optimal control (1966) (10)
- An aymptotic problem on iterated functions (1977) (10)
- On the number of partition patterns of a set (1974) (9)
- AUT-SL, a Single Line Version of Automath (1994) (9)
- Can people think (1996) (8)
- Some classes of integer-valued functions (1955) (7)
- Set theory with type restrictions (1994) (7)
- Remarks on Hermitian Matrices (1980) (6)
- Formalization of constructivity in Automath (1984) (6)
- Symmetry and quasisymmetry (1988) (5)
- An algol program for deciding derivability in minimal propositional calculus with implication and conjunction over a three letter alphabet (1975) (4)
- A theorem on Pfaffians (1974) (3)
- The use of partially ordered sets for the study of non-classical propositional logics (1978) (3)
- The difference-differential equation $F'(x)=e^{\alpha x + \beta} F(x-1)$. II (1953) (3)
- Some extremal problems about differential equations with perturbations (1965) (3)
- Wees contextbewust in WOT (1979) (3)
- A theorem on choice functions (1957) (3)
- A model for information processing in human memory and consciousness (1994) (3)
- Example of a text written in Automath (1994) (3)
- Coding system for AUT-QE (1970) (2)
- A Mathematical Model for Biological Memory and Consciousness (2003) (2)
- Introducing the reals as a totally ordered additive group without using the rationals (1975) (2)
- Mathematical models for the living brain (1974) (2)
- A processor for PAL (1970) (2)
- Some algorithms for reordering a sequence of objects, with application to E. Sparre Andersen's principle of equivalence in mathematical statistics (1972) (1)
- On the use of bound variables in Automath (1970) (1)
- Some auxiliary operators in AUT-PI (1977) (1)
- Some sorting machines (1979) (1)
- The syntax of Pal and Automath (1970) (1)
- Formulas with indications for establishing definitional equivalence (1970) (1)
- Computer Program Semantics in Space and Time (1994) (1)
- The use of the language Automath for syntax and semantics of programming languages (1975) (1)
- A framework for the description of a number of members of the AUTOMATH family (1974) (1)
- Verification of mathematical proofs by a computer : a preparatory study for a project Automath (1994) (1)
- A theorem on diophantine approximation (1985) (1)
- On some formal power series expansions (1969) (1)
- Checking mathematics with the aid of a computer (1986) (1)
- The difference-differential equation F'(x)=e\sp {ax+\beta}F(x-1), I and II (1953) (1)
- SEMIPAL 2, an extension of the mathematical nottional language SEMIPAL (1969) (1)
- AUT-QE without type inclusion (1978) (1)
- A system for handling syntax and semantics of computer programs in terms of the mathematical language automth (1973) (1)
- Description of the language Automath (1967) (1)
- On a problem of J. de Graaf connected with algebras of unbounded operators (1984) (1)
- Upper bounds for the length of normal forms and for the length of reduction sequence in lambda-typed lambda calculus (1985) (0)
- On some big closed polygons (1990) (0)
- Upper bound for the length of the norm of an expression in lambda-typed lambda calculus (1985) (0)
- The exterior cycle index of a permutation group (1971) (0)
- Some abbreviations in the input language for Automath (1972) (0)
- Proving a conjecture of V. Strehl on necklaces (1995) (0)
- A namefree lambda calculus with formulas involving symbols that represent reference transforming mappings (1977) (0)
- Finitely generated closed sets, and the relation between $T_0$-topologies and partially ordered sets (1975) (0)
- In memoriam W. Peremans (1921-1999) (2000) (0)
- A note on non-periodic tilings of the plane (1985) (0)
- Classical logic based on Pierce's law (1983) (0)
- Towards a definition of AUT-SL by means of a formal description of binary trees (1984) (0)
- The Automath mathematics checking project and its influence on teaching:contribution to the ICMI discussion on "The influence of computers and informatics on mathematics and its teaching", Strassbourg, 25-30 March, 1985 (1985) (0)
- Mathematical models of the living brain (Dutch) (1974) (0)
- Modifications of the 1968 version of AUTOMATH (1976) (0)
- The AUTOMATH mathematics checking project (1974) (0)
- Book review: The universe in a handkerchief: Lewis Carroll's mathematical recreations, games, puzzles, and word plays (1998) (0)
- A converse of Cauchy's fundamental sequence theorem (1962) (0)
- Notes on typed lambda calculus (1983) (0)
- On seminormal expressions in lambda typed lambda calculus (1984) (0)
- Definition of limits in Automath (1970) (0)
- A technique for deriving semantic information on computer programs (1973) (0)
- Remarks on flowcharts (1983) (0)
- Non-recursive tree traversal algorithm explained in pictures (1983) (0)
- Lambda calculus with postponed substitution (1983) (0)
- Topological existence proof for a non-linear two-point boundary value problem (1981) (0)
- On minimal two-letter propositional logic with disjunction (1976) (0)
- Non-numerieke computertoepassingen (1969) (0)
- A new definition of correctness of expressions in lambda typed lambda calculus (1982) (0)
This paper list is powered by the following services:
