2 citations · 2 across the 3 of their papers we have counts for
3 papers
math.CO2020
On difference sets with small
Daniel M. Gordon
In a 1989 paper \cite{arasu2}, Arasu used an observation about multipliers to show that no difference set exists in any abelian group. The proof is quite short and req…
cs.IT2008★ 2 cited
Optimal hash functions for approximate closest pairs on the n-cube
Daniel M. Gordon, Victor Miller, Peter Ostapenko
One way to find closest pairs in large datasets is to use hash functions. In recent years locality-sensitive hash functions for various metrics have been given: projecting an n-cub…
math.CO2003
On the existence of cyclic difference sets with small parameters
Leonard D. Baumert, Daniel M. Gordon
Previous surveys by Baumert and Lopez and Sanchez have resolved the existence of cyclic (v,k,lambda) difference sets with k <= 150, except for six open cases. In this paper we show…