Fountains and histograms

Journal of Algorithms - Tập 44 - Trang 159-176 - 2002
Donatella Merlini1, Renzo Sprugnoli1
1Dipartimento di Sistemi e Informatica, via Lombroso 6/17, 50134, Firenze, Italy

Tài liệu tham khảo

Barcucci, 1999, Eco: a methodology for the enumeration of combinatorial objects, J. Differ. Equations Appl., 5, 435, 10.1080/10236199908808200 Chung, 1978, The number of Baxter permutations, J. Combin. Theory Ser. A, 24, 382, 10.1016/0097-3165(78)90068-7 de Bruijn, 1958 Delest, 1993, Enumeration of directed column-convex animals with given perimeters and area, Croat. Chem. Acta, 66, 59 Duchon, 2000, On the enumeration and generation of generalized Dyck words, Discrete Math., 225, 121, 10.1016/S0012-365X(00)00150-3 Guy, 1988, The strong law of small numbers, Amer. Math. Monthly, 95, 697, 10.2307/2322249 Merlini, 2000, A generating tree approach to schedule printing devices Merlini, 2001, Waiting patterns for a printer, 183 Odlyzko, 1988, The editor's corner: n coins in a fountain, Amer. Math. Monthly, 95, 840, 10.2307/2322898 West, 1995, Generating trees and the Catalan and Schröder numbers, Discrete Math., 146, 247, 10.1016/0012-365X(94)00067-1 West, 1996, Generating trees and forbidden subsequences, Discrete Math., 157, 363, 10.1016/S0012-365X(96)83023-8