Majewski, Krzysztof; Pippenger, Nicholas Attribute estimation and testing quasi-symmetry. (English) Zbl 1191.68853 Inf. Process. Lett. 109, No. 4, 233-237 (2009). MSC: 68W20 PDFBibTeX XMLCite \textit{K. Majewski} and \textit{N. Pippenger}, Inf. Process. Lett. 109, No. 4, 233--237 (2009; Zbl 1191.68853) Full Text: DOI arXiv
Brodsky, Alex; Pippenger, Nicholas The Boolean functions computed by random Boolean formulas or how to grow the right function. (English) Zbl 1083.94024 Random Struct. Algorithms 27, No. 4, 490-519 (2005). MSC: 94C10 68Q25 03B05 PDFBibTeX XMLCite \textit{A. Brodsky} and \textit{N. Pippenger}, Random Struct. Algorithms 27, No. 4, 490--519 (2005; Zbl 1083.94024) Full Text: DOI arXiv
Pippenger, Nicholas The shortest disjunctive normal form of a random Boolean function. (English) Zbl 1023.94023 Random Struct. Algorithms 22, No. 2, 161-186 (2003). Reviewer: Sergiu Rudeanu (Bucureşti) MSC: 94C10 06E30 PDFBibTeX XMLCite \textit{N. Pippenger}, Random Struct. Algorithms 22, No. 2, 161--186 (2003; Zbl 1023.94023) Full Text: DOI
Pippenger, Nicholas Galois theory for minors of finite functions. (English) Zbl 1010.06012 Discrete Math. 254, No. 1-3, 405-419 (2002). Reviewer: Sergiu Rudeanu (Bucureşti) MSC: 06E30 94C10 PDFBibTeX XMLCite \textit{N. Pippenger}, Discrete Math. 254, No. 1--3, 405--419 (2002; Zbl 1010.06012) Full Text: DOI
Pippenger, Nicholas Entropy and enumeration of Boolean functions. (English) Zbl 0958.94011 IEEE Trans. Inf. Theory 45, No. 6, 2096-2100 (1999). MSC: 94A17 05A16 06E30 PDFBibTeX XMLCite \textit{N. Pippenger}, IEEE Trans. Inf. Theory 45, No. 6, 2096--2100 (1999; Zbl 0958.94011) Full Text: DOI
Evans, William; Pippenger, Nicholas On the maximum tolerable noise for reliable computation by formulas. (English) Zbl 0912.94022 IEEE Trans. Inf. Theory 44, No. 3, 1299-1305 (1998). MSC: 94C10 68M99 PDFBibTeX XMLCite \textit{W. Evans} and \textit{N. Pippenger}, IEEE Trans. Inf. Theory 44, No. 3, 1299--1305 (1998; Zbl 0912.94022) Full Text: DOI Link
Evans, William; Pippenger, Nicholas Lower bounds for noisy Boolean decision trees. (English) Zbl 1125.94349 Proceedings of the 28th annual ACM symposium on the theory of computing (STOC). Philadelphia, PA, USA, May 22–24, 1996. New York, NY: ACM, 620-623 (1996). MSC: 94C10 PDFBibTeX XMLCite \textit{W. Evans} and \textit{N. Pippenger}, in: Proceedings of the 28th annual ACM symposium on the theory of computing, STOC '96. Philadelphia, PA, USA, May 22--24, 1996. New York, NY: ACM. 620--623 (1996; Zbl 1125.94349) Full Text: DOI
Paterson, Michael S.; Pippenger, Nicholas; Zwick, Uri Optimal carry save networks. (English) Zbl 0770.94010 Boolean function complexity, Sel. Pap. Symp., Durham/UK 1990, Lond. Math. Lect. Note Ser. 169, 174-201 (1992). Reviewer: D.P.Brown (Carbondale) MSC: 94C10 68Q25 PDFBibTeX XMLCite \textit{M. S. Paterson} et al., in: Boolean function complexity. Selected papers from the symposium sponsored by the London Mathematical Society, Durham, UK, July 1990. Cambridge: Cambridge University Press. 174--201 (1992; Zbl 0770.94010)
Pippenger, Nicholas Selection networks. (English) Zbl 0743.68051 SIAM J. Comput. 20, No. 5, 878-887 (1991). Reviewer: M.Kubale (Gdańsk) MSC: 68P10 94C10 PDFBibTeX XMLCite \textit{N. Pippenger}, SIAM J. Comput. 20, No. 5, 878--887 (1991; Zbl 0743.68051) Full Text: DOI
Pippenger, Nicholas Invariance of complexity measures for networks with unreliable gates. (English) Zbl 0677.94018 J. Assoc. Comput. Mach. 36, No. 3, 531-539 (1989). MSC: 94C10 PDFBibTeX XMLCite \textit{N. Pippenger}, J. Assoc. Comput. Mach. 36, No. 3, 531--539 (1989; Zbl 0677.94018) Full Text: DOI
Pippenger, Nicholas Reliable computation by formulas in the presence of noise. (English) Zbl 0652.94022 IEEE Trans. Inf. Theory 34, No. 2, 194-197 (1988). MSC: 94C10 PDFBibTeX XMLCite \textit{N. Pippenger}, IEEE Trans. Inf. Theory 34, No. 2, 194--197 (1988; Zbl 0652.94022) Full Text: DOI Link
Pippenger, Nicholas Reliable computation in the presence of noise. (English) Zbl 0677.94015 Proc. Int. Congr. Math., Berkeley/Calif. 1986, Vol. 2, 1469-1477 (1987). Reviewer: D.P.Brown MSC: 94C10 94C99 PDFBibTeX XML
Pippenger, Nicholas The complexity of computations by networks. (English) Zbl 0653.68016 IBM J. Res. Dev. 31, 235-243 (1987). MSC: 68Q25 94C10 PDFBibTeX XMLCite \textit{N. Pippenger}, IBM J. Res. Dev. 31, 235--243 (1987; Zbl 0653.68016) Full Text: DOI Link
Coppersmith, D.; Klawe, M. M.; Pippenger, N. J. Alphabetic minimax trees of degree at most t. (English) Zbl 0587.94019 SIAM J. Comput. 15, 189-192 (1986). MSC: 94C10 94C15 PDFBibTeX XMLCite \textit{D. Coppersmith} et al., SIAM J. Comput. 15, 189--192 (1986; Zbl 0587.94019) Full Text: DOI Link
Fagin, Ronald; Klawe, Maria M.; Pippenger, Nicholas J.; Stockmeyer, Larry Bounded-depth, polynomial-size circuits for symmetric functions. (English) Zbl 0574.94024 Theor. Comput. Sci. 36, 239-250 (1985). Reviewer: L.Livovschi MSC: 94C10 PDFBibTeX XMLCite \textit{R. Fagin} et al., Theor. Comput. Sci. 36, 239--250 (1985; Zbl 0574.94024) Full Text: DOI
Hoover, H. J.; Klawe, M. M.; Pippenger, N. J. Bounding fan-out in logical networks. (English) Zbl 0626.94015 J. Assoc. Comput. Mach. 31, 13-18 (1984). MSC: 94C10 PDFBibTeX XMLCite \textit{H. J. Hoover} et al., J. Assoc. Comput. Mach. 31, 13--18 (1984; Zbl 0626.94015) Full Text: DOI
Pippenger, Nicholas; Yao, Andrew C.-C. Rearrangeable networks with limited depth. (English) Zbl 0493.94017 SIAM J. Algebraic Discrete Methods 3, 411-417 (1982). MSC: 94C10 94C15 PDFBibTeX XMLCite \textit{N. Pippenger} and \textit{A. C. C. Yao}, SIAM J. Algebraic Discrete Methods 3, 411--417 (1982; Zbl 0493.94017) Full Text: DOI Link
Pippenger, Nicholas On another Boolean matrix. (English) Zbl 0429.94038 Theor. Comput. Sci. 11, 49-56 (1980). MSC: 94C10 PDFBibTeX XMLCite \textit{N. Pippenger}, Theor. Comput. Sci. 11, 49--56 (1980; Zbl 0429.94038) Full Text: DOI
Pippenger, Nicholas; Fischer, Michael J. Relations among complexity measures. (English) Zbl 0405.68041 J. Assoc. Comput. Mach. 26, 361-381 (1979). MSC: 68Q25 94C10 68Q05 68U20 PDFBibTeX XMLCite \textit{N. Pippenger} and \textit{M. J. Fischer}, J. Assoc. Comput. Mach. 26, 361--381 (1979; Zbl 0405.68041) Full Text: DOI
Kleiman, Mark; Pippenger, Nicholas An explicit construction of short monotone formulae for the monotone symmetric functions. (English) Zbl 0391.94029 Theor. Comput. Sci. 7, 325-332 (1978). MSC: 94C10 PDFBibTeX XMLCite \textit{M. Kleiman} and \textit{N. Pippenger}, Theor. Comput. Sci. 7, 325--332 (1978; Zbl 0391.94029) Full Text: DOI
Pippenger, Nicholas On rearrangeable and non-blocking switching networks. (English) Zbl 0387.94044 J. Comput. Syst. Sci. 17, 145-162 (1978). MSC: 94C10 94C15 PDFBibTeX XMLCite \textit{N. Pippenger}, J. Comput. Syst. Sci. 17, 145--162 (1978; Zbl 0387.94044) Full Text: DOI
Pippenger, Nicholas The complexity of monotone Boolean functions. (English) Zbl 0363.68069 Math. Syst. Theory 11, 289-316 (1978). MSC: 68Q25 94C10 PDFBibTeX XMLCite \textit{N. Pippenger}, Math. Syst. Theory 11, 289--316 (1978; Zbl 0363.68069) Full Text: DOI
Pippenger, Nicholas Information theory and the complexity of Boolean functions. (English) Zbl 0364.94031 Math. Syst. Theory 10(1976), 129-167 (1977). MSC: 94A15 94C10 PDFBibTeX XMLCite \textit{N. Pippenger}, Math. Syst. Theory 10, 129--167 (1977; Zbl 0364.94031) Full Text: DOI
Pippenger, Nicholas Superconcentrators. (English) Zbl 0361.05035 SIAM J. Comput. 6, 298-304 (1977). MSC: 05C20 94C10 PDFBibTeX XMLCite \textit{N. Pippenger}, SIAM J. Comput. 6, 298--304 (1977; Zbl 0361.05035) Full Text: DOI
Pippenger, Nicholas The realization of monotone Boolean functions. (Preliminary version). (English) Zbl 0366.94050 Proc. 8th ann. ACM Symp. Theor. Comput., Hershey 1976, 204-210 (1976). MSC: 94C10 PDFBibTeX XML
Pippenger, Nicholas On crossbar switching networks. (English) Zbl 0348.94028 IEEE Trans. Commun. 23, 646-659 (1975). MSC: 94C10 94A05 60J85 PDFBibTeX XMLCite \textit{N. Pippenger}, IEEE Trans. Commun. 23, 646--659 (1975; Zbl 0348.94028) Full Text: DOI