This web page lists the references in my paper:
D. Coppersmith and J. B. Shearer, "New Bounds for Union-free
Families of Sets", Electronic Journal of Combinatorics, 5(1)(1998),
IBM Research home page |
James B. Shearer's home page |
- P. Frankl and Z. Furedi, "Union-free Hypergraphs and Probability
Theory", European Journal of Combinatorics, 5(1984), p. 127-131.
- M. L. Fredman, "The Complexity of Maintaining an Array and
Computing its Partial Sums", JACM, 29(1982), p. 250-260.
- M. L. Fredman and J. Komlos, "On the Size of Separating Systems
and Families of Perfect Hash Functions", Siam J. Alg. Disc. Meth.,
5(1984), p. 61-68.
- J. B. Shearer, "A New Construction for Cancellative Sets", The
Electronic Journal of Combinatorics, 3(1996), #R15.
- J. Spencer, Ten Lectures on the Probabilistic Method, SIAM CBMS
IBM home page |
Contact IBM |