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

On the Complexity of Strictly Nonblocking Concentration Networks

Nicholas Pippenger

IEEE Transactions on Communications

Paper

On rearrangeable and non-blocking switching networks

Nicholas Pippenger

Journal of Computer and System Sciences

Conference paper

Comparative schematology and pebbling with auxiliary pushdowns

Nicholas Pippenger

STOC 1980

Paper

A Fast Parallel Algorithm for Routing in Permutation Networks

Gavriela Freund Lev, Leslie G. Valiant, et al.

IEEE TC

View all publications