Computational complexity in algebraic function fields
- Nicholas Pippenger
- 1979
- FOCS 1979
Conference paper
Publications
38 results for Nicholas Pippenger
Extendible Hashing—a Fast Access Method for Dynamic Files
- Ronald Fagin
- Jurg Nievergelt
- et al.
- 1979
- ACM Transactions on Database Systems (TODS)
PaperRelations Among Complexity Measures
- Nicholas Pippenger
- Michael J. Fischer
- 1979
- Journal of the ACM
PaperThe minimum number of edges in graphs with prescribed paths
- Nicholas Pippenger
- 1978
- Mathematical Systems Theory
PaperA Time-Space Trade-Off
- Nicholas Pippenger
- 1978
- Journal of the ACM
PaperOn rearrangeable and non-blocking switching networks
- Nicholas Pippenger
- 1978
- Journal of Computer and System Sciences
PaperAn explicit construction of short monotone formulae for the monotone symmetric functions
- Mark Kleiman
- Nicholas Pippenger
- 1978
- Theoretical Computer Science
PaperThe complexity of monotone boolean functions
- Nicholas Pippenger
- 1977
- Mathematical Systems Theory
PaperAn information-theoretic method in combinatorial theory
- Nicholas Pippenger
- 1977
- Journal of Combinatorial Theory, Series A
PaperInformation theory and the complexity of boolean functions
- Nicholas Pippenger
- 1976
- Mathematical Systems Theory
Paper