Tight upper bounds on the number of candidate patterns

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]

Authors

Floris Geerts

This author has not been identified. Look up 'Floris Geerts' in Google

Bart Goethals

This author has not been identified. Look up 'Bart Goethals' in Google

Jan Van den Bussche

This author has not been identified. Look up 'Jan Van den Bussche' in Google