Bohdan S. Majewski

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1999
Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction (addenda and errata).
Exp. Math., 1999

1998
Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction.
Exp. Math., 1998

1997
Perfect Hashing.
Theor. Comput. Sci., 1997

1996
A Family of Perfect Hashing Methods.
Comput. J., 1996

1995
A Solution to the Extended GCD Problem.
Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, 1995

A Hard Problem That is Almost Always Easy.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1994
The complexity of greatest common divisor computations.
Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

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

A Linear Time Algorithm for Finding Minimal Perfect Hash Functions.
Comput. J., 1993

Graphs, Hypergraphs and Hashing.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992
Minimal perfect hash functions
PhD thesis, 1992

An Optimal Algorithm for Generating Minimal Perfect Hash Functions.
Inf. Process. Lett., 1992


  Loading...