Bohdan S. Majewski

According to our database, Bohdan S. Majewski authored at least 12 papers between 1992 and 1999.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

1999

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

1998

Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction.

George Havas, Bohdan S. Majewski, Keith R. Matthews

Exp. Math., 1998

1997

Perfect Hashing.

Zbigniew J. Czech, George Havas, Bohdan S. Majewski

Theor. Comput. Sci., 1997

1996

A Family of Perfect Hashing Methods.

Bohdan S. Majewski, Nicholas C. Wormald, George Havas, Zbigniew J. Czech

Comput. J., 1996

1995

A Solution to the Extended GCD Problem.

Bohdan S. Majewski, George Havas

Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, 1995

A Hard Problem That is Almost Always Easy.

George Havas, Bohdan S. Majewski

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1994

The complexity of greatest common divisor computations.

Bohdan S. Majewski, George Havas

Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1993

Parallel Algorithms for Finding a Suboptimal Fundamental-Cycle Set in a Graph.

Zbigniew J. Czech, Marek Konopka, Bohdan S. Majewski

Parallel Comput., 1993

A Linear Time Algorithm for Finding Minimal Perfect Hash Functions.

Zbigniew J. Czech, Bohdan S. Majewski

Comput. J., 1993

Graphs, Hypergraphs and Hashing.

George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992

Minimal perfect hash functions

Bohdan S. Majewski

PhD thesis, 1992

An Optimal Algorithm for Generating Minimal Perfect Hash Functions.

Zbigniew J. Czech, George Havas, Bohdan S. Majewski

Inf. Process. Lett., 1992