Bohdan S. Majewski

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	1999
j6		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)
	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		George Havas, Bohdan S. Majewski: A Hard Problem That is Almost Always Easy. ISAAC 1995: 216-223
c3		Bohdan S. Majewski, George Havas: A Solution to the Extended GCD Problem. ISSAC 1995: 248-253
	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 update Sun May 19 16:09:53 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page