On the Complexity of Strictly Nonblocking Concentration Networks. - Nicholas Pippenger (IEEE Trans. Commun., 1974)

Information Theory and the Complexity of Switching Networks (Preliminary Version) - Nicholas Pippenger (FOCS, 1975)

On Crossbar Switching Networks. - Nicholas Pippenger (IEEE Trans. Commun., 1975)

On the Evaluation of Powers and Related Problems (Preliminary Version) - Nicholas Pippenger (FOCS, 1976)

The Realization of Monotone Boolean Functions (Preliminary Version) - Nicholas Pippenger (STOC, 1976)

Shifting Graphs and Their Applications. - Nicholas Pippenger; Leslie G. Valiant (J. ACM, 1976)

Finding the Median. - Arnold Schönhage; Mike Paterson; Nicholas Pippenger (J. Comput. Syst. Sci., 1976)

An Information-Theoretic Method in Combinatorial Theory. - Nicholas Pippenger (J. Comb. Theory A, 1977)

Information Theory and the Complexity of Boolean Functions. - Nicholas Pippenger (Math. Syst. Theory, 1977)

Superconcentrators. - Nicholas Pippenger (SIAM J. Comput., 1977)

A Time-Space Trade-Off. - Nicholas Pippenger (J. ACM, 1978)

On Rearrangeable and Non-Blocking Switching Networks. - Nicholas Pippenger (J. Comput. Syst. Sci., 1978)

The Complexity of Monotone Boolean Functions. - Nicholas Pippenger (Math. Syst. Theory, 1978)

Generalized Connectors. - Nicholas Pippenger (SIAM J. Comput., 1978)

An Explicit Construction of Short Monotone Formulae for the Monotone Symmetric Functions. - Mark Kleiman; Nicholas Pippenger (Theor. Comput. Sci., 1978)

Computational Complexity in Algebraic Function Fields (Preliminary Version) - Nicholas Pippenger (FOCS, 1979)

On Simultaneous Resource Bounds (Preliminary Version) - Nicholas Pippenger (FOCS, 1979)

Communication: On the Application of Coding Theory to Hashing. - Nicholas Pippenger (IBM J. Res. Dev., 1979)

Relations Among Complexity Measures. - Nicholas Pippenger; Michael J. Fischer (J. ACM, 1979)

The Minimum Number of Edges in Graphs with Prescribed Paths. - Nicholas Pippenger (Math. Syst. Theory, 1979)

Optimal 2, 3-Trees. - Raymond E. Miller; Nicholas Pippenger; Arnold L. Rosenberg; Lawrence Snyder 001 (SIAM J. Comput., 1979)

Extendible Hashing - A Fast Access Method for Dynamic Files. - Ronald Fagin; Jürg Nievergelt; Nicholas Pippenger; H. Raymond Strong (ACM Trans. Database Syst., 1979)

Comparative Schematology and Pebbling with Auxiliary Pushdowns (Preliminary Version) - Nicholas Pippenger (STOC, 1980)

On the Evaluation of Powers and Monomials. - Nicholas Pippenger (SIAM J. Comput., 1980)

A New Lower Bound for the Number of Switches in Rearrangeable Networks. - Nicholas Pippenger (SIAM J. Algebraic Discret. Methods, 1980)

On Another Boolean Matrix. - Nicholas Pippenger (Theor. Comput. Sci., 1980)

Algebraic Complexity Theory. - Nicholas Pippenger (IBM J. Res. Dev., 1981)

Computational Complexity of Algebraic Functions. - Nicholas Pippenger (J. Comput. Syst. Sci., 1981)

Pebbling with an Auxiliary Pushdown. - Nicholas Pippenger (J. Comput. Syst. Sci., 1981)

A Fast Parallel Algorithm for Routing in Permutation Networks. - Gavriela Freund Lev; Nicholas Pippenger; Leslie G. Valiant (IEEE Trans. Computers, 1981)

Bounds on the performance of protocols for a multiple-access broadcast channel . - Nicholas Pippenger (IEEE Trans. Inf. Theory, 1981)

Advances in Pebbling (Preliminary Version). - Nicholas Pippenger (ICALP, 1982)

Probabilistic Simulations (Preliminary Version) - Nicholas Pippenger (STOC, 1982)

Superconcentrators of Depth 2. - Nicholas Pippenger (J. Comput. Syst. Sci., 1982)

On Determinism versus Non-Determinism and Related Problems (Preliminary Version) - Wolfgang J. Paul; Nicholas Pippenger; Endre Szemerédi; William T. Trotter (FOCS, 1983)

Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version) - Danny Dolev; Cynthia Dwork; Nicholas Pippenger; Avi Wigderson (STOC, 1983)

Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines - Allan Borodin; Stephen A. Cook; Nicholas Pippenger (Inf. Control., 1983)

Parallel Communication with Limited Buffers (Preliminary Version) - Nicholas Pippenger (FOCS, 1984)

On Monotone Formulae with Restricted Depth (Preliminary Version) - Maria M. Klawe; Wolfgang J. Paul; Nicholas Pippenger; Mihalis Yannakakis (STOC, 1984)

Bounding Fan-out in Logical Networks. - H. James Hoover; Maria M. Klawe; Nicholas Pippenger (J. ACM, 1984)

On Networks of Noisy Gates - Nicholas Pippenger (FOCS, 1985)

Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions. - Ronald Fagin; Maria M. Klawe; Nicholas Pippenger; Larry J. Stockmeyer (Theor. Comput. Sci., 1985)

Fault Tolerance in Networks of Bounded Degree (Preliminary Version) - Cynthia Dwork; David Peleg; Nicholas Pippenger; Eli Upfal (STOC, 1986)

Non-Blocking Networks (Preliminary Version) - Paul Feldman; Joel Friedman; Nicholas Pippenger (STOC, 1986)

Alphabetic Minimax Trees of Degree at Most t. - Don Coppersmith; Maria M. Klawe; Nicholas Pippenger (SIAM J. Comput., 1986)

Expanding graphs contain all small trees. - Joel Friedman; Nicholas Pippenger (Comb., 1987)

The Complexity of Computations by Networks. - Nicholas Pippenger (IBM J. Res. Dev., 1987)

Sorting and Selecting in Rounds. - Nicholas Pippenger (SIAM J. Comput., 1987)

Correction to "Computational Complexity of Algebraic Functions". - Nicholas Pippenger (J. Comput. Syst. Sci., 1988)

Fault Tolerance in Networks of Bounded Degree. - Cynthia Dwork; David Peleg; Nicholas Pippenger; Eli Upfal (SIAM J. Comput., 1988)

Wide-Sense Nonblocking Networks. - Paul Feldman; Joel Friedman; Nicholas Pippenger (SIAM J. Discret. Math., 1988)

Reliable computation by formulas in the presence of noise. - Nicholas Pippenger (IEEE Trans. Inf. Theory, 1988)

Analysis of Error Correction by Majority Voting. - Nicholas Pippenger (Adv. Comput. Res., 1989)

Knots in random walks. - Nicholas Pippenger (Discret. Appl. Math., 1989)

Invariance of complexity measures for networks with unreliable gates. - Nicholas Pippenger (J. ACM, 1989)

Asymptotic behavior of the chromatic index for hypergraphs. - Nicholas Pippenger; Joel H. Spencer (J. Comb. Theory A, 1989)

Random Sequential Adsorption on Graphs. - Nicholas Pippenger (SIAM J. Discret. Math., 1989)

Communication Networks. - Nicholas Pippenger (Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), 1990)

Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions - Mike Paterson; Nicholas Pippenger; Uri Zwick (FOCS, 1990)

Parallel selection. - Yossi Azar; Nicholas Pippenger (Discret. Appl. Math., 1990)

Parallel Algorithms for Routing in Non-Blocking Networks. - Geng Lin; Nicholas Pippenger (SPAA, 1991)

The Blocking Probability of Spider-Web Networks. - Nicholas Pippenger (Random Struct. Algorithms, 1991)

Selection Networks. - Nicholas Pippenger (SIAM J. Comput., 1991)

The Expected Capacity of Concentrators. - Nicholas Pippenger (SIAM J. Discret. Math., 1991)

On a lower bound for the redundancy of reliable networks with noisy gates. - Nicholas Pippenger; George D. Stamoulis; John N. Tsitsiklis (IEEE Trans. Inf. Theory, 1991)

Polynomial Hash Functions Are Reliable (Extended Abstract). - Martin Dietzfelbinger; Joseph Gil; Yossi Matias; Nicholas Pippenger (ICALP, 1992)

An Elementary Approach to Some Analytic Asymptotics. - Nicholas Pippenger (SWAT, 1992)

The Asymptotic Optimality of Spider-Web Networks. - Nicholas Pippenger (Discret. Appl. Math., 1992)

Juggling Networks. - Nicholas Pippenger (Canada-France Conference on Parallel and Distributed Computing, 1994)

Symmetry in Self-Correcting Cellular Automata. - Nicholas Pippenger (J. Comput. Syst. Sci., 1994)

Parallel Algorithms for Routing in Nonblocking Networks. - Geng Lin; Nicholas Pippenger (Math. Syst. Theory, 1994)

Fault-Tolerant Circuit-Switching Networks. - Nicholas Pippenger; Geng Lin (SIAM J. Discret. Math., 1994)

Analysis of a Recurrence Arising from a Construction for Nonblocking Networks. - Nicholas Pippenger (SIAM J. Discret. Math., 1995)

Lower Bounds for Noisy Boolean Decision Trees. - William S. Evans; Nicholas Pippenger (STOC, 1996)

Self-Routing Superconcentrators. - Nicholas Pippenger (J. Comput. Syst. Sci., 1996)

Routing algorithms for switching networks with probabilistic traffic. - Geng Lin; Nicholas Pippenger (Networks, 1996)

Theories of computability. - Nicholas Pippenger (Cambridge University Press, 1997)

Average-case bounds for the complexity of path-search. - Nicholas Pippenger (Advances in Switching Networks, 1997)

Regular Languages and Stone Duality. - Nicholas Pippenger (Theory Comput. Syst., 1997)

Pure Versus Impure Lisp. - Nicholas Pippenger (ACM Trans. Program. Lang. Syst., 1997)

Random interval graphs. - Nicholas Pippenger (Random Struct. Algorithms, 1998)

Average-Case Lower Bounds for Noisy Boolean Decision Trees. - William S. Evans; Nicholas Pippenger (SIAM J. Comput., 1998)

On the Maximum Tolerable Noise for Reliable Computation by Formulas. - William S. Evans; Nicholas Pippenger (IEEE Trans. Inf. Theory, 1998)

The Computational Complexity of Knot and Link Problems. - Joel Hass; J. C. Lagarias 001; Nicholas Pippenger (J. ACM, 1999)

Upper and lower bounds for the average-case complexity of path-search. - Nicholas Pippenger (Networks, 1999)

Entropy and enumeration of boolean functions. - Nicholas Pippenger (IEEE Trans. Inf. Theory, 1999)

Enumeration of Equicolorable Trees. - Nicholas Pippenger (SIAM J. Discret. Math., 2001)

Expected Acceptance Counts for Finite Automata with Almost Uniform Input. - Nicholas Pippenger (ISAAC, 2002)

Galois theory for minors of finite functions. - Nicholas Pippenger (Discret. Math., 2002)

Analysis of Carry Propagation in Addition: An Elementary Approach. - Nicholas Pippenger (J. Algorithms, 2002)

Characterizations of 1-Way Quantum Finite Automata. - Alex Brodsky; Nicholas Pippenger (SIAM J. Comput., 2002)

Enumeration of Matchings in the Incidence Graphs of Complete and Complete Bipartite Graphs. - Nicholas Pippenger (SIAM J. Discret. Math., 2002)

Quantum signal propagation in depolarizing channels. - Nicholas Pippenger (IEEE Trans. Inf. Theory, 2002)

The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function - Alex Brodsky; Nicholas Pippenger (CoRR, 2003)

The shortest disjunctive normal form of a random Boolean function. - Nicholas Pippenger (Random Struct. Algorithms, 2003)

The inequalities of quantum information theory. - Nicholas Pippenger (IEEE Trans. Inf. Theory, 2003)

Entropy and expected acceptance counts for finite automata. - Nicholas Pippenger (IEEE Trans. Inf. Theory, 2004)

SRT Division Algorithms as Dynamical Systems. - Mark McCann; Nicholas Pippenger (SIAM J. Comput., 2005)

The average amount of information lost in multiplication. - Nicholas Pippenger (IEEE Trans. Inf. Theory, 2005)

Topological characteristics of random triangulated surfaces. - Nicholas Pippenger; Kristin Schleich (Random Struct. Algorithms, 2006)

The Linking Probability of Deep Spider-Web Networks. - Nicholas Pippenger (SIAM J. Discret. Math., 2006)

A method for entity identification in open source documents with partially redacted attributes. - Ningning Wu; John R. Talburt; Christopher Heien; Nicholas Pippenger; Chia-Chu Chiang; Elizabeth M. Pierce; Ebony Gulley; JaMia Moore (J. Comput. Sci. Coll., 2007)

Fault tolerance in cellular automata at high fault rates. - Mark McCann; Nicholas Pippenger (J. Comput. Syst. Sci., 2008)

Attribute estimation and testing quasi-symmetry. - Krzysztof Majewski; Nicholas Pippenger (Inf. Process. Lett., 2009)

Large deviations and moments for the Euler characteristic of a random surface. - Kevin Fleming; Nicholas Pippenger (Random Struct. Algorithms, 2010)

A Census of Vertices by Generations in Regular Tessellations of the Plane. - Alice Paul; Nicholas Pippenger (Electron. J. Comb., 2011)

The M/M/Infinity Service System with Ranked Servers in Heavy Traffic - Patrick Eschenfeldt; Ben Gross; Nicholas Pippenger (CoRR, 2011)

Analysis of an M/M/1 Queue Using Fixed Order of Search for Arrivals and Service - Patrick Eschenfeldt; Ben Gross; Nicholas Pippenger (CoRR, 2011)

Carry propagation in multiplication by constants. - Alexander Izsak; Nicholas Pippenger (ACM Trans. Algorithms, 2011)

Two Extensions of Results of Archimedes. - Nicholas Pippenger (Am. Math. Mon., 2011)

On-the-Fly Algorithms and Sequential Machines. - Nicholas Pippenger (IEEE Trans. Computers, 2011)

M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns. - Ellen Gethner; David G. Kirkpatrick; Nicholas Pippenger (FUN, 2012)

Efficient Algorithms for Zeckendorf Arithmetic - Connor Ahlbach; Jeremy Usatine; Nicholas Pippenger (CoRR, 2012)

Barred Preferential Arrangements. - Connor Ahlbach; Jeremy Usatine; Nicholas Pippenger (Electron. J. Comb., 2013)

Random Cyclations. - Nicholas Pippenger (Electron. J. Comb., 2013)

Gap Theorems for the Delay of Circuits Simulating Finite Automata. - Connor Ahlbach; Jeremy Usatine; Nicholas Pippenger (CoRR, 2013)

Fault tolerance in cellular automata at low fault rates. - Mark McCann; Nicholas Pippenger (J. Comput. Syst. Sci., 2013)

Local versus global search in channel graphs. - A. H. Hunter; Nicholas Pippenger (Networks, 2013)

Computational Aspects of M.C. Escher's Ribbon Patterns. - Ellen Gethner; David G. Kirkpatrick; Nicholas Pippenger (Theory Comput. Syst., 2014)

Stochastic service systems, random interval graphs and search algorithms. - Patrick Eschenfeldt; Ben Gross; Nicholas Pippenger (Random Struct. Algorithms, 2014)

Large-Deviation Bounds for Sampling without Replacement. - Kyle Luh; Nicholas Pippenger (Am. Math. Mon., 2014)

Asymptotic Analysis of Run-Length Encoding. - Nabil Zaman; Nicholas Pippenger (CoRR, 2015)

A Formula for the Determinant. - Nicholas Pippenger (CoRR, 2022)

Computation with Limited Space. - Nicholas Pippenger (Logic, Automata, and Computational Complexity, 2023)