activity
20082019
most citedEfficient Multiplication of Dense Matrices over GF(2)

41 citations · 65 across the 5 of their papers we have counts for

collaborators

5 papers

cs.CR2019

The CATS Hackathon: Creating and Refining Test Items for Cybersecurity Concept Inventories

Alan T. Sherman, Linda Oliva, Enis Golaszewski +12

For two days in February 2018, 17 cybersecurity educators and professionals from government and industry met in a "hackathon" to refine existing draft multiple-choice test items, a…

math.NA2012

Error Bounds on Derivatives during Simulations

Gregory Bard, Alexander Basyrov

The methods commonly used for numerical differentiation, such as the "center-difference formula" and "four-points formula" are unusable in simulations or real-time data analysis be…

cs.MS2011★ 11 cited

Efficient Dense Gaussian Elimination over the Finite Field with Two Elements

Martin R. Albrecht, Gregory V. Bard, Clément Pernet

In this work we describe an efficient implementation of a hierarchy of algorithms for Gaussian elimination upon dense matrices over the field with two elements. We discuss both wel…

cs.SC2011★ 13 cited

A New General-Purpose Method to Multiply 3x3 Matrices Using Only 23 Multiplications

Nicolas T. Courtois, Gregory V. Bard, Daniel Hulme

One of the most famous conjectures in computer algebra is that matrix multiplication might be feasible in not much more than quadratic time. The best known exponent is 2.376, due t…

cs.MS2008★ 41 cited

Efficient Multiplication of Dense Matrices over GF(2)

Martin Albrecht, Gregory Bard, William Hart

We describe an efficient implementation of a hierarchy of algorithms for multiplication of dense matrices over the field with two elements (GF(2)). In particular we present our imp…