An Optimal Algorithm for Generating Minimal Perfect Hash Functions. - Zbigniew J. Czech; George Havas; Bohdan S. Majewski (Inf. Process. Lett., 1992)

Minimal perfect hash functions - Bohdan S. Majewski (1992)

Graphs, Hypergraphs and Hashing. - George Havas; Bohdan S. Majewski; Nicholas C. Wormald; Zbigniew J. Czech (WG, 1993)

A Linear Time Algorithm for Finding Minimal Perfect Hash Functions. - Zbigniew J. Czech; Bohdan S. Majewski (Comput. J., 1993)

Parallel Algorithms for Finding a Suboptimal Fundamental-Cycle Set in a Graph. - Zbigniew J. Czech; Marek Konopka; Bohdan S. Majewski (Parallel Comput., 1993)

The complexity of greatest common divisor computations. - Bohdan S. Majewski; George Havas (ANTS, 1994)

A Hard Problem That is Almost Always Easy. - George Havas; Bohdan S. Majewski (ISAAC, 1995)

A Solution to the Extended GCD Problem. - Bohdan S. Majewski; George Havas (ISSAC, 1995)

A Family of Perfect Hashing Methods. - Bohdan S. Majewski; Nicholas C. Wormald; George Havas; Zbigniew J. Czech (Comput. J., 1996)

Perfect Hashing. - Zbigniew J. Czech; George Havas; Bohdan S. Majewski (Theor. Comput. Sci., 1997)

Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction. - George Havas; Bohdan S. Majewski; Keith R. Matthews (Exp. Math., 1998)

Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction (addenda and errata). - George Havas; Bohdan S. Majewski; Keith R. Matthews (Exp. Math., 1999)