Improving Dependency Pairs. - Jürgen Giesl; René Thiemann; Peter Schneider-Kamp; Stephan Falke 001 (LPAR, 2003)

Improved Modular Termination Proofs Using Dependency Pairs. - René Thiemann; Jürgen Giesl; Peter Schneider-Kamp (IJCAR, 2004)

The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. - Jürgen Giesl; René Thiemann; Peter Schneider-Kamp (LPAR, 2004)

Automated Termination Proofs with AProVE. - Jürgen Giesl; René Thiemann; Peter Schneider-Kamp; Stephan Falke 001 (RTA, 2004)

Proving and Disproving Termination in the Dependency Pair Framework. - Jürgen Giesl; René Thiemann; Peter Schneider-Kamp (Deduction and Applications, 2005)

Proving and Disproving Termination of Higher-Order Functions. - Jürgen Giesl; René Thiemann; Peter Schneider-Kamp (FroCoS, 2005)

Automatic Termination Proofs in the Dependency Pair Framework. - Jürgen Giesl; Peter Schneider-Kamp; René Thiemann (IJCAR, 2006)

Automated Termination Analysis for Logic Programs by Term Rewriting. - Peter Schneider-Kamp; Jürgen Giesl; Alexander Serebrenik; René Thiemann (LOPSTR, 2006)

SAT Solving for Argument Filterings. - Michael Codish; Peter Schneider-Kamp; Vitaly Lagoon; René Thiemann; Jürgen Giesl (LPAR, 2006)

Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages. - Jürgen Giesl; Stephan Swiderski; Peter Schneider-Kamp; René Thiemann (RTA, 2006)

Mechanizing and Improving Dependency Pairs. - Jürgen Giesl; René Thiemann; Peter Schneider-Kamp; Stephan Falke 001 (J. Autom. Reason., 2006)

Proving Termination by Bounded Increase. - Jürgen Giesl; René Thiemann; Stephan Swiderski; Peter Schneider-Kamp (CADE, 2007)

Termination of Programs using Term Rewriting and SAT Solving. - Jürgen Giesl; Peter Schneider-Kamp; René Thiemann; Stephan Swiderski; Manh Thang Nguyen; Danny De Schreye; Alexander Serebrenik (Deduction and Decision Procedures, 2007)

Implementing RPO and POLO using SAT. - Peter Schneider-Kamp; Carsten Fuhs; René Thiemann; Jürgen Giesl; Elena Annov; Michael Codish; Aart Middeldorp; Harald Zankl (Deduction and Decision Procedures, 2007)

Decision Procedures for Loop Detection. - René Thiemann; Jürgen Giesl; Peter Schneider-Kamp (Deduction and Decision Procedures, 2007)

Proving Termination Using Recursive Path Orders and SAT Solving. - Peter Schneider-Kamp; René Thiemann; Elena Annov; Michael Codish; Jürgen Giesl (FroCoS, 2007)

Termination Analysis of Logic Programs Based on Dependency Graphs. - Manh Thang Nguyen; Jürgen Giesl; Peter Schneider-Kamp; Danny De Schreye (LOPSTR, 2007)

SAT Solving for Termination Analysis with Polynomial Interpretations. - Carsten Fuhs; Jürgen Giesl; Aart Middeldorp; Peter Schneider-Kamp; René Thiemann; Harald Zankl (SAT, 2007)

Search Techniques for Rational Polynomial Orders. - Carsten Fuhs; Rafael Navarro-Marset; Carsten Otto; Jürgen Giesl; Salvador Lucas; Peter Schneider-Kamp (AISC/MKM/Calculemus, 2008)

Improving Context-Sensitive Dependency Pairs. - Beatriz Alarcón; Fabian Emmes; Carsten Fuhs; Jürgen Giesl; Raúl Gutiérrez; Salvador Lucas; Peter Schneider-Kamp; René Thiemann (LPAR, 2008)

Maximal Termination. - Carsten Fuhs; Jürgen Giesl; Aart Middeldorp; Peter Schneider-Kamp; René Thiemann; Harald Zankl (RTA, 2008)

Deciding Innermost Loops. - René Thiemann; Jürgen Giesl; Peter Schneider-Kamp (RTA, 2008)

Adding constants to string rewriting. - René Thiemann; Hans Zantema; Jürgen Giesl; Peter Schneider-Kamp (Appl. Algebra Eng. Commun. Comput., 2008)

Static termination analysis for prolog using term rewriting and SAT solving. - Peter Schneider-Kamp (2008)

Termination Analysis by Dependency Pairs and Inductive Theorem Proving. - Stephan Swiderski; Michael Parting; Jürgen Giesl; Carsten Fuhs; Peter Schneider-Kamp (CADE, 2009)

Termination of Integer Term Rewriting. - Carsten Fuhs; Jürgen Giesl; Martin Plücker; Peter Schneider-Kamp; Stephan Falke 001 (Interaction versus Automation: The two Faces of Deduction, 2009)

Inductive Theorem Proving meets Dependency Pairs. - Stephan Swiderski; Michael Parting; Jürgen Giesl; Carsten Fuhs; Peter Schneider-Kamp (Interaction versus Automation: The two Faces of Deduction, 2009)

The Dependency Triple Framework for Termination of Logic Programs. - Peter Schneider-Kamp; Jürgen Giesl; Manh Thang Nguyen (LOPSTR, 2009)

Proving Termination of Integer Term Rewriting. - Carsten Fuhs; Jürgen Giesl; Martin Plücker; Peter Schneider-Kamp; Stephan Falke 001 (RTA, 2009)

Automated termination proofs for logic programs by term rewriting. - Peter Schneider-Kamp; Jürgen Giesl; Alexander Serebrenik; René Thiemann (ACM Trans. Comput. Log., 2009)

Dependency Triples for Improving Termination Analysis of Logic Programs with Cut. - Thomas Ströder; Peter Schneider-Kamp; Jürgen Giesl (LOPSTR, 2010)

Lazy Abstraction for Size-Change Termination. - Michael Codish; Carsten Fuhs; Jürgen Giesl; Peter Schneider-Kamp (LPAR (Yogyakarta), 2010)

Optimizing the AES S-Box using SAT. - Carsten Fuhs; Peter Schneider-Kamp (IWIL@LPAR, 2010)

Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT. - Carsten Fuhs; Peter Schneider-Kamp (SAT, 2010)

Loops under Strategies ... Continued - René Thiemann; Christian Sternagel; Jürgen Giesl; Peter Schneider-Kamp (IWS, 2010)

Static Termination Analysis for Prolog Using Term Rewriting and SAT Solving. - Peter Schneider-Kamp (Künstliche Intell., 2010)

Automated termination analysis for logic programs with cut. - Peter Schneider-Kamp; Jürgen Giesl; Thomas Ströder; Alexander Serebrenik; René Thiemann (Theory Pract. Log. Program., 2010)

A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog. - Thomas Ströder; Fabian Emmes; Peter Schneider-Kamp; Jürgen Giesl; Carsten Fuhs (LOPSTR, 2011)

Optimal Base Encodings for Pseudo-Boolean Constraints. - Michael Codish; Yoav Fekete; Carsten Fuhs; Peter Schneider-Kamp (TACAS, 2011)

Proving Termination by Dependency Pairs and Inductive Theorem Proving. - Carsten Fuhs; Jürgen Giesl; Michael Parting; Peter Schneider-Kamp; Stephan Swiderski (J. Autom. Reason., 2011)

Automated termination proofs for haskell by term rewriting. - Jürgen Giesl; Matthias Raffelsieper; Peter Schneider-Kamp; Stephan Swiderski; René Thiemann (ACM Trans. Program. Lang. Syst., 2011)

Polytool: Polynomial interpretations as a basis for termination analysis of logic programs. - Manh Thang Nguyen; Danny De Schreye; Jürgen Giesl; Peter Schneider-Kamp (Theory Pract. Log. Program., 2011)

Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs. - Jürgen Giesl; Thomas Ströder; Peter Schneider-Kamp; Fabian Emmes; Carsten Fuhs (LOPSTR, 2012)

SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs. - Michael Codish; Jürgen Giesl; Peter Schneider-Kamp; René Thiemann (J. Autom. Reason., 2012)

Proving Termination of Programs Automatically with AProVE. - Jürgen Giesl; Marc Brockschmidt; Fabian Emmes; Florian Frohn; Carsten Fuhs; Carsten Otto; Martin Plücker; Peter Schneider-Kamp; Thomas Ströder; Stephanie Swiderski; René Thiemann (IJCAR, 2014)

Proving Termination and Memory Safety for Programs with Pointer Arithmetic. - Thomas Ströder; Jürgen Giesl; Marc Brockschmidt; Florian Frohn; Carsten Fuhs; Jera Hensel; Peter Schneider-Kamp (IJCAR, 2014)

Group communication patterns for high performance computing in scala. - Felix Palludan Hargreaves; Daniel Merkle; Peter Schneider-Kamp (FHPC@ICFP, 2014)

Twenty-Five Comparators Is Optimal When Sorting Nine Inputs (and Twenty-Nine for Ten). - Michael Codish; Luís Cruz-Filipe; Michael Frank 002; Peter Schneider-Kamp (ICTAI, 2014)

The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes. - Michael Codish; Luís Cruz-Filipe; Peter Schneider-Kamp (SYNASC, 2014)

repAIrC: A Tool for Ensuring Data Consistency. - Luís Cruz-Filipe; Michael Franz; Artavazd Hakhverdyan; Marta Ludovico; Isabel Nunes; Peter Schneider-Kamp (KMIS, 2015)

Active Integrity Constraints: From Theory to Implementation. - Luís Cruz-Filipe; Michael Franz; Artavazd Hakhverdyan; Marta Ludovico; Isabel Nunes; Peter Schneider-Kamp (IC3K, 2015)

Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker. - Luís Cruz-Filipe; Peter Schneider-Kamp (ITP, 2015)

Sorting Networks: The End Game. - Michael Codish; Luís Cruz-Filipe; Peter Schneider-Kamp (LATA, 2015)

Applying Sorting Networks to Synthesize Optimized Sorting Libraries. - Michael Codish; Luís Cruz-Filipe; Markus Nebel; Peter Schneider-Kamp (LOPSTR, 2015)

Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof. - Luís Cruz-Filipe; Peter Schneider-Kamp (CICM, 2015)

When Six Gates are Not Enough. - Michael Codish; Luís Cruz-Filipe; Michael Frank 002; Peter Schneider-Kamp (CoRR, 2015)

repAIrC: A Tool for Ensuring Data Consistency by Means of Active Integrity Constraints. - Luís Cruz-Filipe; Michael Franz; Artavazd Hakhverdyan; Marta Ludovico; Isabel Nunes; Peter Schneider-Kamp (CoRR, 2015)

Active Integrity Constraints for Multi-context Systems. - Luís Cruz-Filipe; Graça Gaspar; Isabel Nunes; Peter Schneider-Kamp (EKAW, 2016)

Integrity Constraints for General-Purpose Knowledge Bases. - Luís Cruz-Filipe; Isabel Nunes; Peter Schneider-Kamp (FoIKS, 2016)

Sorting nine inputs requires twenty-five comparisons. - Michael Codish; Luís Cruz-Filipe; Michael Frank 002; Peter Schneider-Kamp (J. Comput. Syst. Sci., 2016)

Efficient Certified RAT Verification. - Luís Cruz-Filipe; Marijn J. H. Heule; Warren A. Hunt Jr.; Matt Kaufmann; Peter Schneider-Kamp (CADE, 2017)

How to Get More Out of Your Oracles. - Luís Cruz-Filipe; Kim S. Larsen; Peter Schneider-Kamp (ITP, 2017)

Formally Proving the Boolean Pythagorean Triples Conjecture. - Luís Cruz-Filipe; Peter Schneider-Kamp (LPAR, 2017)

Efficient Certified Resolution Proof Checking. - Luís Cruz-Filipe; João Marques-Silva 001; Peter Schneider-Kamp (TACAS (1), 2017)

Optimizing sorting algorithms by using sorting networks. - Michael Codish; Luís Cruz-Filipe; Markus Nebel; Peter Schneider-Kamp (Formal Aspects Comput., 2017)

Formally Proving Size Optimality of Sorting Networks. - Luís Cruz-Filipe; Kim S. Larsen; Peter Schneider-Kamp (J. Autom. Reason., 2017)

Analyzing Program Termination and Complexity Automatically with AProVE. - Jürgen Giesl; Cornelius Aschermann; Marc Brockschmidt; Fabian Emmes; Florian Frohn; Carsten Fuhs; Jera Hensel; Carsten Otto; Martin Plücker; Peter Schneider-Kamp; Thomas Ströder; Stephanie Swiderski; et al. (J. Autom. Reason., 2017)

Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic. - Thomas Ströder; Jürgen Giesl; Marc Brockschmidt; Florian Frohn; Carsten Fuhs; Jera Hensel; Peter Schneider-Kamp; Cornelius Aschermann (J. Autom. Reason., 2017)

Optimal-depth sorting networks. - Daniel Bundala; Michael Codish; Luís Cruz-Filipe; Peter Schneider-Kamp; Jakub Závodný (J. Comput. Syst. Sci., 2017)

Active integrity constraints for general-purpose knowledge bases. - Luís Cruz-Filipe; Graça Gaspar; Isabel Nunes; Peter Schneider-Kamp (Ann. Math. Artif. Intell., 2018)

System Design of an Open-Source Cloud-Based Framework for Internet of Drones Application. - Golizheh Mehrooz; Emad Ebeid; Peter Schneider-Kamp (DSD, 2019)

A Mixed Neural Network and Support Vector Machine Model for Tender Creation in the European Union TED Database. - Sangramsing Kayte; Peter Schneider-Kamp (KMIS, 2019)

Formally Verifying the Solution to the Boolean Pythagorean Triples Problem. - Luís Cruz-Filipe; João Marques-Silva 001; Peter Schneider-Kamp (J. Autom. Reason., 2019)

Sorting networks: To the end and back again. - Michael Codish; Luís Cruz-Filipe; Thorsten Ehlers; Mike Müller; Peter Schneider-Kamp (J. Comput. Syst. Sci., 2019)

Real-time On-board Detection of Components and Faults in an Autonomous UAV System for Power Line Inspection. - Naeem Ayoub; Peter Schneider-Kamp (DeLTA, 2020)

Optimal Path Planning for Drone Inspections of Linear Infrastructures. - Golizheh Mehrooz; Peter Schneider-Kamp (GISTAM, 2020)

Improving Semantic Similarity of Words by Retrofitting Word Vectors in Sense Level. - Rui Zhang 055; Peter Schneider-Kamp; Arthur Zimek (ICAART (2), 2020)

Explainable Detection of Zero Day Web Attacks. - Jonas Herskind Sejr; Arthur Zimek; Peter Schneider-Kamp (ICDIS, 2020)

Multi-Sense Language Modelling. - Andrea Lekkas; Peter Schneider-Kamp; Isabelle Augenstein (CoRR, 2020)

Web Application for Planning, Monitoring, and Controlling Autonomous Inspection Drones. - Golizheh Mehrooz; Peter Schneider-Kamp (MECO, 2021)

Surrogate Object Detection Explainer (SODEx) with YOLOv4 and LIME. - Jonas Herskind Sejr; Peter Schneider-Kamp; Naeem Ayoub (Mach. Learn. Knowl. Extr., 2021)

A Simple Meta-path-free Framework for Heterogeneous Network Embedding. - Rui Zhang 055; Arthur Zimek; Peter Schneider-Kamp (CIKM, 2022)

Unsupervised Representation Learning on Attributed Multiplex Network. - Rui Zhang 055; Arthur Zimek; Peter Schneider-Kamp (CIKM, 2022)

DRHDR: A Dual branch Residual Network for Multi-Bracket High Dynamic Range Imaging. - Juan Marín-Vega; Michael Sloth; Peter Schneider-Kamp; Richard Röttger (CVPR Workshops, 2022)

NTIRE 2022 Challenge on High Dynamic Range Imaging: Methods and Results. - Eduardo Pérez-Pellitero; Sibi Catley-Chandar; Richard Shaw; Ales Leonardis; Radu Timofte; Zexin Zhang; Cen Liu; Yunbo Peng; Yue Lin 002; Gaocheng Yu; Jin Zhang; Zhe Ma; et al. (CVPR Workshops, 2022)

Reversed Image Signal Processing and RAW Reconstruction. AIM 2022 Challenge Report. - Marcos V. Conde; Radu Timofte; Yibin Huang; Jingyang Peng; Chang Chen; Cheng Li 009; Eduardo Pérez-Pellitero; Fenglong Song; Furui Bai; Shuai Liu 009; Chaoyu Feng; Xiaotao Wang; et al. (ECCV Workshops (3), 2022)

Approximate Dictionary Searching at a Scale using Ternary Search Trees and Implicit Levenshtein Automata. - Peter Schneider-Kamp (ICSOFT, 2022)

From Monolith to Microservices: Software Architecture for Autonomous UAV Infrastructure Inspection. - Lea Matlekovic; Peter Schneider-Kamp (CoRR, 2022)

Microservices for autonomous UAV inspection with UAV simulation as a service. - Lea Matlekovic; Filip Juric; Peter Schneider-Kamp (Simul. Model. Pract. Theory, 2022)

Sharing is CAIRing: Characterizing Principles and Assessing Properties of Universal Privacy Evaluation for Synthetic Tabular Data. - Tobias Hyrup; Anton Danholt Lautrup; Arthur Zimek; Peter Schneider-Kamp (CoRR, 2023)

BitNet B1.58 Reloaded: State-of-the-Art Performance Also on Smaller Networks. - Jacob Nielsen; Peter Schneider-Kamp (DeLTA (2), 2024)

Synthesizers: A Meta-Framework for Generating and Evaluating High-Fidelity Tabular Synthetic Data. - Peter Schneider-Kamp; Anton Danholt Lautrup; Tobias Hyrup (ICSOFT, 2024)

Minimizing Sorting Networks at the Sub-Comparator Level. - Luís Cruz-Filipe; Peter Schneider-Kamp (LPAR, 2024)

Encoder vs Decoder: Comparative Analysis of Encoder and Decoder Language Models on Multilingual NLU Tasks. - Dan Saattrup Nielsen; Kenneth C. Enevoldsen; Peter Schneider-Kamp (CoRR, 2024)

When are 1.58 bits enough? A Bottom-up Exploration of BitNet Quantization. - Jacob Nielsen; Lukas Galke; Peter Schneider-Kamp (CoRR, 2024)

Continual Quantization-Aware Pre-Training: When to transition from 16-bit to 1.58-bit pre-training for BitNet language models? - Jacob Nielsen; Peter Schneider-Kamp; Lukas Galke (ACL (Findings), 2025)

Interview Bot: Can Agentic LLM's Perform Ethnographic Interviews? - Stine Lyngsø Beltoft; Peter Schneider-Kamp; Søren Tollestrup Askegaard (ICAART (1), 2025)

When Are 1.58 Bits Enough? A Bottom-up Exploration of Quantization-Aware Training with Ternary Weights. - Jacob Nielsen; Lukas Galke; Peter Schneider-Kamp (ICAART (3), 2025)

Syntheval: a framework for detailed utility and privacy evaluation of tabular synthetic data. - Anton Danholt Lautrup; Tobias Hyrup; Arthur Zimek; Peter Schneider-Kamp (Data Min. Knowl. Discov., 2025)

FlexDeMo: Decoupled Momentum Optimization for Fully and Hybrid Sharded Training. - Mogens Henrik From; Jacob Nielsen; Lukas Galke; Peter Schneider-Kamp (CoRR, 2025)

Systematic Review of Generative Modelling Tools and Utility Metrics for Fully Synthetic Tabular Data. - Anton Danholt Lautrup; Tobias Hyrup; Arthur Zimek; Peter Schneider-Kamp (ACM Comput. Surv., 2025)

Disjoint Generative Models. - Anton Danholt Lautrup; Muhammad Rajabinasab; Tobias Hyrup; Arthur Zimek; Peter Schneider-Kamp (CoRR, 2025)

Dynaword: From One-shot to Continuously Developed Datasets. - Kenneth C. Enevoldsen; Kristian Nørgaard Jensen; Jan Kostkan; Balázs Szabó; Márton Kardos; Kirten Vad; Johan Heinsen; Andrea Blasi Núñez; Gianluca Barmina; Jacob Nielsen; Rasmus Larsen 001; Peter Bjerregaard Vahlstrup; et al. (CoRR, 2025)

Randomized PCA Forest for Outlier Detection. - Muhammad Rajabinasab; Farhad Pakdaman; Moncef Gabbouj; Peter Schneider-Kamp; Arthur Zimek (CoRR, 2025)