Bohdan S. Majewski
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
1990 – 1999
- 1999
[j7]George Havas, Bohdan S. Majewski, Keith R. Matthews:
Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction (addenda and errata). Experimental Mathematics 8(2): 205 (1999)- 1998
[j6]George Havas, Bohdan S. Majewski, Keith R. Matthews:
Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction. Experimental Mathematics 7(2): 125-136 (1998)- 1997
[j5]Zbigniew J. Czech, George Havas, Bohdan S. Majewski:
Perfect Hashing. Theor. Comput. Sci. 182(1-2): 1-143 (1997)- 1996
[j4]Bohdan S. Majewski, Nicholas C. Wormald, George Havas, Zbigniew J. Czech:
A Family of Perfect Hashing Methods. Comput. J. 39(6): 547-554 (1996)- 1995
[c4]
[c3]- 1994
[c2]Bohdan S. Majewski, George Havas:
The complexity of greatest common divisor computations. ANTS 1994: 184-193- 1993
[j3]Zbigniew J. Czech, Bohdan S. Majewski:
A Linear Time Algorithm for Finding Minimal Perfect Hash Functions. Comput. J. 36(6): 579-587 (1993)
[j2]Zbigniew J. Czech, Marek Konopka, Bohdan S. Majewski:
Parallel Algorithms for Finding a Suboptimal Fundamental-Cycle Set in a Graph. Parallel Computing 19(9): 961-971 (1993)
[c1]George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech:
Graphs, Hypergraphs and Hashing. WG 1993: 153-165- 1992
[j1]Zbigniew J. Czech, George Havas, Bohdan S. Majewski:
An Optimal Algorithm for Generating Minimal Perfect Hash Functions. Inf. Process. Lett. 43(5): 257-264 (1992)
Coauthor Index
last updated on 2018-06-28 13:55 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint



Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar