Nicholas Pippenger

Publication Activity (10 Years)

Years Active: 1974-2022
Publications (10 Years): 1

Top Venues

CoRR

Electron. J. Comb.

J. Comput. Syst. Sci.

Am. Math. Mon.

Publications

Nicholas Pippenger
A Formula for the Determinant. CoRR (2022)
Nabil Zaman, Nicholas Pippenger
Asymptotic Analysis of Run-Length Encoding. CoRR (2015)
Patrick Eschenfeldt, Ben Gross, Nicholas Pippenger
Stochastic service systems, random interval graphs and search algorithms. Random Struct. Algorithms 45 (3) (2014)
Ellen Gethner, David G. Kirkpatrick, Nicholas Pippenger
Computational Aspects of M.C. Escher's Ribbon Patterns. Theory Comput. Syst. 54 (4) (2014)
Kyle Luh, Nicholas Pippenger
Large-Deviation Bounds for Sampling without Replacement. Am. Math. Mon. 121 (5) (2014)
A. H. Hunter, Nicholas Pippenger
Local versus global search in channel graphs. Networks 62 (1) (2013)
Connor Ahlbach, Jeremy Usatine, Nicholas Pippenger
Barred Preferential Arrangements. Electron. J. Comb. 20 (2) (2013)
Mark McCann, Nicholas Pippenger
Fault tolerance in cellular automata at low fault rates. J. Comput. Syst. Sci. 79 (7) (2013)
Connor Ahlbach, Jeremy Usatine, Nicholas Pippenger
Gap Theorems for the Delay of Circuits Simulating Finite Automata. CoRR (2013)
Nicholas Pippenger
Random Cyclations. Electron. J. Comb. 20 (4) (2013)
Connor Ahlbach, Jeremy Usatine, Nicholas Pippenger
Efficient Algorithms for Zeckendorf Arithmetic CoRR (2012)
Mark McCann, Nicholas Pippenger
Fault Tolerance in Cellular Automata at Low Fault Rates CoRR (2012)
Ellen Gethner, David G. Kirkpatrick, Nicholas Pippenger
M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns. FUN (2012)
Patrick Eschenfeldt, Ben Gross, Nicholas Pippenger
Analysis of an M/M/1 Queue Using Fixed Order of Search for Arrivals and Service CoRR (2011)
Patrick Eschenfeldt, Ben Gross, Nicholas Pippenger
Stochastic Service Systems, Random Interval Graphs and Search Algorithms CoRR (2011)
Patrick Eschenfeldt, Ben Gross, Nicholas Pippenger
The M/M/Infinity Service System with Ranked Servers in Heavy Traffic CoRR (2011)
Alexander Izsak, Nicholas Pippenger
Carry propagation in multiplication by constants. ACM Trans. Algorithms 7 (4) (2011)
Nicholas Pippenger
On-the-Fly Algorithms and Sequential Machines. IEEE Trans. Computers 60 (9) (2011)
Nicholas Pippenger
Two Extensions of Results of Archimedes. Am. Math. Mon. 118 (1) (2011)
Alice Paul, Nicholas Pippenger
A Census of Vertices by Generations in Regular Tessellations of the Plane. Electron. J. Comb. 18 (1) (2011)
A. H. Hunter, Nicholas Pippenger
Local versus Global Search in Channel Graphs CoRR (2010)
Kevin Fleming, Nicholas Pippenger
Large deviations and moments for the Euler characteristic of a random surface. Random Struct. Algorithms 37 (4) (2010)
Krzysztof Majewski, Nicholas Pippenger
Attribute estimation and testing quasi-symmetry. Inf. Process. Lett. 109 (4) (2009)
Mark McCann, Nicholas Pippenger
Fault tolerance in cellular automata at high fault rates. J. Comput. Syst. Sci. 74 (5) (2008)
Krzysztof Majewski, Nicholas Pippenger
Attribute Estimation and Testing Quasi-Symmetry CoRR (2007)
Nicholas Pippenger
The Linking Probability of Deep Spider-Web Networks. SIAM J. Discret. Math. 20 (1) (2006)
Nicholas Pippenger, Kristin Schleich
Topological characteristics of random triangulated surfaces. Random Struct. Algorithms 28 (3) (2006)
Nicholas Pippenger
The average amount of information lost in multiplication. IEEE Trans. Inf. Theory 51 (2) (2005)
Mark McCann, Nicholas Pippenger
SRT Division Algorithms as Dynamical Systems. SIAM J. Comput. 34 (6) (2005)
Nicholas Pippenger
Entropy and expected acceptance counts for finite automata. IEEE Trans. Inf. Theory 50 (1) (2004)
Nicholas Pippenger
The inequalities of quantum information theory. IEEE Trans. Inf. Theory 49 (4) (2003)
Alex Brodsky, Nicholas Pippenger
The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function CoRR (2003)
Nicholas Pippenger
The shortest disjunctive normal form of a random Boolean function. Random Struct. Algorithms 22 (2) (2003)
Mark McCann, Nicholas Pippenger
SRT Division Algorithms as Dynamical Systems. IEEE Symposium on Computer Arithmetic (2003)
Nicholas Pippenger
Galois theory for minors of finite functions. Discret. Math. 254 (1-3) (2002)
Alex Brodsky, Nicholas Pippenger
Characterizations of 1-Way Quantum Finite Automata. SIAM J. Comput. 31 (5) (2002)
Nicholas Pippenger
Quantum signal propagation in depolarizing channels. IEEE Trans. Inf. Theory 48 (1) (2002)
Nicholas Pippenger
Expected Acceptance Counts for Finite Automata with Almost Uniform Input. ISAAC (2002)
Nicholas Pippenger
Analysis of Carry Propagation in Addition: An Elementary Approach. J. Algorithms 42 (2) (2002)
Nicholas Pippenger
Enumeration of Matchings in the Incidence Graphs of Complete and Complete Bipartite Graphs. SIAM J. Discret. Math. 16 (1) (2002)
Nicholas Pippenger
Enumeration of Equicolorable Trees. SIAM J. Discret. Math. 14 (1) (2001)
Joel Hass, J. C. Lagarias, Nicholas Pippenger
The Computational Complexity of Knot and Link Problems. J. ACM 46 (2) (1999)
Nicholas Pippenger
Upper and lower bounds for the average-case complexity of path-search. Networks 33 (4) (1999)
Nicholas Pippenger
Entropy and enumeration of boolean functions. IEEE Trans. Inf. Theory 45 (6) (1999)
Nicholas Pippenger
Random interval graphs. Random Struct. Algorithms 12 (4) (1998)
William S. Evans, Nicholas Pippenger
On the Maximum Tolerable Noise for Reliable Computation by Formulas. IEEE Trans. Inf. Theory 44 (3) (1998)
William S. Evans, Nicholas Pippenger
Average-Case Lower Bounds for Noisy Boolean Decision Trees. SIAM J. Comput. 28 (2) (1998)
Nicholas Pippenger
Pure Versus Impure Lisp. ACM Trans. Program. Lang. Syst. 19 (2) (1997)
Joel Hass, J. C. Lagarias, Nicholas Pippenger
The Computational Complexity of Knot and Link Problems. FOCS (1997)
Nicholas Pippenger
Regular Languages and Stone Duality. Theory Comput. Syst. 30 (2) (1997)
Nicholas Pippenger
Average-case bounds for the complexity of path-search. Advances in Switching Networks (1997)
Geng Lin, Nicholas Pippenger
Routing algorithms for switching networks with probabilistic traffic. Networks 28 (1) (1996)
Nicholas Pippenger
Self-Routing Superconcentrators. J. Comput. Syst. Sci. 52 (1) (1996)
Nicholas Pippenger
Pure versus Impure LISP. POPL (1996)
William S. Evans, Nicholas Pippenger
Lower Bounds for Noisy Boolean Decision Trees. STOC (1996)
Nicholas Pippenger
Analysis of a Recurrence Arising from a Construction for Nonblocking Networks. SIAM J. Discret. Math. 8 (2) (1995)
Nicholas Pippenger
Symmetry in Self-Correcting Cellular Automata. J. Comput. Syst. Sci. 49 (1) (1994)
Geng Lin, Nicholas Pippenger
Parallel Algorithms for Routing in Nonblocking Networks. Math. Syst. Theory 27 (1) (1994)
Nicholas Pippenger, Geng Lin
Fault-Tolerant Circuit-Switching Networks. SIAM J. Discret. Math. 7 (1) (1994)
Nicholas Pippenger
Juggling Networks. Canada-France Conference on Parallel and Distributed Computing (1994)
Nicholas Pippenger
Self-routing superconcentrators. STOC (1993)
Martin Dietzfelbinger, Joseph Gil, Yossi Matias, Nicholas Pippenger
Polynomial Hash Functions Are Reliable (Extended Abstract). ICALP (1992)
Nicholas Pippenger
An Elementary Approach to Some Analytic Asymptotics. SWAT (1992)
Nicholas Pippenger
The Asymptotic Optimality of Spider-Web Networks. Discret. Appl. Math. (1992)
Nicholas Pippenger, Geng Lin
Fault-Tolerant Circuit-Switching Networks. SPAA (1992)
Nicholas Pippenger
Selection Networks. SIAM J. Comput. 20 (5) (1991)
Nicholas Pippenger
The Expected Capacity of Concentrators. SIAM J. Discret. Math. 4 (1) (1991)
Nicholas Pippenger
The Blocking Probability of Spider-Web Networks. Random Struct. Algorithms 2 (2) (1991)
Nicholas Pippenger, George D. Stamoulis, John N. Tsitsiklis
On a lower bound for the redundancy of reliable networks with noisy gates. IEEE Trans. Inf. Theory 37 (3) (1991)
Geng Lin, Nicholas Pippenger
Parallel Algorithms for Routing in Non-Blocking Networks. SPAA (1991)
Yossi Azar, Nicholas Pippenger
Parallel selection. Discret. Appl. Math. 27 (1-2) (1990)
Nicholas Pippenger
Selection Networks. SIGAL International Symposium on Algorithms (1990)
Mike Paterson, Nicholas Pippenger, Uri Zwick
Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions FOCS (1990)
Nicholas Pippenger
Random Sequential Adsorption on Graphs. SIAM J. Discret. Math. 2 (3) (1989)
Nicholas Pippenger, Joel H. Spencer
Asymptotic behavior of the chromatic index for hypergraphs. J. Comb. Theory, Ser. A 51 (1) (1989)
Nicholas Pippenger
Knots in random walks. Discret. Appl. Math. 25 (3) (1989)
Nicholas Pippenger
Analysis of Error Correction by Majority Voting. Adv. Comput. Res. 5 (1989)
Nicholas Pippenger
Invariance of complexity measures for networks with unreliable gates. J. ACM 36 (3) (1989)
Paul Feldman, Joel Friedman, Nicholas Pippenger
Wide-Sense Nonblocking Networks. SIAM J. Discret. Math. 1 (2) (1988)
Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal
Fault Tolerance in Networks of Bounded Degree. SIAM J. Comput. 17 (5) (1988)
Nicholas Pippenger
Reliable computation by formulas in the presence of noise. IEEE Trans. Inf. Theory 34 (2) (1988)
Nicholas Pippenger
Correction to "Computational Complexity of Algebraic Functions". J. Comput. Syst. Sci. 37 (3) (1988)
Joel Friedman, Nicholas Pippenger
Expanding graphs contain all small trees. Comb. 7 (1) (1987)
Nicholas Pippenger
The Complexity of Computations by Networks. IBM J. Res. Dev. 31 (2) (1987)
Nicholas Pippenger
Sorting and Selecting in Rounds. SIAM J. Comput. 16 (6) (1987)
Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal
Fault Tolerance in Networks of Bounded Degree (Preliminary Version) STOC (1986)
Paul Feldman, Joel Friedman, Nicholas Pippenger
Non-Blocking Networks (Preliminary Version) STOC (1986)
Don Coppersmith, Maria M. Klawe, Nicholas Pippenger
Alphabetic Minimax Trees of Degree at Most t. SIAM J. Comput. 15 (1) (1986)
Ronald Fagin, Maria M. Klawe, Nicholas Pippenger, Larry J. Stockmeyer
Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions. Theor. Comput. Sci. 36 (1985)
Nicholas Pippenger
On Networks of Noisy Gates FOCS (1985)
Maria M. Klawe, Wolfgang J. Paul, Nicholas Pippenger, Mihalis Yannakakis
On Monotone Formulae with Restricted Depth (Preliminary Version) STOC (1984)
Nicholas Pippenger
Parallel Communication with Limited Buffers (Preliminary Version) FOCS (1984)
H. James Hoover, Maria M. Klawe, Nicholas Pippenger
Bounding Fan-out in Logical Networks. J. ACM 31 (1) (1984)
Allan Borodin, Stephen A. Cook, Nicholas Pippenger
Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines Inf. Control. 58 (1-3) (1983)
Wolfgang J. Paul, Nicholas Pippenger, Endre Szemerédi, William T. Trotter
On Determinism versus Non-Determinism and Related Problems (Preliminary Version) FOCS (1983)
Danny Dolev, Cynthia Dwork, Nicholas Pippenger, Avi Wigderson
Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version) STOC (1983)
Nicholas Pippenger
Superconcentrators of Depth 2. J. Comput. Syst. Sci. 24 (1) (1982)
Nicholas Pippenger
Advances in Pebbling (Preliminary Version). ICALP (1982)
Nicholas Pippenger
Probabilistic Simulations (Preliminary Version) STOC (1982)
Nicholas Pippenger
Bounds on the performance of protocols for a multiple-access broadcast channel . IEEE Trans. Inf. Theory 27 (2) (1981)

Nicholas Pippenger.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Nicholas Pippenger