| Publication | Date of Publication | Type |
|---|
| Counting the Angels and Devils in Escher's Circle Limit IV | 2023-10-25 | Paper |
| An elementary approach to some analytic asymptotics | 2022-12-09 | Paper |
| A Formula for the Determinant | 2022-05-31 | Paper |
| Polynomial hash functions are reliable | 2019-12-04 | Paper |
| Systematic mistakes are likely in bounded optimal decision-making systems | 2018-10-08 | Paper |
| ASYMPTOTIC ANALYSIS OF OPTIMAL NESTED GROUP-TESTING PROCEDURES | 2017-09-19 | Paper |
| On-the-Fly Algorithms and Sequential Machines | 2017-07-27 | Paper |
| On the enumeration of interval graphs | 2017-03-20 | Paper |
| Self-intersections of Two-Dimensional Equilateral Random Walks and Polygons | 2015-08-24 | Paper |
| Self-routing superconcentrators | 2015-05-07 | Paper |
| Computational aspects of M. C. Escher's ribbon patterns | 2015-01-21 | Paper |
| Stochastic service systems, random interval graphs and search algorithms | 2014-11-17 | Paper |
| Large-Deviation Bounds for Sampling without Replacement | 2014-11-10 | Paper |
| Carry propagation in multiplication by constants | 2014-09-09 | Paper |
| Barred preferential arrangements | 2014-08-14 | Paper |
| Random cyclations | 2014-08-14 | Paper |
| Fault tolerance in cellular automata at low fault rates | 2014-01-27 | Paper |
| Efficient Algorithms for Zeckendorf Arithmetic | 2013-12-19 | Paper |
| Counting the Angels and Devils in Escher's Circle Limit IV | 2013-10-04 | Paper |
| Local versus global search in channel graphs | 2013-08-06 | Paper |
| A Combinatorial Interpretation of the Joint Cumulant | 2012-11-03 | Paper |
| Elementary Proofs of the Main Limit Theorems of Probability | 2012-07-25 | Paper |
| Analysis of an M/M/1 Queue Using Fixed Order of Search for Arrivals and Service | 2011-08-26 | Paper |
| Martingale Couplings and Bounds on the Tails of Probability Distributions | 2011-07-07 | Paper |
| The M/M/Infinity Service System with Ranked Servers in Heavy Traffic | 2011-07-07 | Paper |
| Asymptotic Behavior of the Moments of the Maximum Queue Length During a Busy Period | 2011-06-17 | Paper |
| A census of vertices by generations in regular tessellations of the plane | 2011-06-01 | Paper |
| A Bound on the Variance of the Waiting Time in a Queueing System | 2011-05-31 | Paper |
| Two Extensions of Results of Archimedes | 2011-02-04 | Paper |
| Large deviations and moments for the Euler characteristic of a random surface | 2010-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3053050 | 2010-11-04 | Paper |
| Attribute estimation and testing quasi-symmetry | 2010-06-16 | Paper |
| Entropy and Expected Acceptance Counts for Finite Automata | 2008-12-21 | Paper |
| The Average Amount of Information Lost in Multiplication | 2008-12-21 | Paper |
| Fault tolerance in cellular automata at high fault rates | 2008-06-26 | Paper |
| Topological characteristics of random triangulated surfaces | 2006-06-06 | Paper |
| The Linking Probability of Deep Spider-Web Networks | 2006-06-01 | Paper |
| The Boolean functions computed by random Boolean formulas or how to grow the right function | 2006-01-10 | Paper |
| SRT Division Algorithms as Dynamical Systems | 2005-09-16 | Paper |
| The inequalities of quantum information theory | 2005-06-01 | Paper |
| The computational complexity of knot and link problems | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427884 | 2003-09-14 | Paper |
| The shortest disjunctive normal form of a random Boolean function | 2003-04-03 | Paper |
| Enumeration of Matchings in the Incidence Graphs of Complete and Complete Bipartite Graphs | 2003-01-05 | Paper |
| Characterizations of 1-Way Quantum Finite Automata | 2002-09-29 | Paper |
| Galois theory for minors of finite functions | 2002-08-29 | Paper |
| Quantum signal propagation in depolarizing channels | 2002-08-04 | Paper |
| Analysis of Carry Propagation in Addition: An Elementary Approach | 2002-07-11 | Paper |
| Enumeration of Equicolorable Trees | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4262014 | 2000-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4515740 | 2000-11-23 | Paper |
| Entropy and enumeration of Boolean functions | 2000-09-07 | Paper |
| Random interval graphs | 1999-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385520 | 1998-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4354427 | 1997-09-15 | Paper |
| Analysis of a Recurrence Arising from a Construction for Nonblocking Networks | 1997-05-25 | Paper |
| Regular languages and Stone duality | 1997-03-11 | Paper |
| Routing algorithms for switching networks with probabilistic traffic | 1997-01-07 | Paper |
| ON RANDOM KNOTS | 1996-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871051 | 1996-08-18 | Paper |
| Self-routing superconcentrators | 1996-07-16 | Paper |
| Parallel algorithms for routing in nonblocking networks | 1994-10-31 | Paper |
| Symmetry in self-correcting cellular automata | 1994-09-15 | Paper |
| Fault-Tolerant Circuit-Switching Networks | 1994-08-15 | Paper |
| An Elementary Approach to Some Analytic Asymptotics | 1994-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4201929 | 1993-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036708 | 1993-05-18 | Paper |
| The asymptotic optimality of spider-web networks | 1993-01-16 | Paper |
| Selection Networks | 1992-06-26 | Paper |
| The Expected Capacity of Concentrators | 1991-01-01 | Paper |
| The blocking probability of spider-web networks | 1991-01-01 | Paper |
| Parallel selection | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3352444 | 1990-01-01 | Paper |
| Asymptotic behavior of the chromatic index for hypergraphs | 1989-01-01 | Paper |
| Knots in random walks | 1989-01-01 | Paper |
| Random Sequential Adsorption on Graphs | 1989-01-01 | Paper |
| Invariance of complexity measures for networks with unreliable gates | 1989-01-01 | Paper |
| Correction to ``Computational complexity of algebraic functions | 1988-01-01 | Paper |
| Wide-Sense Nonblocking Networks | 1988-01-01 | Paper |
| Reliable computation by formulas in the presence of noise | 1988-01-01 | Paper |
| Fault Tolerance in Networks of Bounded Degree | 1988-01-01 | Paper |
| Expanding graphs contain all small trees | 1987-01-01 | Paper |
| The complexity of computations by networks | 1987-01-01 | Paper |
| Sorting and Selecting in Rounds | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3833998 | 1987-01-01 | Paper |
| Bounded-depth, polynomial-size circuits for symmetric functions | 1985-01-01 | Paper |
| Some Graph-Colouring Theorems with Applications to Generalized Connection Networks | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3716961 | 1985-01-01 | Paper |
| Bounding Fan-out in Logical Networks | 1984-01-01 | Paper |
| Parallel computation for well-endowed rings and space-bounded probabilistic machines | 1983-01-01 | Paper |
| Superconcentrators of depth 2 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3663189 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3947137 | 1982-01-01 | Paper |
| Rearrangeable Networks with Limited Depth | 1982-01-01 | Paper |
| Pebbling with an auxiliary pushdown | 1981-01-01 | Paper |
| Computational complexity of algebraic functions | 1981-01-01 | Paper |
| A fast parallel algorithm for routing in permutation networks | 1981-01-01 | Paper |
| Bounds on the performance of protocols for a multiple-access broadcast channel | 1981-01-01 | Paper |
| Algebraic Complexity Theory | 1981-01-01 | Paper |
| On another Boolean matrix | 1980-01-01 | Paper |
| On the Evaluation of Powers and Monomials | 1980-01-01 | Paper |
| A New Lower Bound for the Number of Switches in Rearrangeable Networks | 1980-01-01 | Paper |
| Optimal 2,3-Trees | 1979-01-01 | Paper |
| Optimal 2,3-Trees | 1979-01-01 | Paper |
| The minimum number of edges in graphs with prescribed paths | 1979-01-01 | Paper |
| On the Application of Coding Theory to Hashing | 1979-01-01 | Paper |
| Relations Among Complexity Measures | 1979-01-01 | Paper |
| On rearrangeable and non-blocking switching networks | 1978-01-01 | Paper |
| An explicit construction of short monotone formulae for the monotone symmetric functions | 1978-01-01 | Paper |
| The complexity of monotone boolean functions | 1978-01-01 | Paper |
| A Time-Space Trade-Off | 1978-01-01 | Paper |
| Generalized Connectors | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4177609 | 1978-01-01 | Paper |
| An information-theoretic method in combinatorial theory | 1977-01-01 | Paper |
| Superconcentrators | 1977-01-01 | Paper |
| Information theory and the complexity of boolean functions | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195962 | 1977-01-01 | Paper |
| Finding the median | 1976-01-01 | Paper |
| Shifting Graphs and Their Applications | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4143194 | 1976-01-01 | Paper |
| The inducibility of graphs | 1975-01-01 | Paper |
| On Crossbar Switching Networks | 1975-01-01 | Paper |
