The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Christian Bey: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Christian Bey
    Remarks on an Edge Isoperimetric Problem. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:971-978 [Conf]
  2. Christian Bey
    On incidence matrices of finite affine geometries. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1997, v:47, n:, pp:- [Journal]
  3. Christian Bey
    Polynomial Lym Inequalities. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:25, n:1, pp:19-38 [Journal]
  4. Christian Bey
    The Erdos-Ko-Rado Bound for the Function Lattice. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:115-125 [Journal]
  5. Christian Bey, Konrad Engel, Gyula O. H. Katona, Uwe Leck
    On the average size of sets in intersecting Sperner families. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:259-266 [Journal]
  6. Christian Bey
    An intersection theorem for weighted sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:145-150 [Journal]
  7. Christian Bey
    An upper bound on the sum of squares of degrees in a hypergraph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:259-263 [Journal]
  8. Rudolf Ahlswede, Christian Bey, Konrad Engel, Levon H. Khachatrian
    The t-intersection Problem in the Truncated Boolean Lattice. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:5, pp:471-487 [Journal]
  9. Christian Bey, Konrad Engel
    An Asymptotic Complete Intersection Theorem for Chain Products. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1999, v:20, n:5, pp:321-327 [Journal]
  10. Christian Bey
    On Cross-intersecting Families of Sets. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:2, pp:161-168 [Journal]
  11. Christian Bey, Martin Henk, Jörg M. Wills
    Notes on the Roots of Ehrhart Polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:38, n:1, pp:81-98 [Journal]

  12. The edge-diametric theorem in Hamming spaces. [Citation Graph (, )][DBLP]


  13. On Boolean functions with the sum of every two of them being bent. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
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 asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002