The SCEAS System
Navigation Menu

Search the dblp DataBase


P. Frankl: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.001secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002