Nicholas Pippenger

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Maria M. Klawe

> Home > Persons > Nicholas Pippenger

Publications

1986
[j30]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/CoppersmithKP86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/CoppersmithKP86
Don Coppersmith, Maria M. Klawe, Nicholas Pippenger:
Alphabetic Minimax Trees of Degree at Most t. SIAM J. Comput. 15(1): 189-192 (1986)
1985
[j29]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/FaginKPS85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/FaginKPS85
Ronald Fagin, Maria M. Klawe, Nicholas Pippenger, Larry J. Stockmeyer:
Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions. Theor. Comput. Sci. 36: 239-250 (1985)
1984
[j28]
- view
  authority control:
- export record
  dblp key:
  - journals/jacm/HooverKP84
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/HooverKP84
H. James Hoover, Maria M. Klawe, Nicholas Pippenger:
Bounding Fan-out in Logical Networks. J. ACM 31(1): 13-18 (1984)
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/KlawePPY84
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/KlawePPY84
Maria M. Klawe, Wolfgang J. Paul, Nicholas Pippenger, Mihalis Yannakakis:
On Monotone Formulae with Restricted Depth (Preliminary Version). STOC 1984: 480-487

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.