The following pages link to Nicholas J. Pippenger (Q489753):
Displayed 50 items.
- (Q394334) (redirect page) (← links)
- Fault tolerance in cellular automata at low fault rates (Q394335) (← links)
- Barred preferential arrangements (Q396771) (← links)
- Random cyclations (Q396919) (← links)
- Computational aspects of M. C. Escher's ribbon patterns (Q489754) (← links)
- A census of vertices by generations in regular tessellations of the plane (Q540084) (← links)
- (Q675859) (redirect page) (← links)
- Regular languages and Stone duality (Q675860) (← links)
- Asymptotic behavior of the chromatic index for hypergraphs (Q805633) (← links)
- Parallel selection (Q913517) (← links)
- Fault tolerance in cellular automata at high fault rates (Q931732) (← links)
- Attribute estimation and testing quasi-symmetry (Q976083) (← links)
- Bounded-depth, polynomial-size circuits for symmetric functions (Q1063574) (← links)
- Expanding graphs contain all small trees (Q1092058) (← links)
- Correction to ``Computational complexity of algebraic functions'' (Q1109564) (← links)
- On another Boolean matrix (Q1137982) (← links)
- Pebbling with an auxiliary pushdown (Q1156489) (← links)
- Computational complexity of algebraic functions (Q1157164) (← links)
- Superconcentrators of depth 2 (Q1162816) (← links)
- The asymptotic optimality of spider-web networks (Q1199446) (← links)
- The inducibility of graphs (Q1227631) (← links)
- Finding the median (Q1229583) (← links)
- An information-theoretic method in combinatorial theory (Q1239715) (← links)
- On rearrangeable and non-blocking switching networks (Q1250088) (← links)
- An explicit construction of short monotone formulae for the monotone symmetric functions (Q1251639) (← links)
- Symmetry in self-correcting cellular automata (Q1333401) (← links)
- Galois theory for minors of finite functions (Q1613555) (← links)
- Systematic mistakes are likely in bounded optimal decision-making systems (Q1788459) (← links)
- Knots in random walks (Q1823511) (← links)
- Self-routing superconcentrators (Q1915504) (← links)
- Enumeration of Equicolorable Trees (Q2706191) (← links)
- Efficient Algorithms for Zeckendorf Arithmetic (Q2868803) (← links)
- Large-Deviation Bounds for Sampling without Replacement (Q2928644) (← links)
- Stochastic service systems, random interval graphs and search algorithms (Q2930056) (← links)
- On the enumeration of interval graphs (Q2968575) (← links)
- Bounding Fan-out in Logical Networks (Q3030723) (← links)
- (Q3053050) (← links)
- Large deviations and moments for the Euler characteristic of a random surface (Q3061182) (← links)
- Two Extensions of Results of Archimedes (Q3072550) (← links)
- An Elementary Approach to Some Analytic Asymptotics (Q3142816) (← links)
- Characterizations of 1-Way Quantum Finite Automata (Q3149877) (← links)
- The computational complexity of knot and link problems (Q3158535) (← links)
- Carry propagation in multiplication by constants (Q3189040) (← links)
- The Expected Capacity of Concentrators (Q3200547) (← links)
- The blocking probability of spider-web networks (Q3351314) (← links)
- (Q3352444) (← links)
- Entropy and Expected Acceptance Counts for Finite Automata (Q3547487) (← links)
- The Average Amount of Information Lost in Multiplication (Q3547490) (← links)
- (Q3663189) (← links)
- Some Graph-Colouring Theorems with Applications to Generalized Connection Networks (Q3689205) (← links)