12 citations · 16 across the 2 of their papers we have counts for
2 papers
math.CO2013★ 4 cited
A New Proof of Kemperman's Theorem
Tomas Boothby, Matt DeVos, Amanda Montejano
Let be an additive abelian group and let be finite and nonempty. The pair is called critical if the sumset $A+B = {a+b \mid $a \in Ab\in B$}$ s…
cs.MS2009★ 12 cited
Bitslicing and the Method of Four Russians Over Larger Finite Fields
Tomas J. Boothby, Robert W. Bradshaw
We present a method of computing with matrices over very small finite fields of size larger than 2. Specifically, we show how the Method of Four Russians can be efficiently adapted…