The following pages link to Elena Barcucci (Q180268):
Displaying 50 items.
- Generalized Schröder permutations (Q391425) (← links)
- Cross-bifix-free sets in two dimensions (Q517032) (← links)
- Reconstructing convex polyominoes from horizontal and vertical projections (Q672143) (← links)
- Non-overlapping matrices (Q728263) (← links)
- A strong non-overlapping Dyck code (Q832919) (← links)
- (Q967943) (redirect page) (← links)
- The average height of directed column-convex polyominoes having square, hexagonal and triangular cells (Q967945) (← links)
- Some more properties of Catalan numbers (Q1193445) (← links)
- Random generation of trees and other combinatorial objects (Q1292293) (← links)
- Directed animals, forests and permutations (Q1300965) (← links)
- Some combinatorial interpretations of \(q\)-analogs of Schröder numbers (Q1306593) (← links)
- The random generation of directed animals (Q1342241) (← links)
- ``Deco'' polyominoes, permutations and random generation (Q1351210) (← links)
- Polyominoes defined by their vertical and horizontal projections (Q1351218) (← links)
- Nondecreasing Dyck paths and \(q\)-Fibonacci numbers (Q1363665) (← links)
- A methodology for plane tree enumeration (Q1381812) (← links)
- Steep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functions (Q1584350) (← links)
- A combinatorial interpretation of the recurrence \(f_{n+1}=6f_n-f_{n-1}\) (Q1584390) (← links)
- Ambiguity results in the characterization of \(hv\)-convex polyominoes from projections (Q1690387) (← links)
- A 2D non-overlapping code over a \(q\)-ary alphabet (Q1704207) (← links)
- Exhaustive generation of combinatorial objects by ECO (Q1889882) (← links)
- The random generation of underdiagonal walks (Q1893974) (← links)
- From Motzkin to Catalan permutations (Q1978172) (← links)
- Exhaustive generation of some lattice paths and their prefixes (Q2043010) (← links)
- Strings from linear recurrences and permutations: a gray code (Q2089698) (← links)
- Strings from linear recurrences: a Gray code (Q2140458) (← links)
- A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations (Q2494390) (← links)
- On directed-convex polyominoes in a rectangle (Q2566276) (← links)
- An algorithm for the reconstruction of discrete sets from two projections in presence of absorption (Q2573236) (← links)
- (Q2728902) (← links)
- (Q2755037) (← links)
- Solving Multicolor Discrete Tomography Problems by Using Prior Knowledge (Q2844604) (← links)
- (Q2915587) (← links)
- Solving the Two Color Problem: An Heuristic Algorithm (Q3003544) (← links)
- BCIF: Another Algorithm for Lossless True Color Image Compression (Q3003552) (← links)
- (Q3077252) (← links)
- Cross-bifix-free sets generation <i>via </i>Motzkin paths (Q3186677) (← links)
- (Q3219808) (← links)
- (Q3359745) (← links)
- Reconstruction of discrete sets from two absorbed projections: an algorithm (Q3438908) (← links)
- An efficient algorithm for reconstructing binary matrices from horizontal and vertical absorbed projections (Q3439198) (← links)
- (Q3484378) (← links)
- PCIF: An Algorithm for Lossless True Color Image Compression (Q3651617) (← links)
- (Q4013349) (← links)
- Succession rules and Deco polyominoes (Q4494478) (← links)
- (Q4502584) (← links)
- (Q4663912) (← links)
- ECO:a methodology for the enumeration of combinatorial objects (Q4700083) (← links)
- (Q4728283) (← links)
- (Q4862174) (← links)
