On Computing the Hamming Distance. - Gerzson Kéri; Ákos Kisvölcsey (Acta Cybern., 2004)

Bounds for Covering Codes over Large Alphabets. - Gerzson Kéri; Patric R. J. Östergård (Des. Codes Cryptogr., 2005)

Further results on the covering radius of small codes. - Gerzson Kéri; Patric R. J. Östergård (Discret. Math., 2007)

The covering radius of extreme binary 2-surjective codes. - Gerzson Kéri (Des. Codes Cryptogr., 2008)

On the minimum size of binary codes with length 2 R + 4 and covering radius R. - Gerzson Kéri; Patric R. J. Östergård (Des. Codes Cryptogr., 2008)

Binary Covering Arrays and Existentially Closed Graphs. - Charles J. Colbourn; Gerzson Kéri (IWCC, 2009)

Covering and radius-covering arrays: Constructions and classification. - Charles J. Colbourn; Gerzson Kéri; P. P. Rivas Soriano; Jan-Christoph Schlage-Puchta (Discret. Appl. Math., 2010)

On qualitatively consistent, transitive and contradictory judgment matrices emerging from multiattribute decision procedures. - Gerzson Kéri (Central Eur. J. Oper. Res., 2011)

Combinatorial results on the fitting problems of the multivariate gamma distribution introduced by Prékopa and Szántai. - Gerzson Kéri; Tamás Szántai (Ann. Oper. Res., 2012)