Sebastian Berndt
Cited by
Cited by
Fully dynamic bin packing revisited
S Berndt, K Jansen, KM Klein
Mathematical Programming 179 (1), 109-155, 2020
Jdrasil: A modular library for computing tree decompositions
M Bannach, S Berndt, T Ehlers
16th International Symposium on Experimental Algorithms (SEA 2017), 2017
Practical access to dynamic programming on tree decompositions
M Bannach, S Berndt
Algorithms 12 (8), 172, 2019
Algorithm substitution attacks from a steganographic perspective
S Berndt, M Liśkiewicz
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017
Learning residual alternating automata
S Berndt, M Liśkiewicz, M Lutter, R Reischuk
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
Positive-Instance Driven Dynamic Programming for Graph Searching
M Bannach, S Berndt
Workshop on Algorithms and Data Structures, 43-56, 2019
Provable Secure Universal Steganography of Optimal Rate: Provably Secure Steganography does not Necessarily Imply One-Way Functions
S Berndt, M Liśkiewicz
Proceedings of the 4th ACM Workshop on Information Hiding and Multimedia …, 2016
Hard Communication Channels for Steganography
S Berndt, M Liskiewicz
27th International Symposium on Algorithms and Computation (ISAAC 2016), 2016
Online bin covering with limited migration
S Berndt, L Epstein, K Jansen, A Levin, M Maack, L Rohwedder
arXiv preprint arXiv:1904.06543, 2019
Computing tree width: From theory to practice and back
S Berndt
Conference on Computability in Europe, 81-88, 2018
On the Gold Standard for Security of Universal Steganography
S Berndt, M Liśkiewicz
Annual International Conference on the Theory and Applications of …, 2018
SAT-encodings of tree decompositions
M Bannach, S Berndt, T Ehlers, D Nowotka
SAT COMPETITION 2018, 72, 2018
PACE Solver Description: PID^⋆
M Bannach, S Berndt, M Schuster, M Wienöbst
15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020
Steganography Based on Pattern Languages
S Berndt, R Reischuk
Language and Automata Theory and Applications, 387-399, 2016
New Bounds for the Vertices of the Integer Hull∗
S Berndt, K Jansen, KM Klein
Symposium on Simplicity in Algorithms (SOSA), 25-36, 2021
On the universal steganography of optimal rate
S Berndt, M Liśkiewicz
Information and Computation 275, 104632, 2020
SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis
O Seker, S Berndt, L Wilke, T Eisenbarth
Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications …, 2020
Tightness of Sensitivity and Proximity Bounds for Integer Linear Programs
S Berndt, K Jansen, A Lassota
arXiv preprint arXiv:2010.09255, 2020
Solving Packing Problems with Few Small Items Using Rainbow Matchings
M Bannach, S Berndt, M Maack, M Mnich, A Lassota, M Rau, M Skambath
arXiv preprint arXiv:2007.02660, 2020
Robust Online Algorithms for Certain Dynamic Packing Problems
S Berndt, V Dreismann, K Grage, K Jansen, I Knof
International Workshop on Approximation and Online Algorithms, 43-59, 2019
The system can't perform the operation now. Try again later.
Articles 1–20