3 citations · 3 across the 1 of their papers we have counts for
3 papers
cs.CC2017
Reductions for Frequency-Based Data Mining Problems
Stefan Neumann, Pauli Miettinen
Studying the computational complexity of problems is one of the - if not the - fundamental questions in computer science. Yet, surprisingly little is known about the computational…
cs.DS2017★ 3 cited
Conditional Hardness for Sensitivity Problems
Monika Henzinger, Andrea Lincoln, Stefan Neumann +1
In recent years it has become popular to study dynamic problems in a sensitivity setting: Instead of allowing for an arbitrary sequence of updates, the sensitivity model only allow…
cs.CC2016
This House Proves that Debating is Harder than Soccer
Stefan Neumann, Andreas Wiese
During the last twenty years, a lot of research was conducted on the sport elimination problem: Given a sports league and its remaining matches, we have to decide whether a given t…