Journal of Combinatorial Theory, Series A

Paper

01 Jan 1977

An information-theoretic method in combinatorial theory

View publication

Abstract

Two examples are given showing the utility of Shannon's concepts of entropy and mutual information in combinatorial theory. © 1977.

Related

Paper

An explicit construction of short monotone formulae for the monotone symmetric functions

Mark Kleiman, Nicholas Pippenger

Theoretical Computer Science

Conference paper

Probabilistic simulations

Nicholas Pippenger

STOC 1982

Paper

Extendible Hashing—a Fast Access Method for Dynamic Files

Ronald Fagin, Jurg Nievergelt, et al.

ACM Transactions on Database Systems (TODS)

Paper

Pebbling with an auxiliary pushdown

Nicholas Pippenger

Journal of Computer and System Sciences

View all publications