| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5075307 | 2022-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5859825 | 2021-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5859826 | 2021-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957449 | 2017-01-26 | Paper |
| Herbert S. Wilf (1931–2012) | 2016-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3457263 | 2015-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3457265 | 2015-12-14 | Paper |
| Two Thousand Years of Combinatorics | 2014-05-19 | Paper |
| Notes on avoiding ``go to statements | 2013-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3112449 | 2012-01-10 | Paper |
| Mathematics and Computer Science: Coping with Finiteness | 2011-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3094030 | 2011-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3087990 | 2011-08-17 | Paper |
| Mathematical vanity plates | 2011-05-19 | Paper |
| Efficient Coroutine Generation of Constrained Gray Sequences | 2011-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4933450 | 2010-10-13 | Paper |
| A symmetrical Eulerian identity | 2010-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3559723 | 2010-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3393914 | 2009-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3393339 | 2009-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3393340 | 2009-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3393226 | 2009-08-19 | Paper |
| Mathematics for the analysis of algorithms. | 2008-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485626 | 2006-08-31 | Paper |
| Irredundant intervals | 2005-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4681162 | 2005-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4826645 | 2004-11-11 | Paper |
| MMIXware. A RISC computer for the third millennium. | 2004-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4441515 | 2004-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4441516 | 2004-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4789489 | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4507509 | 2000-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4485440 | 2000-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4226962 | 1999-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4254888 | 1999-07-01 | Paper |
| Linear probing and graphs | 1999-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398780 | 1998-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4369384 | 1997-12-18 | Paper |
| Aztec diamonds, checkerboard graphs, and spanning trees | 1997-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4349924 | 1997-08-26 | Paper |
| Shellsort with three increments | 1997-08-07 | Paper |
| Partitioned tensor products and their spectra | 1997-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4344097 | 1997-07-13 | Paper |
| On the Lambert \(w\) function | 1997-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5687562 | 1996-12-16 | Paper |
| An Exact Analysis of Stable Allocation | 1996-12-11 | Paper |
| Polynomials Involving the Floor Function. | 1996-08-13 | Paper |
| Overlapping Pfaffians | 1996-07-21 | Paper |
| The Knowlton-Graham partition problem | 1996-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4862131 | 1996-02-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858039 | 1995-12-11 | Paper |
| Degree-Constrained Network Spanners with Nonconstant Delay | 1995-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140399 | 1995-02-13 | Paper |
| The sandwich theorem | 1995-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4320535 | 1995-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4317725 | 1994-12-20 | Paper |
| Johann Faulhaber and Sums of Powers | 1994-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138917 | 1994-09-19 | Paper |
| Two Notes on Notation | 1993-10-25 | Paper |
| Mathematics for the Analysis of Algorithms. | 1993-09-06 | Paper |
| The birth of the giant component | 1993-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4040797 | 1993-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035341 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038708 | 1993-05-18 | Paper |
| Axioms and hulls | 1993-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4016552 | 1993-01-16 | Paper |
| The Problem of Compatible Representatives | 1993-01-16 | Paper |
| Serial Isogons of 90 Degrees | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3997716 | 1992-09-17 | Paper |
| Randomized incremental construction of Delaunay and Voronoi diagrams | 1992-06-28 | Paper |
| Efficient representation of perm groups | 1992-06-27 | Paper |
| Theory and practice | 1991-01-01 | Paper |
| Stable husbands | 1990-01-01 | Paper |
| Nested satisfiability | 1990-01-01 | Paper |
| A bijection for ordered factorizations | 1990-01-01 | Paper |
| Addition Machines | 1990-01-01 | Paper |
| A Fibonacci-Like Sequence of Composite Numbers | 1990-01-01 | Paper |
| The errors of tex | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4206692 | 1989-01-01 | Paper |
| The first cycles in an evolving graph | 1989-01-01 | Paper |
| A short proof of Darboux's lemma | 1989-01-01 | Paper |
| The power of a prime that divides a generalized binomial coefficient. | 1989-01-01 | Paper |
| A Recurrence Related to Trees | 1989-01-01 | Paper |
| Fibonacci multiplication | 1988-01-01 | Paper |
| A note on strategy elimination in bimatrix games | 1988-01-01 | Paper |
| Digital halftones by dot diffusion | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3813295 | 1987-01-01 | Paper |
| A one-way, stackless quicksort algorithm | 1986-01-01 | Paper |
| Efficient balanced codes | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3750094 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3750095 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3750096 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3750097 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3750098 | 1986-01-01 | Paper |
| Optimal prepaging and font caching | 1985-01-01 | Paper |
| Semi-optimal bases for linear dependencies | 1985-01-01 | Paper |
| Algorithmic Thinking and Mathematical Thinking | 1985-01-01 | Paper |
| Deciphering a linear congruential encryption | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3719826 | 1985-01-01 | Paper |
| An analysis of optimum caching | 1985-01-01 | Paper |
| Dynamic huffman coding | 1985-01-01 | Paper |
| An algorithm for Brownian zeroes | 1984-01-01 | Paper |
| The distribution of continued fraction approximations | 1984-01-01 | Paper |
| Literate Programming | 1984-01-01 | Paper |
| The Toilet Paper Problem | 1984-01-01 | Paper |
| The complexity of songs | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3657300 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3809740 | 1983-01-01 | Paper |
| Huffman's algorithm via algebra | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3706485 | 1982-01-01 | Paper |
| Breaking paragraphs into lines | 1981-01-01 | Paper |
| A Permanent Inequality | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3935355 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3939231 | 1981-01-01 | Paper |
| Verification of link-level protocols | 1981-01-01 | Paper |
| The letter S | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3957976 | 1979-01-01 | Paper |
| Mathematical typography | 1979-01-01 | Paper |
| Inhomogeneous sorting | 1979-01-01 | Paper |
| Inhomogeneous sorting | 1979-01-01 | Paper |
| Lexicographic permutations with restrictions | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4161406 | 1978-01-01 | Paper |
| Complexity Results for Bandwidth Minimization | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4173431 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4174655 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4174656 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4174657 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4177507 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4194485 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4746796 | 1978-01-01 | Paper |
| A trivial algorithm whose analysis isn't | 1978-01-01 | Paper |
| The expected linearity of a simple equivalence algorithm | 1978-01-01 | Paper |
| Notes on generalized Dedekind sums | 1977-01-01 | Paper |
| Deletions That Preserve Randomness | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4132291 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4136567 | 1977-01-01 | Paper |
| Fast Pattern Matching in Strings | 1977-01-01 | Paper |
| Analysis of a simple factorization algorithm | 1977-01-01 | Paper |
| A generalization of Dijkstra's algorithm | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3208051 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4130997 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4178385 | 1976-01-01 | Paper |
| Evaluation of Porter's constant | 1976-01-01 | Paper |
| Estimating the Efficiency of Backtrack Programs | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4062664 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4069746 | 1975-01-01 | Paper |
| Analysis of the subtractive algorithm for greatest common divisors | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133077 | 1975-01-01 | Paper |
| Evading the drift in floating-point addition | 1975-01-01 | Paper |
| Random matroids | 1975-01-01 | Paper |
| An analysis of alpha-beta pruning | 1975-01-01 | Paper |
| Computer programming as an art | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4055144 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4099542 | 1974-01-01 | Paper |
| Computer Science and Its Relation to Mathematics | 1974-01-01 | Paper |
| Ordered hash tables | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5675745 | 1974-01-01 | Paper |
| Recurrence relations based on minimization | 1974-01-01 | Paper |
| A structured program to generate all topological sorting arrangements | 1974-01-01 | Paper |
| The asymptotic number of geometries | 1974-01-01 | Paper |
| Wheels within wheels | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4057549 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4091750 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5675725 | 1973-01-01 | Paper |
| Optimal measurement points for program frequency counts | 1973-01-01 | Paper |
| Permutations with nonnegative partial sums | 1973-01-01 | Paper |
| Ancient Babylonian algorithms | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5659554 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5671622 | 1972-01-01 | Paper |
| Complements and transitive closures | 1972-01-01 | Paper |
| An experiment in optimal sorting | 1972-01-01 | Paper |
| Enumeration of plane partitions | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4766043 | 1971-01-01 | Paper |
| Semantics of context-free languages: Correction | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5626271 | 1971-01-01 | Paper |
| An empirical study of FORTRAN programs | 1971-01-01 | Paper |
| Subspaces, subsets, and partitions | 1971-01-01 | Paper |
| Optimum binary search trees | 1971-01-01 | Paper |
| Top-down syntax nalysis | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5581665 | 1970-01-01 | Paper |
| Notes on central groupoids | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5619800 | 1970-01-01 | Paper |
| A Note on Solid Partitions | 1970-01-01 | Paper |
| Permutations, matrices, and generalized Young tableaux | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5585021 | 1969-01-01 | Paper |
| Very Magic Squares | 1968-01-01 | Paper |
| Semantics of context-free languages | 1968-01-01 | Paper |
| Another Enumeration of Trees | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5585020 | 1968-01-01 | Paper |
| The remaining trouble spots in ALGOL 60 | 1967-01-01 | Paper |
| Programming Language for Automata | 1967-01-01 | Paper |
| Oriented subtrees of an arc digraph | 1967-01-01 | Paper |
| Computation of Tangent, Euler, and Bernoulli Numbers | 1967-01-01 | Paper |
| A characterization of parenthesis languages | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5520730 | 1966-01-01 | Paper |
| On the translation of languages from left to right | 1966-01-01 | Paper |
| Combinatorial Analysis and Computers | 1965-01-01 | Paper |
| A Class of Projective Planes | 1965-01-01 | Paper |
| Construction of a random sequence | 1965-01-01 | Paper |
| Finite semifields and projective planes | 1965-01-01 | Paper |
| List Processing and Extension of Language Facility by Embedding | 1964-01-01 | Paper |
| SOLߞA Symbolic Language for General-Purpose Systems Simulation | 1964-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5511818 | 1964-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5721206 | 1964-01-01 | Paper |
| A proposal for input-output conventions in ALGOL 60 | 1964-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5731889 | 1964-01-01 | Paper |
| Length of strings for a merge sort | 1963-01-01 | Paper |
| Euler's Constant to 1271 Places | 1962-01-01 | Paper |
| Evaluation of polynomials by computer | 1962-01-01 | Paper |
| On Methods of Constructing Sets of Mutually Orthogonal Latin Squares Using a Computer. II | 1961-01-01 | Paper |
| Minimizing Drum Latency Time | 1961-01-01 | Paper |
| ALGOL 60 confidential | 1961-01-01 | Paper |
| On Methods of Constructing Sets of Mutually Orthogonal Latin Squares Using a Computer. I | 1960-01-01 | Paper |
| RUNCIBLE—algebraic translation on a limited computer | 1959-01-01 | Paper |
| Convolution polynomials | N/A | Paper |
| Bracket notation for the `coefficient of' operator | N/A | Paper |
| Leaper graphs | N/A | Paper |
