Dr. rer. nat. Sebastian Berndt

Wissenschaftlicher Mitarbeiter
Ratzeburger Allee 160
23562 Lübeck
Gebäude 64, 1. OG, Raum 049
Email: | s.berndt(at)uni-luebeck.de |
Phone: | +49 451 3101 6613 |
Fax: | +49 451 3101 6604 |
Publikationen
2020
-
Sebastian Berndt and Klaus Jansen and Alexandra Lassota: Tightness of Sensitivity and Proximity Bounds for Integer Programs. in SOFSEM (accepted), 2021
@inproceedings{BJL2020, author = {Sebastian Berndt and Klaus Jansen and Alexandra Lassota}, title = {Tightness of Sensitivity and Proximity Bounds for Integer Programs}, booktitle = {{SOFSEM} (accepted)}, year = {2021} }
-
Okan Seker and Sebastian Berndt and Luca Wilke and Thomas Eisenbarth: SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis. in CCS (accepted), 2020
@inproceedings{cryptoeprint:2020:544, author = {Okan Seker and Sebastian Berndt and Luca Wilke and Thomas Eisenbarth}, title = {SNI-in-the-head: Protecting MPC-in-the-head Protocols against Side-channel Analysis}, booktitle = {{CCS} (accepted)}, year = {2020}, note = {\url{https://eprint.iacr.org/2020/544}}, url = {https://eprint.iacr.org/2020/544}, }
-
Max Bannach and Sebastian Berndt and Marten Maack and Matthias Mnich and Alexandra Lassota and Malin Rau and Malte Skambath: Solving Packing Problems with Few Small Items Using Rainbow Matchings. in MFCS 2020,, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020
@inproceedings{BerndtMFCS2020, author = {Max Bannach and Sebastian Berndt and Marten Maack and Matthias Mnich and Alexandra Lassota and Malin Rau and Malte Skambath}, title = {Solving Packing Problems with Few Small Items Using Rainbow Matchings}, booktitle = {MFCS 2020, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, }
-
Sebastian Berndt and Klaus Jansen and Kim-Manuel Klein: New Bounds for the Vertices of the Integer Hull. CoRR, no. abs/2006.10847, 2020
@article{DBLP:journals/corr/abs-2006-10847, author = {Sebastian Berndt and Klaus Jansen and Kim{-}Manuel Klein}, title = {New Bounds for the Vertices of the Integer Hull}, journal = {CoRR}, volume = {abs/2006.10847}, year = {2020}, url = {https://arxiv.org/abs/2006.10847}, archivePrefix = {arXiv}, eprint = {2006.10847}, timestamp = {Tue, 23 Jun 2020 17:57:22 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2006-10847.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
-
Sebastian Berndt and Klaus Jansen and Kim-Manuel Klein: Fully dynamic bin packing revisited. Math. Program., no. 179, pp. 109-155, 2020
@article{DBLP:journals/mp/BerndtJK20, author = {Sebastian Berndt and Klaus Jansen and Kim{-}Manuel Klein}, title = {Fully dynamic bin packing revisited}, journal = {Math. Program.}, volume = {179}, number = {1}, pages = {109--155}, year = {2020} }
2019
-
Max Bannach and Sebastian Berndt: Practical Access to Dynamic Programming on Tree Decompositions. Algorithms, no. 12, pp. 172, 2019
@article{DBLP:journals/algorithms/BannachB19, author = {Max Bannach and Sebastian Berndt}, title = {Practical Access to Dynamic Programming on Tree Decompositions}, journal = {Algorithms}, volume = {12}, number = {8}, pages = {172}, year = {2019} }
-
Sebastian Berndt and Valentin Dreismann and Kilian Grage and Klaus Jansen and Ingmar Knof: Robust Online Algorithms for Certain Dynamic Packing Problems. in WAOA, no. 11926, pp. 43-59, Springer, 2019
@inproceedings{DBLP:conf/waoa/BerndtDGJK19, author = {Sebastian Berndt and Valentin Dreismann and Kilian Grage and Klaus Jansen and Ingmar Knof}, title = {Robust Online Algorithms for Certain Dynamic Packing Problems}, booktitle = {{WAOA}}, series = {Lecture Notes in Computer Science}, volume = {11926}, pages = {43--59}, publisher = {Springer}, year = {2019} }
-
Sebastian Berndt and Leah Epstein and Klaus Jansen and Asaf Levin and Marten Maack and Lars Rohwedder: Online Bin Covering with Limited Migration. in ESA, no. 144, pp. 18:1-18:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019
@inproceedings{DBLP:conf/esa/BerndtEJLMR19, author = {Sebastian Berndt and Leah Epstein and Klaus Jansen and Asaf Levin and Marten Maack and Lars Rohwedder}, title = {Online Bin Covering with Limited Migration}, booktitle = {{ESA}}, series = {LIPIcs}, volume = {144}, pages = {18:1--18:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019} }
-
Max Bannach and Sebastian Berndt: Positive-Instance Driven Dynamic Programming for Graph Searching. in WADS, no. 11646, pp. 43-56, Springer, 2019
@inproceedings{DBLP:conf/wads/BannachB19, author = {Max Bannach and Sebastian Berndt}, title = {Positive-Instance Driven Dynamic Programming for Graph Searching}, booktitle = {{WADS}}, series = {Lecture Notes in Computer Science}, volume = {11646}, pages = {43--56}, publisher = {Springer}, year = {2019} }
2018
-
Max Bannach and Sebastian Berndt: Practical Access to Dynamic Programming on Tree Decompositions. in ESA, no. 112, pp. 6:1-6:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018
@inproceedings{DBLP:conf/esa/BannachB18, author = {Max Bannach and Sebastian Berndt}, title = {Practical Access to Dynamic Programming on Tree Decompositions}, booktitle = {{ESA}}, series = {LIPIcs}, volume = {112}, pages = {6:1--6:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018} }
-
Sebastian Berndt: Computing Tree Width: From Theory to Practice and Back. in CiE, no. 10936, pp. 81-88, Springer, 2018
@inproceedings{DBLP:conf/cie/Berndt18, author = {Sebastian Berndt}, title = {Computing Tree Width: From Theory to Practice and Back}, booktitle = {CiE}, series = {Lecture Notes in Computer Science}, volume = {10936}, pages = {81--88}, publisher = {Springer}, year = {2018} }
-
Sebastian Berndt and Kim-Manuel Klein: Using Structural Properties for Integer Programs. in CiE, no. 10936, pp. 89-96, Springer, 2018
@inproceedings{DBLP:conf/cie/BerndtK18, author = {Sebastian Berndt and Kim{-}Manuel Klein}, title = {Using Structural Properties for Integer Programs}, booktitle = {CiE}, series = {Lecture Notes in Computer Science}, volume = {10936}, pages = {89--96}, publisher = {Springer}, year = {2018} }
-
Sebastian Berndt and Maciej Liskiewicz: On the Gold Standard for Security of Universal Steganography. in EUROCRYPT (1), no. 10820, pp. 29-60, Springer, 2018
@inproceedings{DBLP:conf/eurocrypt/BerndtL18, author = {Sebastian Berndt and Maciej Liskiewicz}, title = {On the Gold Standard for Security of Universal Steganography}, booktitle = {{EUROCRYPT} {(1)}}, series = {Lecture Notes in Computer Science}, volume = {10820}, pages = {29--60}, publisher = {Springer}, year = {2018} }
2017
-
Sebastian Berndt and Maciej Liskiewicz: Algorithm Substitution Attacks from a Steganographic Perspective. in ACM Conference on Computer and Communications Security, pp. 1649-1660, ACM, 2017
@inproceedings{DBLP:conf/ccs/BerndtL17, author = {Sebastian Berndt and Maciej Liskiewicz}, title = {Algorithm Substitution Attacks from a Steganographic Perspective}, booktitle = {{ACM} Conference on Computer and Communications Security}, pages = {1649--1660}, publisher = {{ACM}}, year = {2017} }
-
Max Bannach and Sebastian Berndt and Thorsten Ehlers: Jdrasil: A Modular Library for Computing Tree Decompositions. in SEA, no. 75, pp. 28:1-28:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017
@inproceedings{DBLP:conf/wea/BannachBE17, author = {Max Bannach and Sebastian Berndt and Thorsten Ehlers}, title = {Jdrasil: {A} Modular Library for Computing Tree Decompositions}, booktitle = {{SEA}}, series = {LIPIcs}, volume = {75}, pages = {28:1--28:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017} }
-
Sebastian Berndt and Maciej Liskiewicz and Matthias Lutter and Rüdiger Reischuk: Learning Residual Alternating Automata. in AAAI, pp. 1749-1755, AAAI Press, 2017
@inproceedings{DBLP:conf/aaai/BerndtLLR17, author = {Sebastian Berndt and Maciej Liskiewicz and Matthias Lutter and R{\"{u}}diger Reischuk}, title = {Learning Residual Alternating Automata}, booktitle = {{AAAI}}, pages = {1749--1755}, publisher = {{AAAI} Press}, year = {2017} }
2016
-
Sebastian Berndt and Maciej Liskiewicz: Hard Communication Channels for Steganography. in ISAAC, no. 64, pp. 16:1-16:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016
@inproceedings{DBLP:conf/isaac/BerndtL16, author = {Sebastian Berndt and Maciej Liskiewicz}, title = {Hard Communication Channels for Steganography}, booktitle = {{ISAAC}}, series = {LIPIcs}, volume = {64}, pages = {16:1--16:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016} }
-
Sebastian Berndt and Maciej Liskiewicz: Provable Secure Universal Steganography of Optimal Rate: Provably Secure Steganography does not Necessarily Imply One-Way Functions. in IH&MMSec, pp. 81-92, ACM, 2016
@inproceedings{DBLP:conf/ih/BerndtL16, author = {Sebastian Berndt and Maciej Liskiewicz}, title = {Provable Secure Universal Steganography of Optimal Rate: Provably Secure Steganography does not Necessarily Imply One-Way Functions}, booktitle = {IH&MMSec}, pages = {81--92}, publisher = {{ACM}}, year = {2016} }
-
Sebastian Berndt and Rüdiger Reischuk: Steganography Based on Pattern Languages. in LATA, no. 9618, pp. 387-399, Springer, 2016
@inproceedings{DBLP:conf/lata/BerndtR16, author = {Sebastian Berndt and R{\"{u}}diger Reischuk}, title = {Steganography Based on Pattern Languages}, booktitle = {{LATA}}, series = {Lecture Notes in Computer Science}, volume = {9618}, pages = {387--399}, publisher = {Springer}, year = {2016} }
2015
-
Sebastian Berndt and Klaus Jansen and Kim-Manuel Klein: Fully Dynamic Bin Packing Revisited. in APPROX-RANDOM, no. 40, pp. 135-151, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015
@inproceedings{DBLP:conf/approx/BerndtJK15, author = {Sebastian Berndt and Klaus Jansen and Kim{-}Manuel Klein}, title = {Fully Dynamic Bin Packing Revisited}, booktitle = {{APPROX-RANDOM}}, series = {LIPIcs}, volume = {40}, pages = {135--151}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015} }