| Publication | Date of Publication | Type |
|---|
Counting the Angels and Devils in Escher's Circle Limit IV
Journal of Humanistic Mathematics | 2023-10-25 | Paper |
An elementary approach to some analytic asymptotics
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
A Formula for the Determinant
| 2022-05-31 | Paper |
Polynomial hash functions are reliable (extended abstract)
Automata, Languages and Programming | 2019-12-04 | Paper |
Systematic mistakes are likely in bounded optimal decision-making systems
Journal of Theoretical Biology | 2018-10-08 | Paper |
Asymptotic analysis of optimal nested group-testing procedures
Probability in the Engineering and Informational Sciences | 2017-09-19 | Paper |
On-the-Fly Algorithms and Sequential Machines
IEEE Transactions on Computers | 2017-07-27 | Paper |
On the enumeration of interval graphs
Proceedings of the American Mathematical Society, Series B | 2017-03-20 | Paper |
Self-intersections of Two-Dimensional Equilateral Random Walks and Polygons
| 2015-08-24 | Paper |
Self-routing superconcentrators
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Computational aspects of M. C. Escher's ribbon patterns
Theory of Computing Systems | 2015-01-21 | Paper |
Stochastic service systems, random interval graphs and search algorithms
Random Structures & Algorithms | 2014-11-17 | Paper |
Large-deviation bounds for sampling without replacement
American Mathematical Monthly | 2014-11-10 | Paper |
Carry propagation in multiplication by constants
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Barred preferential arrangements
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
Random cyclations
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
Fault tolerance in cellular automata at low fault rates
Journal of Computer and System Sciences | 2014-01-27 | Paper |
Efficient algorithms for Zeckendorf arithmetic
The Fibonacci Quarterly | 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
Networks | 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
The Electronic Journal of Combinatorics | 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
The American Mathematical Monthly | 2011-02-04 | Paper |
Large deviations and moments for the Euler characteristic of a random surface
Random Structures & Algorithms | 2010-12-14 | Paper |
scientific article; zbMATH DE number 5810075 (Why is no real title available?)
| 2010-11-04 | Paper |
Attribute estimation and testing quasi-symmetry
Information Processing Letters | 2010-06-16 | Paper |
Entropy and Expected Acceptance Counts for Finite Automata
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
The Average Amount of Information Lost in Multiplication
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Fault tolerance in cellular automata at high fault rates
Journal of Computer and System Sciences | 2008-06-26 | Paper |
Topological characteristics of random triangulated surfaces
Random Structures & Algorithms | 2006-06-06 | Paper |
The Linking Probability of Deep Spider-Web Networks
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
The Boolean functions computed by random Boolean formulas or how to grow the right function
Random Structures & Algorithms | 2006-01-10 | Paper |
SRT Division Algorithms as Dynamical Systems
SIAM Journal on Computing | 2005-09-16 | Paper |
The inequalities of quantum information theory
IEEE Transactions on Information Theory | 2005-06-01 | Paper |
The computational complexity of knot and link problems
Journal of the ACM | 2005-01-25 | Paper |
scientific article; zbMATH DE number 1979537 (Why is no real title available?)
| 2003-09-14 | Paper |
The shortest disjunctive normal form of a random Boolean function
Random Structures & Algorithms | 2003-04-03 | Paper |
Enumeration of Matchings in the Incidence Graphs of Complete and Complete Bipartite Graphs
SIAM Journal on Discrete Mathematics | 2003-01-05 | Paper |
Characterizations of 1-Way Quantum Finite Automata
SIAM Journal on Computing | 2002-09-29 | Paper |
Galois theory for minors of finite functions
Discrete Mathematics | 2002-08-29 | Paper |
Quantum signal propagation in depolarizing channels
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Analysis of Carry Propagation in Addition: An Elementary Approach
Journal of Algorithms | 2002-07-11 | Paper |
Enumeration of equicolorable trees
SIAM Journal on Discrete Mathematics | 2001-03-19 | Paper |
scientific article; zbMATH DE number 1334210 (Why is no real title available?)
| 2000-11-27 | Paper |
scientific article; zbMATH DE number 1535253 (Why is no real title available?)
| 2000-11-23 | Paper |
Entropy and enumeration of Boolean functions
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Random interval graphs
| 1999-12-19 | Paper |
scientific article; zbMATH DE number 1142304 (Why is no real title available?)
| 1998-05-04 | Paper |
scientific article; zbMATH DE number 1061261 (Why is no real title available?)
| 1997-09-15 | Paper |
Analysis of a Recurrence Arising from a Construction for Nonblocking Networks
SIAM Journal on Discrete Mathematics | 1997-05-25 | Paper |
Regular languages and Stone duality
Theory of Computing Systems | 1997-03-11 | Paper |
Routing algorithms for switching networks with probabilistic traffic
| 1997-01-07 | Paper |
ON RANDOM KNOTS
Journal of Knot Theory and Its Ramifications | 1996-10-03 | Paper |
scientific article; zbMATH DE number 861327 (Why is no real title available?)
| 1996-08-18 | Paper |
Self-routing superconcentrators
Journal of Computer and System Sciences | 1996-07-16 | Paper |
Parallel algorithms for routing in nonblocking networks
Mathematical Systems Theory | 1994-10-31 | Paper |
Symmetry in self-correcting cellular automata
Journal of Computer and System Sciences | 1994-09-15 | Paper |
Fault-Tolerant Circuit-Switching Networks
SIAM Journal on Discrete Mathematics | 1994-08-15 | Paper |
An Elementary Approach to Some Analytic Asymptotics
SIAM Journal on Mathematical Analysis | 1994-01-04 | Paper |
scientific article; zbMATH DE number 403945 (Why is no real title available?)
| 1993-09-06 | Paper |
scientific article; zbMATH DE number 176877 (Why is no real title available?)
| 1993-05-18 | Paper |
The asymptotic optimality of spider-web networks
Discrete Applied Mathematics | 1993-01-16 | Paper |
Selection Networks
SIAM Journal on Computing | 1992-06-26 | Paper |
The blocking probability of spider-web networks
Random Structures & Algorithms | 1991-01-01 | Paper |
The Expected Capacity of Concentrators
SIAM Journal on Discrete Mathematics | 1991-01-01 | Paper |
Parallel selection
Discrete Applied Mathematics | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4203669 (Why is no real title available?)
| 1990-01-01 | Paper |
Asymptotic behavior of the chromatic index for hypergraphs
Journal of Combinatorial Theory. Series A | 1989-01-01 | Paper |
Knots in random walks
Discrete Applied Mathematics | 1989-01-01 | Paper |
Invariance of complexity measures for networks with unreliable gates
Journal of the ACM | 1989-01-01 | Paper |
Random Sequential Adsorption on Graphs
SIAM Journal on Discrete Mathematics | 1989-01-01 | Paper |
Fault Tolerance in Networks of Bounded Degree
SIAM Journal on Computing | 1988-01-01 | Paper |
Wide-Sense Nonblocking Networks
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
Reliable computation by formulas in the presence of noise
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
Correction to ``Computational complexity of algebraic functions
Journal of Computer and System Sciences | 1988-01-01 | Paper |
Expanding graphs contain all small trees
Combinatorica | 1987-01-01 | Paper |
The complexity of computations by networks
IBM Journal of Research and Development | 1987-01-01 | Paper |
Sorting and Selecting in Rounds
SIAM Journal on Computing | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4110630 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 3946031 (Why is no real title available?)
| 1985-01-01 | Paper |
Bounded-depth, polynomial-size circuits for symmetric functions
Theoretical Computer Science | 1985-01-01 | Paper |
Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
SIAM Journal on Algebraic Discrete Methods | 1985-01-01 | Paper |
Bounding Fan-out in Logical Networks
Journal of the ACM | 1984-01-01 | Paper |
Parallel computation for well-endowed rings and space-bounded probabilistic machines
Information and Control | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3765164 (Why is no real title available?)
| 1982-01-01 | Paper |
Superconcentrators of depth 2
Journal of Computer and System Sciences | 1982-01-01 | Paper |
Rearrangeable Networks with Limited Depth
SIAM Journal on Algebraic Discrete Methods | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3815534 (Why is no real title available?)
| 1982-01-01 | Paper |
Bounds on the performance of protocols for a multiple-access broadcast channel
IEEE Transactions on Information Theory | 1981-01-01 | Paper |
A fast parallel algorithm for routing in permutation networks
IEEE Transactions on Computers | 1981-01-01 | Paper |
Algebraic Complexity Theory
IBM Journal of Research and Development | 1981-01-01 | Paper |
Computational complexity of algebraic functions
Journal of Computer and System Sciences | 1981-01-01 | Paper |
Pebbling with an auxiliary pushdown
Journal of Computer and System Sciences | 1981-01-01 | Paper |
On another Boolean matrix
Theoretical Computer Science | 1980-01-01 | Paper |
On the Evaluation of Powers and Monomials
SIAM Journal on Computing | 1980-01-01 | Paper |
A New Lower Bound for the Number of Switches in Rearrangeable Networks
SIAM Journal on Algebraic Discrete Methods | 1980-01-01 | Paper |
On the Application of Coding Theory to Hashing
IBM Journal of Research and Development | 1979-01-01 | Paper |
Relations Among Complexity Measures
Journal of the ACM | 1979-01-01 | Paper |
Optimal 2,3-Trees
SIAM Journal on Computing | 1979-01-01 | Paper |
Optimal 2,3-Trees
SIAM Journal on Computing | 1979-01-01 | Paper |
The minimum number of edges in graphs with prescribed paths
Mathematical Systems Theory | 1979-01-01 | Paper |
On rearrangeable and non-blocking switching networks
Journal of Computer and System Sciences | 1978-01-01 | Paper |
The complexity of monotone boolean functions
Mathematical Systems Theory | 1978-01-01 | Paper |
scientific article; zbMATH DE number 3613090 (Why is no real title available?)
| 1978-01-01 | Paper |
An explicit construction of short monotone formulae for the monotone symmetric functions
Theoretical Computer Science | 1978-01-01 | Paper |
A Time-Space Trade-Off
Journal of the ACM | 1978-01-01 | Paper |
Generalized Connectors
SIAM Journal on Computing | 1978-01-01 | Paper |
Superconcentrators
SIAM Journal on Computing | 1977-01-01 | Paper |
Information theory and the complexity of boolean functions
Mathematical Systems Theory | 1977-01-01 | Paper |
An information-theoretic method in combinatorial theory
Journal of Combinatorial Theory. Series A | 1977-01-01 | Paper |
scientific article; zbMATH DE number 3635514 (Why is no real title available?)
| 1977-01-01 | Paper |
Finding the median
Journal of Computer and System Sciences | 1976-01-01 | Paper |
Shifting Graphs and Their Applications
Journal of the ACM | 1976-01-01 | Paper |
scientific article; zbMATH DE number 3572044 (Why is no real title available?)
| 1976-01-01 | Paper |
The inducibility of graphs
Journal of Combinatorial Theory. Series B | 1975-01-01 | Paper |
On Crossbar Switching Networks
IEEE Transactions on Communications | 1975-01-01 | Paper |
