Остановите войну!
for scientists:
default search action
Nicholas Pippenger
- > Home > Persons > Nicholas Pippenger
Publications
- 2014
- [j89]Ellen Gethner, David G. Kirkpatrick, Nicholas Pippenger:
Computational Aspects of M.C. Escher's Ribbon Patterns. Theory Comput. Syst. 54(4): 640-658 (2014) - 2012
- [c30]Ellen Gethner, David G. Kirkpatrick, Nicholas Pippenger:
M.C. Escher Wrap Artist: Aesthetic Coloring of Ribbon Patterns. FUN 2012: 198-209 - 2003
- [i1]Alex Brodsky, Nicholas Pippenger:
The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function. CoRR cs.DM/0302028 (2003) - 2002
- [j66]Alex Brodsky, Nicholas Pippenger:
Characterizations of 1-Way Quantum Finite Automata. SIAM J. Comput. 31(5): 1456-1478 (2002) - 1999
- [j62]Joel Hass, J. C. Lagarias, Nicholas Pippenger:
The Computational Complexity of Knot and Link Problems. J. ACM 46(2): 185-211 (1999) - 1998
- [j58]William S. Evans, Nicholas Pippenger:
Average-Case Lower Bounds for Noisy Boolean Decision Trees. SIAM J. Comput. 28(2): 433-446 (1998) - [j57]William S. Evans, Nicholas Pippenger:
On the Maximum Tolerable Noise for Reliable Computation by Formulas. IEEE Trans. Inf. Theory 44(3): 1299-1305 (1998) - 1997
- [c26]Joel Hass, J. C. Lagarias, Nicholas Pippenger:
The Computational Complexity of Knot and Link Problems. FOCS 1997: 172-181 - 1996
- [c24]William S. Evans, Nicholas Pippenger:
Lower Bounds for Noisy Boolean Decision Trees. STOC 1996: 620-628 - 1992
- [c21]Martin Dietzfelbinger, Joseph Gil, Yossi Matias, Nicholas Pippenger:
Polynomial Hash Functions Are Reliable (Extended Abstract). ICALP 1992: 235-246 - 1990
- [j43]Yossi Azar, Nicholas Pippenger:
Parallel selection. Discret. Appl. Math. 27(1-2): 49-58 (1990) - [c17]Mike Paterson, Nicholas Pippenger, Uri Zwick:
Faster Circuits and Shorter Formulae for Multiple Addition, Multiplication and Symmetric Boolean Functions. FOCS 1990: 642-650 - 1989
- [j39]Nicholas Pippenger, Joel H. Spencer:
Asymptotic behavior of the chromatic index for hypergraphs. J. Comb. Theory, Ser. A 51(1): 24-42 (1989) - 1988
- [j36]Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal:
Fault Tolerance in Networks of Bounded Degree. SIAM J. Comput. 17(5): 975-988 (1988) - [j35]Paul Feldman, Joel Friedman, Nicholas Pippenger:
Wide-Sense Nonblocking Networks. SIAM J. Discret. Math. 1(2): 158-173 (1988) - 1987
- [j33]Joel Friedman, Nicholas Pippenger:
Expanding graphs contain all small trees. Comb. 7(1): 71-76 (1987) - 1986
- [j30]Don Coppersmith, Maria M. Klawe, Nicholas Pippenger:
Alphabetic Minimax Trees of Degree at Most t. SIAM J. Comput. 15(1): 189-192 (1986) - [c15]Paul Feldman, Joel Friedman, Nicholas Pippenger:
Non-Blocking Networks (Preliminary Version). STOC 1986: 247-254 - [c14]Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal:
Fault Tolerance in Networks of Bounded Degree (Preliminary Version). STOC 1986: 370-379 - 1985
- [j29]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]H. James Hoover, Maria M. Klawe, Nicholas Pippenger:
Bounding Fan-out in Logical Networks. J. ACM 31(1): 13-18 (1984) - [c11]Maria M. Klawe, Wolfgang J. Paul, Nicholas Pippenger, Mihalis Yannakakis:
On Monotone Formulae with Restricted Depth (Preliminary Version). STOC 1984: 480-487 - 1983
- [j27]Allan Borodin, Stephen A. Cook, Nicholas Pippenger:
Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines. Inf. Control. 58(1-3): 113-136 (1983) - [c10]Wolfgang J. Paul, Nicholas Pippenger, Endre Szemerédi, William T. Trotter:
On Determinism versus Non-Determinism and Related Problems (Preliminary Version). FOCS 1983: 429-438 - [c9]Danny Dolev, Cynthia Dwork, Nicholas Pippenger, Avi Wigderson:
Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version). STOC 1983: 42-51 - 1981
- [j22]Gavriela Freund Lev, Nicholas Pippenger, Leslie G. Valiant:
A Fast Parallel Algorithm for Routing in Permutation Networks. IEEE Trans. Computers 30(2): 93-100 (1981) - 1979
- [j16]Nicholas Pippenger, Michael J. Fischer:
Relations Among Complexity Measures. J. ACM 26(2): 361-381 (1979) - [j14]Raymond E. Miller, Nicholas Pippenger, Arnold L. Rosenberg, Lawrence Snyder:
Optimal 2, 3-Trees. SIAM J. Comput. 8(1): 42-59 (1979) - [j13]Ronald Fagin, Jürg Nievergelt, Nicholas Pippenger, H. Raymond Strong:
Extendible Hashing - A Fast Access Method for Dynamic Files. ACM Trans. Database Syst. 4(3): 315-344 (1979) - 1976
- [j4]Nicholas Pippenger, Leslie G. Valiant:
Shifting Graphs and Their Applications. J. ACM 23(3): 423-432 (1976) - [j3]Arnold Schönhage, Mike Paterson, Nicholas Pippenger:
Finding the Median. J. Comput. Syst. Sci. 13(2): 184-199 (1976)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-02 00:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint