11 citations · 15 across the 3 of their papers we have counts for
3 papers
cs.GT2022★ 3 cited
Collecting, Classifying, Analyzing, and Using Real-World Elections
Niclas Boehmer, Nathan Schaar
We present a collection of real-world elections divided into datasets from various sources ranging from sports competitions over music charts to survey- and indicator-b…
cond-mat.dis-nn2021★ 11 cited
A comparison between D-wave and a classical approximation algorithm and a heuristic for computing the ground state of an Ising spin glass
Ran Yaacoby, Nathan Schaar, Leon Kellerhals +3
Finding the ground state of an Ising-spin glass on general graphs belongs to the class of NP-hard problems, widely believed to have no efficient polynomial-time algorithms for solv…
cs.DM2020★ 1 cited
Faster Binary Mean Computation Under Dynamic Time Warping
Nathan Schaar, Vincent Froese, Rolf Niedermeier
Many consensus string problems are based on Hamming distance. We replace Hamming distance by the more flexible (e.g., easily coping with different input string lengths) dynamic tim…