8 citations · 11 across the 6 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Practical Access to Dynamic Programming on Tree Decompositions
Max Bannach, Sebastian Berndt
Parameterized complexity theory has lead to a wide range of algorithmic breakthroughs within the last decades, but the practicability of these methods for real-world problems is st…
cs.CR2018
On the Gold Standard for Security of Universal Steganography
Sebastian Berndt, Maciej Liśkiewicz
While symmetric-key steganography is quite well understood both in the information-theoretic and in the computational setting, many fundamental questions about its public-key count…