| 1997 |
|---|
| 9 | EE | Zbigniew J. Czech,
George Havas,
Bohdan S. Majewski:
Perfect Hashing.
Theor. Comput. Sci. 182(1-2): 1-143 (1997) |
| 1996 |
|---|
| 8 | | 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 |
|---|
| 7 | | George Havas,
Bohdan S. Majewski:
A Hard Problem That is Almost Always Easy.
ISAAC 1995: 216-223 |
| 6 | EE | Bohdan S. Majewski,
George Havas:
A Solution to the Extended GCD Problem.
ISSAC 1995: 248-253 |
| 1994 |
|---|
| 5 | | Bohdan S. Majewski,
George Havas:
The complexity of greatest common divisor computations.
ANTS 1994: 184-193 |
| 1993 |
|---|
| 4 | | George Havas,
Bohdan S. Majewski,
Nicholas C. Wormald,
Zbigniew J. Czech:
Graphs, Hypergraphs and Hashing.
WG 1993: 153-165 |
| 3 | | Zbigniew J. Czech,
Bohdan S. Majewski:
A Linear Time Algorithm for Finding Minimal Perfect Hash Functions.
Comput. J. 36(6): 579-587 (1993) |
| 2 | | 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) |
| 1992 |
|---|
| 1 | | 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) |
