Publications | Interactive Inference

2025

A. Schleitzer and O. Beyersdorff. Computationally Hard Problems Are Hard for QBF Proof Systems Too. Proceedings of the 39th AAAI Conference on Artificial Intelligence (AAAI), (2025)
L. P. Staus, C. Komusiewicz, F. Sommer, and M. Sorge. Witty: An Efficient Solver for Computing Minimum-Size Decision Trees. Proceedings of the 39th AAAI Conference on Artificial Intelligence (AAAI), (2025)
C. Komusiewicz, A. Schidler, F. Sommer, M. Sorge, and L. P. Staus. Learning Minimum-Size BDDs: Towards Efficient Exact Algorithms. Proceedings of the 42nd International Conference on Machine Learning (ICML), (2025)
H. M. Bücker, C. Komusiewicz, and J. Rostalsky. Heuristic graph colouring using hypergraph representations. Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms (ACDA), (2025)
T. Bosse and H. M. Bücker. Algorithmic Differentiation and Vertex Elimination on Computational Hypergraphs. Proceedings of the SIAM Conference on Applied and Computational Discrete Algorithms (ACDA), (2025)
J. Schoder and H. M. Bücker. Exploring Data Science Workflows: A Practice-Oriented Approach to Teaching Processing of Massive Datasets. Journal of Parallel and Distributed Computing, (2025)
B. Zahoransky, T. Günther, and K. Lawonn. PrismBreak: Exploration of Multi-Dimensional Mixture Models. Computer Graphics Forum, (2025)
A. Breuer, M. Blacher, M. Engel, J. Giesen, A. Heinecke, J. Klaus and S. Remke. Einsum Trees: An Abstraction for Optimizing the Execution of Tensor Expressions. Proceedings of the 30th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), (2025)
P. Kahlmeyer, M. Fischer and J. Giesen. Dimension Reduction for Symbolic Regression. Proceedings of the 39th AAAI Conference on Artificial Intelligence (AAAI), (2025)
P. Kahlmeyer, N. Merk and J. Giesen. Discovering Symmetries of ODEs by Symbolic Regression. Proceedings of the 39th AAAI Conference on Artificial Intelligence (AAAI), (2025)

2024

B. Böhm and O. Beyersdorff. QCDCL vs QBF Resolution: Further Insights. Journal of Artificial Intelligence Research (JAIR), (2024)
O. Beyersdorff, J. Clymo, S. S. Dantchev and B. Martin. The Riis Complexity Gap for QBF Resolution. Journal on Satisfiability, Boolean Modelling and Computation, (2024)
O. Beyersdorff, T. Hoffmann and L. N. Spachmann. Proof Complexity of Propositional Model Counting. Journal on Satisfiability, Boolean Modelling and Computation, (2024)
O. Beyersdorff, J. L. Blinkhorn and T. Peitl. Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths. Transactions on Computation Theory, (2024)
J. Garvardt and C. Komusiewicz. Modularity Clustering parameterized by Max Leaf Number. Proceedings of the 19th International Symposium on Parameterized and Exact Computation (IPEC), (2024)
J. Garvardt, C. Komusiewicz, B. Lorke and J. Schestag. Protective and Nonprotective Subset Sum Games: A Parameterized Complexity Analysis. Proceedings of the 8th International Conference on Algorithmic Decision Theory (ADT), (2024)
J. Garvardt, C. Komusiewicz and N. Morawietz. When Can Cluster Deletion with Bounded Weights Be Solved Efficiently? Proceedings of the 35th International Symposium on Algorithms and Computation (ISAAC), (2024)
S. Remke and A. Breuer. Hello SME! Generating Fast Matrix Multiplication Kernels Using the Scalable Matrix Extension. SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis, (2024)
B. Böhm, T. Peitl and O. Beyersdorff. QCDCL with cube learning or pure literal elimination - What is best? Artificial Intelligence 336: 104194, (2024)
O. Beyersdorff, J. Blinkhorn, M. Mahajan, T. Peitl and G. Sood. Hard QBFs for Merge Resolution. ACM Transactions on Computation Theory, (2024)
O. Beyersdorff, J.K. Fichte, M. Hecher, T. Hoffmann and K. Kasche. The Relative Strength of #SAT Proof Systems. Proceedings of the 27th International Conference on Theory and Applications of Satisfiability Testing (SAT), (2024)
O. Beyersdorff, T. Hoffmann, K. Kasche and L.N. Spachmann. Polynomial Calculus for Quantified Boolean Logic: Lower Bounds Through Circuits and Degree. Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science (MFCS), (2024)
T. Bosse and H. M. Bücker. A piecewise smooth version of the Griewank function. Optimization Methods and Software, (2024)
J. Schoder and H. M. Bücker. Scaling an Augmented RISC-V Processor Design with High-Level Synthesis. Proceedings of the 4th International Workshop on RISC-V for HPC at the 39th International conference on High Performance Computing (ISC), (2024)
T. Bosse and H. M. Bücker. Vertex Elimination for Algorithmic Piecewise Differentiation. Proceedings of the 8th International Conference on Algorithmic Differentiation (AD), (2024)
M. Blacher, C. Staudt, J. Klaus, M. Wenig, N. Merk, A. Breuer, M. Engel, S. Laue and J. Giesen. Einsum Benchmark: Enabling the Development of Next-Generation Tensor Execution Engines. Proceedings of the 38d Conference on Neural Information Processing Systems (NeurIPS datasets and benchmarks track), (2024)
M. Wenig, H. Barschel, J. Giesen, A. Goral and M. Blacher. Serving MPE Queries with Tensor Networks by Computing Derivatives. Proceedings of the 12th International Conference on Probabilistic Graphical Models (PGM), (2024)
O. Beyersdorff, B. Böhm and M. Mahajan. Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs. Proceedings of the 38d AAAI Conference on Artificial Intelligence (AAAI), (2024)
B. Böhm, T. Peitl and O. Beyersdorff. Should Decisions in QCDCL Follow Prefix Order? Journal of Automated Reasoning 68(1), (2024)
P. Schär, M. Habeck and D. Rudolf. Parallel Affine Transformation Tuning of Markov Chain Monte Carlo. Proceedings of the 41st International Conference on Machine Learning (ICML), (2024)
J. Giesen, P. Lucas, L. Pfeiffer, L. Schmalwasser and Kai Lawonn. The Whole and its Parts: Visualizing Gaussian Mixture Models. Visual Informatics, (2024)
K. Lawonn, M. Meuschke and T. Günther. InverseVis: Revealing the Hidden with Curved Sphere Tracing. Computer Graphics Forum (CGF) 43(3), (2024)
C. Höner zu Siederdissen, J. Spangenberg, K. Bisdorf, S. Krautwurst, A. Srivastava, M. Marz and M. Taubert. Nanopore sequencing enables novel detection of deuterium incorporation in DNA. Computational and Structural Biotechnology, (2024)
P. Rump, N. Merk, J. Klaus, M. Wenig and J. Giesen. Convexity Certificates for Symbolic Tensor Expressions. Proceedings of the 33d International Joint Conference on Artificial Intelligence (IJCAI), (2024)
P. Kahlmeyer, J. Giesen, M. Habeck and H. Voigt. Scaling Up Unbiased Search-based Symbolic Regression. Proceedings of the 33d International Joint Conference on Artificial Intelligence (IJCAI), (2024)
C. Staudt, M. Blacher, J. Klaus, F. Lippmann and J. Giesen. Improved Cut Strategy for Tensor Network Contraction Orders. Proceedings of the 22nd Symposium on Experimental and Efficient Algorithms (SEA), (2024)
A. Goral, J. Giesen, M. Blacher, C. Staudt and J. Klaus. Model Counting and Sampling via Semiring Extensions. Proceedings of the 38d AAAI Conference on Artificial Intelligence (AAAI), (2024)
D. Rudolf and P. Schär. Dimension-independent spectral gap of polar slice sampling. Statistics and Computing 34, (2024)

2023

B. Böhm and O.Beyersdorff. Lower Bounds for QCDCL via Formula Gauge. Journal of Automated Reasoning 67(4), (2023)
J. Garvardt, M. Renken, J. Schestag and M. Weller. Finding Degree-Constrained Acyclic Orientations. Proceedings of the 18th International Symposium on Parameterized and Exact Computation (IPEC), (2023)
J. Garvardt, N. Morawietz, A. Nichterlein and M. Weller. Graph Clustering Problems Under the Lens of Parameterized Local Search. Proceedings of the 18th International Symposium on Parameterized and Exact Computation (IPEC), (2023)
P. Schär. Wasserstein contraction and spectral gap of slice sampling revisited. Electronic Journal of Probability 28, (2023)
A. Schleitzer and O. Beyersdorff. Classes of Hard Formulas for QBF Resolution. Journal of Artificial Intelligence Research (JAIR), (2023)
O. Beyersdorff and B. Böhm. Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution. Logical Methods in Computer Science 19(2), (2023)
O. Beyersdorff, T. Hoffmann, and L. Spachmann. Proof Complexity of Propositional Model Counting. Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing (SAT), (2023)
B. Böhm and O. Beyersdorff. QCDCL vs QBF Resolution: Further Insights. Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing (SAT), (2023) Best student paper award
P. Schär, M. Habeck, and D. Rudolf. Gibbsian polar slice sampling. Proceedings of the 40th International Conference on Machine Learning (ICML), (2023)
M. Blacher, J. Giesen, J. Klaus, C. Staudt, S. Laue, and V. Leis. Efficient and Portable Einstein Summation in SQL. Proceedings of the 49th ACM SIGMOD Conference on Management of Data (SIGMOD), (2023)
J. Klaus, M. Blacher, A. Goral, P. Lucas, and J. Giesen. A Visual Analytics Workflow for Probabilistic Modeling. Visual Informatics, (2023)
J. Klaus, M. Blacher and J. Giesen. Compiling Tensor Expressions into Einsum. Proceedings of the 23d International Conference on Computational Science (ICCS), (2023)
M. Mitterreiter, M. Koch, J. Giesen and S. Laue. Why Capsule Neural Networks Do Not Scale: Challenging the Dynamic Parse-Tree Assumption. Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI), (2023)
O. Beyersdorff, J. Blinkhorn, M. Mahajan and T. Peitl. Hardness Characterisations and Size-width Lower Bounds for QBF Resolution. ACM Transactions on Computational Logic (TOCL) 24(2): 10:1-10:30 (2023)

2022

J. Klaus, S. Laue, N. Merk, K. Wiedom, and J. Giesen. Convexity Certificates from Hessians. Proceedings of the 36th Conference on Neural Information Processing Systems (NeurIPS), (2022)
D. Eggers, C. Höner zu Siederdissen, and Peter F. Stadler. Accuracy of RNA Structure Prediction Depends on the Pseudoknot Grammar. Proceedings of the 5th Brazilian Symposium on Bioinformatics (BSB), (2022) 20-31
K. Lawonn, M. Meuschke, P. Eulzer, M. Mitterreiter, J. Giesen, and T. Günther. GRay: Ray Casting for Visualization and Interactive Data Exploration of Gaussian Mixture Models. IEEE Transactions on Visualization and Computer Graphics (IEEE Visualization), (2022) Video and Code Honorable mention award
B. Böhm, T. Peitl, and O. Beyersdorff. QCDCL with Cube Learning or Pure Literal Elimination - What is Best? Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI), (2022) 1781-1787 Distinguished paper award
J. Giesen, P. Kahlmeyer, F. Nussbaum and S. Zarriess. Leveraging the Wikipedia Graph for Evaluating Word Embeddings. Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI), (2022) 4136-4142
B. Böhm, T. Peitl, and O. Beyersdorff. Should Decisions in QCDCL Follow Prefix Order? Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing (SAT), (2022) 11:1-11:19
A. Schleitzer and O. Beyersdorff. Classes of Hard Formulas for QBF Resolution. Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing (SAT), (2022) 5:1-5:18 Shortlisted for the best-paper award
J. Klaus, M. Blacher, J. Giesen, P. Rump and K. Wiedom. Compiling Linear Algebra Expressions into Efficient Code. Proceedings of the 22nd International Conference on Computational Science (ICCS), (2022) 11-17
E. Georganas, D. Kalamkar, S. Avancha, M. Adelman, D. Aggarwal, C. Anderson, A. Breuer, J. Bruestle, N. Chaudhary, A. Kundu, D. Kutnick, F. Laub, V. Md, S. Misra, R. Mohanty, H. Pabst, B. Retford, B. Ziv, A. Heinecke. Tensor Processing Primitives: A Programming Abstraction for Efficiency and Portability in Deep Learning and HPC Workloads. Frontiers in Applied Mathematics and Statistics 8:826269