11 citations · 11 across the 2 of their papers we have counts for
2 papers
math.OC2021
A Simple Search Problem
Marshall Buck, Doug Wiedemann
A simple problem is studied in which there are N boxes and a prize known to be in one of the boxes. Furthermore, the probability that the prize is in any box is given. It is desire…
math.CO2007★ 11 cited
Equivalence of sparse circulants: the bipartite Ádám problem
Doug Wiedemann, Michael Zieve
We consider n-by-n circulant matrices having entries 0 and 1. Such matrices can be identified with sets of residues mod n, corresponding to the columns in which the top row contain…