21 citations · 40 across the 4 of their papers we have counts for
4 papers
The Combinatorial Data Fusion Problem in Conflicted-supervised Learning
R. W. R. Darling, David G. Harris, Dev R. Phulara +1
The best merge problem in industrial data science generates instances where disparate data sources place incompatible relational structures on the same set of objects. Graph ve…
Subhypergraphs in non-uniform random hypergraphs
Megan Dewar, John Healy, Xavier Pérez-Giménez +4
In this paper we focus on the problem of finding (small) subhypergraphs in a (large) hypergraph. We use this problem to illustrate that reducing hypergraph problems to graph proble…
Connectivity in Hypergraphs
Megan Dewar, David Pike, John Proos
In this paper we consider two natural notions of connectivity for hypergraphs: weak and strong. We prove that the strong vertex connectivity of a connected hypergraph is bounded by…
Shor's discrete logarithm quantum algorithm for elliptic curves
John Proos, Christof Zalka
We show in some detail how to implement Shor's efficient quantum algorithm for discrete logarithms for the particular case of elliptic curve groups. It turns out that for this prob…