| |
| 1997 | ||
|---|---|---|
| 9 | EE | J. Abraham, P. Frankl, Christian Landrault, Meryem Marzouki, Paolo Prinetto, Chantal Robach, Pascale Thévenod-Fosse: Hardware Test: Can We Learn from Software Testing? VTS 1997: 320-321 |
| 1992 | ||
| 8 | EE | P. Frankl: On cross-intersecting families. Discrete Mathematics 108(1-3): 291-295 (1992) |
| 1991 | ||
| 7 | EE | P. Frankl: Multiply-intersecting families. J. Comb. Theory, Ser. B 53(2): 195-234 (1991) |
| 1990 | ||
| 6 | EE | P. Frankl: An intersection problem for codes. Discrete Mathematics 84(2): 135-141 (1990) |
| 1989 | ||
| 5 | EE | P. Frankl: A lower bound on the size of a complex generated by an antichain. Discrete Mathematics 76(1): 51-56 (1989) |
| 1986 | ||
| 4 | EE | P. Frankl: What must be contained in every oriented k-uniform hypergraph. Discrete Mathematics 62(3): 311-313 (1986) |
| 1984 | ||
| 3 | EE | P. Frankl: A new short proof for the Kruskal-Katona theorem. Discrete Mathematics 48(2-3): 327-329 (1984) |
| 1980 | ||
| 2 | EE | G. Cohen, P. Frankl: On tilings of the binary vector space. Discrete Mathematics 31(3): 271-277 (1980) |
| 1977 | ||
| 1 | P. Frankl: On the Minimum Number of Disjoint Pairs in a Family of Finite Sets. J. Comb. Theory, Ser. A 22(2): 249-251 (1977) | |
| 1 | J. Abraham | [9] |
| 2 | G. Cohen | [2] |
| 3 | Christian Landrault | [9] |
| 4 | Meryem Marzouki | [9] |
| 5 | Paolo Prinetto | [9] |
| 6 | Chantal Robach | [9] |
| 7 | Pascale Thévenod-Fosse | [9] |