Travelled to:1 × Austria
1 × Denmark
9 × USA
Collaborated with:∅ W.S.Evans C.Dwork P.Feldman J.Friedman M.Dietzfelbinger J.Y.Gil Y.Matias D.Peleg E.Upfal M.M.Klawe W.J.Paul M.Yannakakis D.Dolev A.Wigderson
Talks about:superconcentr (2) function (2) network (2) monoton (2) general (2) boolean (2) pebbl (2) depth (2) bound (2) schematolog (1)
Person: Nicholas Pippenger
DBLP: Pippenger:Nicholas
Contributed to:
1996
19961993
19921986198419831982198219801976Wrote 12 papers:
- POPL-1996-Pippenger #lisp
- Pure versus Impure LISP (NP), pp. 104–109.
- STOC-1996-EvansP #bound
- Lower Bounds for Noisy Boolean Decision Trees (WSE, NP), pp. 620–628.
- STOC-1993-Pippenger #self
- Self-routing superconcentrators (NP), pp. 355–361.
- ICALP-1992-DietzfelbingerGMP #polynomial #reliability
- Polynomial Hash Functions Are Reliable (MD, JYG, YM, NP), pp. 235–246.
- STOC-1986-DworkPPU #bound #fault tolerance #network
- Fault Tolerance in Networks of Bounded Degree (CD, DP, NP, EU), pp. 370–379.
- STOC-1986-FeldmanFP #network
- Non-Blocking Networks (PF, JF, NP), pp. 247–254.
- STOC-1984-KlawePPY #on the #strict
- On Monotone Formulae with Restricted Depth (MMK, WJP, NP, MY), pp. 480–487.
- STOC-1983-DolevDPW
- Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (DD, CD, NP, AW), pp. 42–51.
- ICALP-1982-Pippenger #roadmap
- Advances in Pebbling (NP), pp. 407–417.
- STOC-1982-Pippenger #probability #simulation
- Probabilistic Simulations (NP), pp. 17–26.
- STOC-1980-Pippenger #comparative
- Comparative Schematology and Pebbling with Auxiliary Pushdowns (NP), pp. 351–356.
- STOC-1976-Pippenger
- The Realization of Monotone Boolean Functions (NP), pp. 204–210.