Bohdan S. Majewski

Publication Activity (10 Years)

Years Active: 1992-1999
Publications (10 Years): 0

Publications

George Havas, Bohdan S. Majewski, Keith R. Matthews
Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction (addenda and errata). Exp. Math. 8 (2) (1999)
George Havas, Bohdan S. Majewski, Keith R. Matthews
Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction. Exp. Math. 7 (2) (1998)
Zbigniew J. Czech, George Havas, Bohdan S. Majewski
Perfect Hashing. Theor. Comput. Sci. 182 (1-2) (1997)
Bohdan S. Majewski, Nicholas C. Wormald, George Havas, Zbigniew J. Czech
A Family of Perfect Hashing Methods. Comput. J. 39 (6) (1996)
George Havas, Bohdan S. Majewski
A Hard Problem That is Almost Always Easy. ISAAC (1995)
Bohdan S. Majewski, George Havas
A Solution to the Extended GCD Problem. ISSAC (1995)
Bohdan S. Majewski, George Havas
The complexity of greatest common divisor computations. ANTS (1994)
George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech
Graphs, Hypergraphs and Hashing. WG (1993)
Zbigniew J. Czech, Bohdan S. Majewski
A Linear Time Algorithm for Finding Minimal Perfect Hash Functions. Comput. J. 36 (6) (1993)
Zbigniew J. Czech, Marek Konopka, Bohdan S. Majewski
Parallel Algorithms for Finding a Suboptimal Fundamental-Cycle Set in a Graph. Parallel Comput. 19 (9) (1993)
Zbigniew J. Czech, George Havas, Bohdan S. Majewski
An Optimal Algorithm for Generating Minimal Perfect Hash Functions. Inf. Process. Lett. 43 (5) (1992)