L. Burnett

According to our database, L. Burnett authored at least 7 papers between 1985 and 2004.

Collaborative distances:

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

2004

Simpler methods for generating better Boolean functions with good cryptographic properties.

L. Burnett, William Millan, Ed Dawson, Andrew J. Clark

Australas. J Comb., 2004

2000

Efficient Methods for Generating MARS-Like S-Boxes.

L. Burnett, Gary Carter, Ed Dawson, William Millan

Proceedings of the Fast Software Encryption, 7th International Workshop, 2000

1999

Evolutionary Heuristics for Finding Cryptographically Strong S-Boxes.

William Millan, L. Burnett, Gary Carter, Andrew J. Clark, Ed Dawson

Proceedings of the Information and Communication Security, Second International Conference, 1999

1986

Should nucleotide sequence analyzing computer algorithms always extend homologies by extending homologies?

L. Burnett, A. Basten, W. J. Hensley

Nucleic Acids Res., 1986

Development of a superior strategy for computer-assisted nucleotide sequence analysis.

L. Burnett

Nucleic Acids Res., 1986

1985

The SEQANAL and SEQTALK programs: a new method of access to high- resolution nucleotide sequence comparison and analysis programs from a remote laboratory mini- or microcomputer.

L. Burnett, A. Basten, W. J. Hensley

Comput. Appl. Biosci., 1985

An exhaustive tree-searching algorithm for high-resolution computer- assisted nucleotide sequence analysis.

L. Burnett, A. Basten, W. J. Hensley

Comput. Appl. Biosci., 1985