Bohdan S. Majewski

12 papers B 3Journal 7Unranked 1
YearRankTypeTitle / Venue / Authors
1999 J jnl
Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction (addenda and errata).
Exp. Math.
George Havas, Bohdan S. Majewski, Keith R. Matthews
1998 J jnl
Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction.
Exp. Math.
George Havas, Bohdan S. Majewski, Keith R. Matthews
1997 J jnl
Perfect Hashing.
Theor. Comput. Sci.
Zbigniew J. Czech, George Havas, Bohdan S. Majewski
1996 J jnl
A Family of Perfect Hashing Methods.
Comput. J.
Bohdan S. Majewski, Nicholas C. Wormald, George Havas, Zbigniew J. Czech
1995 B conf
A Hard Problem That is Almost Always Easy.
ISAAC
George Havas, Bohdan S. Majewski
1995 B conf
A Solution to the Extended GCD Problem.
ISSAC
Bohdan S. Majewski, George Havas
1994 — conf
The complexity of greatest common divisor computations.
ANTS
Bohdan S. Majewski, George Havas
1993 J jnl
A Linear Time Algorithm for Finding Minimal Perfect Hash Functions.
Comput. J.
Zbigniew J. Czech, Bohdan S. Majewski
1993 B conf
Graphs, Hypergraphs and Hashing.
WG
George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech
1993 J jnl
Parallel Algorithms for Finding a Suboptimal Fundamental-Cycle Set in a Graph.
Parallel Comput.
Zbigniew J. Czech, Marek Konopka, Bohdan S. Majewski
1992 J jnl
An Optimal Algorithm for Generating Minimal Perfect Hash Functions.
Inf. Process. Lett.
Zbigniew J. Czech, George Havas, Bohdan S. Majewski
1992 — —
Minimal perfect hash functions
Bohdan S. Majewski