Paper accepted at Asiacrypt 2026
The paper "Timed Lossy Trapdoor Functions and Their Applications" by Hamza Abusalah, Karen Azari and Maximilian von Consbruch has been accepted at the conference Asiacrypt 2026.
The unit Theory and Applications of Algorithms (TAA) studies challenges in combinatorial and numerical algorithms as well as in cryptography from both a theoretical and an application-oriented viewpoint. It comprises the following working groups: Numerical High Performance Computing, Algorithms and Optimization, Algorithm Engineering, Foundations of Cryptography.
The research group Theory and Applications of Algorithms (TAA) consists of four work groups that are headed by their respective group leaders:
The paper "Timed Lossy Trapdoor Functions and Their Applications" by Hamza Abusalah, Karen Azari and Maximilian von Consbruch has been accepted at the conference Asiacrypt 2026.
The paper "Incremental k-lowest planes and planar k-nearest neighbor with optimal query time" by John Iacono, Yakov Nekrich, Martin P. Seybold has been accepted at the conference The International Colloquium on Automata, Languages, and Programming (ICALP 2026).
The paper "Incremental Approximate Maximum Flow via Residual Graph Sparsification" by Gramoz Goranci, Monika Henzinger, Harald Räcke, A. R. Sricharan has been accepted to the journal ACM Transactions on Algorithms.