| 2012 | FUN | M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns. | Ellen Gethner, David G. Kirkpatrick, Nicholas Pippenger |
| 2003 | ARITH | SRT Division Algorithms as Dynamical Systems. | Mark McCann, Nicholas Pippenger |
| 2002 | ISAAC | Expected Acceptance Counts for Finite Automata with Almost Uniform Input. | Nicholas Pippenger |
| 1997 | FOCS | The Computational Complexity of Knot and Link Problems. | Joel Hass, J. C. Lagarias, Nicholas Pippenger |
| 1996 | POPL | Pure versus Impure LISP. | Nicholas Pippenger |
| 1996 | STOC | Lower Bounds for Noisy Boolean Decision Trees. | William S. Evans, Nicholas Pippenger |
| 1993 | STOC | Self-routing superconcentrators. | Nicholas Pippenger |
| 1992 | ICALP | Polynomial Hash Functions Are Reliable (Extended Abstract). | Martin Dietzfelbinger, Joseph Gil, Yossi Matias, Nicholas Pippenger |
| 1992 | SPAA | Fault-Tolerant Circuit-Switching Networks. | Nicholas Pippenger, Geng Lin |
| 1991 | SPAA | Parallel Algorithms for Routing in Non-Blocking Networks. | Geng Lin, Nicholas Pippenger |
| 1990 | FOCS | Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions | Mike Paterson, Nicholas Pippenger, Uri Zwick |
| 1986 | STOC | Fault Tolerance in Networks of Bounded Degree (Preliminary Version) | Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal |
| 1986 | STOC | Non-Blocking Networks (Preliminary Version) | Paul Feldman, Joel Friedman, Nicholas Pippenger |
| 1985 | FOCS | On Networks of Noisy Gates | Nicholas Pippenger |
| 1984 | FOCS | Parallel Communication with Limited Buffers (Preliminary Version) | Nicholas Pippenger |
| 1984 | STOC | On Monotone Formulae with Restricted Depth (Preliminary Version) | Maria M. Klawe, Wolfgang J. Paul, Nicholas Pippenger, Mihalis Yannakakis |
| 1983 | FOCS | On Determinism versus Non-Determinism and Related Problems (Preliminary Version) | Wolfgang J. Paul, Nicholas Pippenger, Endre Szemerdi, William T. Trotter |
| 1983 | STOC | Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version) | Danny Dolev, Cynthia Dwork, Nicholas Pippenger, Avi Wigderson |
| 1982 | ICALP | Advances in Pebbling (Preliminary Version). | Nicholas Pippenger |
| 1982 | STOC | Probabilistic Simulations (Preliminary Version) | Nicholas Pippenger |
| 1980 | STOC | Comparative Schematology and Pebbling with Auxiliary Pushdowns (Preliminary Version) | Nicholas Pippenger |
| 1979 | FOCS | Computational Complexity in Algebraic Function Fields (Preliminary Version) | Nicholas Pippenger |
| 1979 | FOCS | On Simultaneous Resource Bounds (Preliminary Version) | Nicholas Pippenger |
| 1976 | FOCS | On the Evaluation of Powers and Related Problems (Preliminary Version) | Nicholas Pippenger |
| 1976 | STOC | The Realization of Monotone Boolean Functions (Preliminary Version) | Nicholas Pippenger |
| 1975 | FOCS | Information Theory and the Complexity of Switching Networks (Preliminary Version) | Nicholas Pippenger |