Floris Geerts, Bart Goethals, Jan Van den Bussche. Tight upper bounds on the number of candidate patterns. ACM Trans. Database Syst., 30(2):333-363, 2005. [doi]
@article{GeertsGB05,
title = {Tight upper bounds on the number of candidate patterns},
author = {Floris Geerts and Bart Goethals and Jan Van den Bussche},
year = {2005},
doi = {10.1145/1071610.1071611},
url = {http://doi.acm.org/10.1145/1071610.1071611},
researchr = {https://researchr.org/publication/GeertsGB05},
cites = {0},
citedby = {0},
journal = {ACM Trans. Database Syst.},
volume = {30},
number = {2},
pages = {333-363},
}