| Fully dynamic bin packing revisited S Berndt, K Jansen, KM Klein Mathematical Programming 179 (1), 109-155, 2020 | 68 | 2020 |
| Algorithm substitution attacks from a steganographic perspective S Berndt, M Liśkiewicz Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017 | 41 | 2017 |
| Jdrasil: A modular library for computing tree decompositions M Bannach, S Berndt, T Ehlers 16th International Symposium on Experimental Algorithms (SEA 2017), 2017 | 32 | 2017 |
| Practical access to dynamic programming on tree decompositions M Bannach, S Berndt Algorithms 12 (8), 172, 2019 | 23 | 2019 |
| Learning residual alternating automata S Berndt, M Liśkiewicz, M Lutter, R Reischuk Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017 | 22 | 2017 |
| ASAP: algorithm substitution attacks on cryptographic protocols S Berndt, J Wichelmann, C Pott, TH Traving, T Eisenbarth Proceedings of the 2022 ACM on Asia Conference on Computer and …, 2022 | 14 | 2022 |
| Util:: lookup: Exploiting key decoding in cryptographic libraries F Sieck, S Berndt, J Wichelmann, T Eisenbarth Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications …, 2021 | 12 | 2021 |
| Online bin covering with limited migration S Berndt, L Epstein, K Jansen, A Levin, M Maack, L Rohwedder arXiv preprint arXiv:1904.06543, 2019 | 12 | 2019 |
| New Bounds for the Vertices of the Integer Hull∗ S Berndt, K Jansen, KM Klein Symposium on Simplicity in Algorithms (SOSA), 25-36, 2021 | 11 | 2021 |
| Positive-instance driven dynamic programming for graph searching M Bannach, S Berndt Algorithms and Data Structures: 16th International Symposium, WADS 2019 …, 2019 | 11 | 2019 |
| On the gold standard for security of universal steganography S Berndt, M Liśkiewicz Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018 | 10 | 2018 |
| 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 | 9 | 2020 |
| Load balancing: The long road from theory to practice S Berndt, MA Deppert, K Jansen, L Rohwedder 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments …, 2022 | 8 | 2022 |
| 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 | 8 | 2016 |
| Combined fault and leakage resilience: Composability, constructions and compiler S Berndt, T Eisenbarth, S Faust, M Gourjon, M Orlt, O Seker Annual International Cryptology Conference, 377-409, 2023 | 7 | 2023 |
| Side-channel protections for Picnic signatures DF Aranha, S Berndt, T Eisenbarth, O Seker, A Takahashi, L Wilke, ... IACR Transactions on Cryptographic Hardware and Embedded Systems, 239-282, 2021 | 6 | 2021 |
| " act natural!": Having a private chat on a public blockchain T Tiemann, S Berndt, T Eisenbarth, M Liskiewicz Cryptology ePrint Archive, 2021 | 5 | 2021 |
| Help, My Signal has Bad Device! Breaking the Signal Messenger’s Post-Compromise Security Through a Malicious Device J Wichelmann, S Berndt, C Pott, T Eisenbarth Detection of Intrusions and Malware, and Vulnerability Assessment: 18th …, 2021 | 5 | 2021 |
| 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 | 5 | 2019 |
| New support size bounds for integer programming, applied to makespan minimization on uniformly related machines S Berndt, H Brinkop, K Jansen, M Mnich, T Stamm arXiv preprint arXiv:2305.08432, 2023 | 4 | 2023 |
Klaus JansenProfessor, Computer Science, University of Kiel在 informatik.uni-kiel.de 的电子邮件经过验证
