Paul Erdös (1913-996): his influence on the theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the Lovász Number of Certain Circulant Graphs
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Testing triangle-freeness in general graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Algorithmic and explicit determination of the Lovász number for certain circulant graphs
Discrete Applied Mathematics
Efficient computation of the lovász theta function for a class of circulant graphs
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Random Structures & Algorithms
The chromatic number of random Cayley graphs
European Journal of Combinatorics
| Hi-index | 754.84 |
We study the savings afforded by repeated use in two zero-error communication problems. We show that for some random sources, communicating one instance requires arbitrarily many bits, but communicating multiple instances requires roughly 1 bit per instance. We also exhibit sources where the number of bits required for a single instance is comparable to the source's size, but two instances require only a logarithmic number of additional bits. We relate this problem to that of communicating information over a channel. Known results imply that some channels can communicate exponentially more bits in two uses than they can in one use