1. János Körner, Coding of an information source having ambiguous alphabet and the entropy of graphs, in: 6th Prague Conference on Information Theory, 1973, pp. 411–425.
2. Entropy splitting for antiblocking corners and perfect graphs;Csiszár;Combinatorica,1990
3. Entropy and sorting;Kahn;J. Comput. System Sci.,1995
4. New bounds for perfect hashing via information theory;Körner;European J. Combin.,1988
5. I. Newman, P. Ragde, A. Wigderson, Perfect hashing, graph entropy, and circuit complexity, in: Proceedings Fifth Annual Structure in Complexity Theory Conference, 1990, pp. 91–99.