Prof. Dr. Tobias Friedrich


Two papers accepted at SODA and TrustCom

The ACM-SIAM Symposium on Discrete Algorithms (SODA) is the most important scientific meeting on algorithms. Its 32nd edition, as well as all of its satellite events, will be held entirely online in January 2021. Authors of the Algorithm Engineering group will present the result of a close collaboration with Jordi Levy of the Spanish Council for Scientific Research in Barcelona. Together they investigated the influence of heterogeneity and locality on the proof complexity of random SAT instances. This gives some insights into the discrepancy between the theoretical hardness of SAT and the surprisingly good performance of modern solvers on industrial instances.

The 19th IEEE Conference on Trust, Security and Privacy in Computing and Communications (TrustCom 2020) provides a platform for researchers and practitioners in the area of trusted computing and communication. It will be held in a part-virtual format in Guangzhou, China, at the turn of the year. Gregor Lagodzinski, a PhD student with the group, contributes a work on privacy-preserving public verification. It was conceived during his internship at the SAP Innovation Center in Potsdam.

  • The Impact of Heterogenei... - Download
    Bläsius, Thomas; Friedrich, Tobias; Göbel, Andreas; Levy, Jordi; Rothenberger, RalfThe Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability. Symposium on Discrete Algorithms (SODA) 2021
  • Becher, Kilian; Lagodzinski, J. A. Gregor; Strufe, ThorstenPrivacy-Preserving Public Verification of Ethical Cobalt Sourcing. Trust, Security and Privacy in Computing and Communications (TrustCom) 2020