Pippenger, Nicholas: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

Large-Deviation Bounds for Sampling without Replacement

Kyle Luh, Nicholas Pippenger

Journal:

American Mathematical Monthly

Language:

english

File:

PDF, 241 KB

english

2

Two Extensions of Results of Archimedes

Nicholas Pippenger

Journal:

American Mathematical Monthly

Year:

2011

Language:

english

File:

PDF, 243 KB

english, 2011

3

An Infinite Product for e

Nicholas Pippenger

Journal:

American Mathematical Monthly

Year:

1980

Language:

english

File:

PDF, 184 KB

english, 1980

4

Random interval graphs

Nicholas Pippenger

Journal:

Random Structures & Algorithms

Year:

1998

Language:

english

File:

PDF, 209 KB

english, 1998

5

Characterizations of 1-Way Quantum Finite Automata

Brodsky, Alex, Pippenger, Nicholas

Journal:

SIAM Journal on Computing

Year:

2002

Language:

english

File:

PDF, 234 KB

english, 2002

6

The Linking Probability of Deep Spider-Web Networks

Pippenger, Nicholas

Journal:

SIAM Journal on Discrete Mathematics

Year:

2006

Language:

english

File:

PDF, 178 KB

english, 2006

7

Pure versus impure Lisp

Pippenger, Nicholas

Journal:

ACM Transactions on Programming Languages and Systems

Year:

1997

Language:

english

File:

PDF, 347 KB

english, 1997

8

Systematic mistakes are likely in bounded optimal decision-making systems

Adi Livnat, Nicholas Pippenger

Journal:

Journal of Theoretical Biology

Year:

2008

Language:

english

File:

PDF, 254 KB

english, 2008

9

The Boolean functions computed by random Boolean formulas or how to grow the right function

Alex Brodsky, Nicholas Pippenger

Journal:

Random Structures & Algorithms

Year:

2005

Language:

english

File:

PDF, 232 KB

english, 2005

10

Enumeration of Equicolorable Trees

Pippenger, Nicholas

Journal:

SIAM Journal on Discrete Mathematics

Year:

2001

Language:

english

File:

PDF, 211 KB

english, 2001

11

A New Lower Bound for the Number of Switches in Rearrangeable Networks

Pippenger, Nicholas

Journal:

SIAM Journal on Algebraic and Discrete Methods

Year:

1980

Language:

english

File:

PDF, 405 KB

english, 1980

12

[IEEE 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) - San Juan, Puerto Rico (1979.10.29-1979.10.31)] 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) - On simultaneous resource bounds

Pippenger, Nicholas

Year:

1979

Language:

english

File:

PDF, 566 KB

english, 1979

13

[IEEE 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) - Tucson, AZ, USA (1983.11.7-1983.11.9)] 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) - On determinism versus non-determinism and related problems

Paul, Wolfgang J., Pippenger, Nicholas, Szemeredi, Endre, Trotter, William T.

Year:

1983

Language:

english

File:

PDF, 821 KB

english, 1983

14

Sex, Mixability, and Modularity

Adi Livnat, Christos Papadimitriou, Nicholas Pippenger and Marcus W. Feldman

Journal:

Proceedings of the National Academy of Sciences

Year:

2010

Language:

english

File:

PDF, 1.21 MB

english, 2010

15

An Infinite Product for e

Pippenger, Nicholas

Journal:

American Mathematical Monthly

Year:

1980

Language:

english

File:

PDF, 307 KB

english, 1980

16

Routing algorithms for switching networks with probabilistic traffic

Lin, Geng, Pippenger, Nicholas

Journal:

Year:

1996

Language:

english

File:

PDF, 639 KB

english, 1996

17

Upper and lower bounds for the average-case complexity of path-search

Pippenger, Nicholas

Journal:

Year:

1999

Language:

english

File:

PDF, 125 KB

english, 1999

18

Analysis of Carry Propagation in Addition: An Elementary Approach

Nicholas Pippenger

Journal:

Journal of Algorithms

Year:

2002

Language:

english

File:

PDF, 114 KB

english, 2002

19

Self -Routing Superconcentrators

Nicholas Pippenger

Journal:

Journal of Computer and System Sciences

Year:

1996

Language:

english

File:

PDF, 293 KB

english, 1996

20

On rearrangeable and non-blocking switching networks

Nicholas Pippenger

Journal:

Journal of Computer and System Sciences

Year:

1978

Language:

english

File:

PDF, 868 KB

english, 1978

21

Editor's foreword

Lawrence Snyder, E.K. Blum, Nicholas Pippenger

Journal:

Journal of Computer and System Sciences

Year:

1980

File:

PDF, 30 KB

1980

22

Pebbling with an auxiliary pushdown

Nicholas Pippenger

Journal:

Journal of Computer and System Sciences

Year:

1981

Language:

english

File:

PDF, 1.07 MB

english, 1981

23

Computational Complexity of Algebraic Functions

Nicholas Pippenger

Journal:

Journal of Computer and System Sciences

Year:

1981

Language:

english

File:

PDF, 919 KB

english, 1981

24

Superconcentrators of depth 2

Nicholas Pippenger

Journal:

Journal of Computer and System Sciences

Year:

1982

Language:

english

File:

PDF, 468 KB

english, 1982

25

Correction to “Computational complexity of algebraic functions”

Nicholas Pippenger

Journal:

Journal of Computer and System Sciences

Year:

1988

Language:

english

File:

PDF, 269 KB

english, 1988

26

The inducibility of graphs

Nicholas Pippenger, Martin Charles Golumbic

Journal:

Journal of Combinatorial Theory, Series B

Year:

1975

Language:

english

File:

PDF, 740 KB

english, 1975

27

An information-theoretic method in combinatorial theory

Nicholas Pippenger

Journal:

Journal of Combinatorial Theory, Series A

Year:

1977

Language:

english

File:

PDF, 277 KB

english, 1977

28

Knots in random walks

Nicholas Pippenger

Journal:

Discrete Applied Mathematics

Year:

1989

Language:

english

File:

PDF, 428 KB

english, 1989

29

Parallel selection

Yossi Azar, Nicholas Pippenger

Journal:

Discrete Applied Mathematics

Year:

1990

Language:

english

File:

PDF, 637 KB

english, 1990

30

The asymptotic optimality of spider-web networks

Nicholas Pippenger

Journal:

Discrete Applied Mathematics

Year:

1992

Language:

english

File:

PDF, 1.37 MB

english, 1992

31

Bounded-depth, polynomial-size circuits for symmetric functions

Ronald Fagin, Maria M. Klawe, Nicholas J. Pippenger, Larry Stockmeyer

Journal:

Theoretical Computer Science

Year:

1985

Language:

english

File:

PDF, 787 KB

english, 1985

32

Attribute estimation and testing quasi-symmetry

Krzysztof Majewski, Nicholas Pippenger

Journal:

Information Processing Letters

Year:

2009

Language:

english

File:

PDF, 166 KB

english, 2009

33

Fault tolerance in cellular automata at high fault rates

Mark McCann, Nicholas Pippenger

Journal:

Journal of Computer and System Sciences

Year:

2008

Language:

english

File:

PDF, 139 KB

english, 2008

34

Symmetry in self-correcting cellular automata

Nicholas Pippenger

Journal:

Journal of Computer and System Sciences

Year:

1994

Language:

english

File:

PDF, 768 KB

english, 1994

35

The shortest disjunctive normal form of a random Boolean function

Nicholas Pippenger

Journal:

Random Structures & Algorithms

Year:

2003

Language:

english

File:

PDF, 174 KB

english, 2003

36

Topological characteristics of random triangulated surfaces

Nicholas Pippenger, Kristin Schleich

Journal:

Random Structures & Algorithms

Year:

2006

Language:

english

File:

PDF, 327 KB

english, 2006

37

Large deviations and moments for the Euler characteristic of a random surface

Kevin Fleming, Nicholas Pippenger

Journal:

Random Structures & Algorithms

Year:

2010

Language:

english

File:

PDF, 121 KB

english, 2010

38

The blocking probability of spider-web networks

Nicholas Pippenger

Journal:

Random Structures & Algorithms

Year:

1991

Language:

english

File:

PDF, 1.35 MB

english, 1991

39

Parallel algorithms for routing in nonblocking networks

Geng Lin, Nicholas Pippenger

Journal:

Theory of Computing Systems

Year:

1994

Language:

english

File:

PDF, 786 KB

english, 1994

40

Information theory and the complexity of boolean functions

Nicholas Pippenger

Journal:

Theory of Computing Systems

Year:

1976-1977

Language:

english

File:

PDF, 1.65 MB

english, 1976-1977

41

The complexity of monotone boolean functions

Nicholas Pippenger

Journal:

Theory of Computing Systems

Year:

1977-1978

Language:

english

File:

PDF, 1.65 MB

english, 1977-1978

42

The minimum number of edges in graphs with prescribed paths

Nicholas Pippenger

Journal:

Theory of Computing Systems

Year:

1978-1979

Language:

english

File:

PDF, 919 KB

english, 1978-1979

43

Expanding graphs contain all small trees

Joel Friedman, Nicholas Pippenger

Journal:

Year:

1987

Language:

english

File:

PDF, 299 KB

english, 1987

44

Asymptotic behavior of the chromatic index for hypergraphs

Nicholas Pippenger, Joel Spencer

Journal:

Journal of Combinatorial Theory, Series A

Year:

1989

Language:

english

File:

PDF, 1.01 MB

english, 1989

45

An explicit construction of short monotone formulae for the monotone symmetric functions

Mark Kleiman, Nicholas Pippenger

Journal:

Theoretical Computer Science

Year:

1978

Language:

english

File:

PDF, 818 KB

english, 1978

46

On another Boolean matrix

Nicholas Pippenger

Journal:

Theoretical Computer Science

Year:

1980

Language:

english

File:

PDF, 876 KB

english, 1980

47

Galois theory for minors of finite functions

Nicholas Pippenger

Journal:

Discrete Mathematics

Year:

2002

Language:

english

File:

PDF, 124 KB

english, 2002

48

Complexity Theory

Pippenger, Nicholas

Journal:

Scientific American

Year:

1978

Language:

english

File:

PDF, 1.08 MB

english, 1978

49

The computational complexity of knot and link problems

Hass, Joel, Lagarias, Jeffrey C., Pippenger, Nicholas

Journal:

Journal of the ACM

Year:

1999

Language:

english

File:

PDF, 185 KB

english, 1999

50

Generalized Connectors

Pippenger, Nicholas

Journal:

SIAM Journal on Computing

Year:

1978

Language:

english

File:

PDF, 383 KB

english, 1978