Peter Schneider-Kamp

ACM Comput. Surv., April, 2025

FlexDeMo: Decoupled Momentum Optimization for Fully and Hybrid Sharded Training.

[BibT_eX]

[DOI]

CoRR, February, 2025

Syntheval: a framework for detailed utility and privacy evaluation of tabular synthetic data.

[BibT_eX]

[DOI]

Data Min. Knowl. Discov., January, 2025

2024

When are 1.58 bits enough? A Bottom-up Exploration of BitNet Quantization.

[BibT_eX]

[DOI]

Jacob Nielsen

Lukas Galke

CoRR, 2024

Encoder vs Decoder: Comparative Analysis of Encoder and Decoder Language Models on Multilingual NLU Tasks.

[BibT_eX]

[DOI]

Dan Saattrup Nielsen

Kenneth Enevoldsen

CoRR, 2024

Minimizing Sorting Networks at the Sub-Comparator Level.

[BibT_eX]

[DOI]

Proceedings of the LPAR 2024: Proceedings of 25th Conference on Logic for Programming, 2024

Synthesizers: A Meta-Framework for Generating and Evaluating High-Fidelity Tabular Synthetic Data.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Software Technologies, 2024

BitNet B1.58 Reloaded: State-of-the-Art Performance Also on Smaller Networks.

[BibT_eX]

[DOI]

Jacob Nielsen

Proceedings of the Deep Learning Theory and Applications, 2024

2023

Sharing is CAIRing: Characterizing Principles and Assessing Properties of Universal Privacy Evaluation for Synthetic Tabular Data.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Microservices for autonomous UAV inspection with UAV simulation as a service.

[BibT_eX]

[DOI]

Lea Matlekovic

Filip Juric

Simul. Model. Pract. Theory, 2022

From Monolith to Microservices: Software Architecture for Autonomous UAV Infrastructure Inspection.

[BibT_eX]

[DOI]

Lea Matlekovic

CoRR, 2022

Approximate Dictionary Searching at a Scale using Ternary Search Trees and Implicit Levenshtein Automata.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Software Technologies, 2022

Reversed Image Signal Processing and RAW Reconstruction. AIM 2022 Challenge Report.

[BibT_eX]

[DOI]

Eduardo Pérez-Pellitero

Proceedings of the Computer Vision - ECCV 2022 Workshops, 2022

NTIRE 2022 Challenge on High Dynamic Range Imaging: Methods and Results.

[BibT_eX]

[DOI]

Eduardo Pérez-Pellitero

Truong Thanh Nhat Mai

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, 2022

DRHDR: A Dual branch Residual Network for Multi-Bracket High Dynamic Range Imaging.

[BibT_eX]

[DOI]

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, 2022

Unsupervised Representation Learning on Attributed Multiplex Network.

[BibT_eX]

[DOI]

Rui Zhang

Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022

A Simple Meta-path-free Framework for Heterogeneous Network Embedding.

[BibT_eX]

[DOI]

Rui Zhang

Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022

2021

Surrogate Object Detection Explainer (SODEx) with YOLOv4 and LIME.

[BibT_eX]

[DOI]

Jonas Herskind Sejr

Naeem Ayoub

Mach. Learn. Knowl. Extr., 2021

Web Application for Planning, Monitoring, and Controlling Autonomous Inspection Drones.

[BibT_eX]

[DOI]

Golizheh Mehrooz

Proceedings of the 10th Mediterranean Conference on Embedded Computing, 2021

2020

Multi-Sense Language Modelling.

[BibT_eX]

[DOI]

Andrea Lekkas

Isabelle Augenstein

CoRR, 2020

Explainable Detection of Zero Day Web Attacks.

[BibT_eX]

[DOI]

Jonas Herskind Sejr

Proceedings of the 3rd International Conference on Data Intelligence and Security, 2020

Improving Semantic Similarity of Words by Retrofitting Word Vectors in Sense Level.

[BibT_eX]

[DOI]

Rui Zhang

Proceedings of the 12th International Conference on Agents and Artificial Intelligence, 2020

Optimal Path Planning for Drone Inspections of Linear Infrastructures.

[BibT_eX]

[DOI]

Golizheh Mehrooz

Proceedings of the 6th International Conference on Geographical Information Systems Theory, 2020

Real-time On-board Detection of Components and Faults in an Autonomous UAV System for Power Line Inspection.

[BibT_eX]

[DOI]

Naeem Ayoub

Proceedings of the 1st International Conference on Deep Learning Theory and Applications, 2020

2019

Sorting networks: To the end and back again.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Formally Verifying the Solution to the Boolean Pythagorean Triples Problem.

[BibT_eX]

[DOI]

João Marques-Silva

J. Autom. Reason., 2019

A Mixed Neural Network and Support Vector Machine Model for Tender Creation in the European Union TED Database.

[BibT_eX]

[DOI]

Sangramsing Kayte

Proceedings of the 11th International Joint Conference on Knowledge Discovery, 2019

System Design of an Open-Source Cloud-Based Framework for Internet of Drones Application.

[BibT_eX]

[DOI]

Golizheh Mehrooz

Emad Ebeid

Proceedings of the 22nd Euromicro Conference on Digital System Design, 2019

2018

Active integrity constraints for general-purpose knowledge bases.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2018

2017

Optimal-depth sorting networks.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic.

[BibT_eX]

[DOI]

J. Autom. Reason., 2017

Analyzing Program Termination and Complexity Automatically with AProVE.

[BibT_eX]

[DOI]

J. Autom. Reason., 2017

Formally Proving Size Optimality of Sorting Networks.

[BibT_eX]

[DOI]

Kim S. Larsen

J. Autom. Reason., 2017

Optimizing sorting algorithms by using sorting networks.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2017

Efficient Certified Resolution Proof Checking.

[BibT_eX]

[DOI]

João Marques-Silva

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Formally Proving the Boolean Pythagorean Triples Conjecture.

[BibT_eX]

[DOI]

Proceedings of the LPAR-21, 2017

How to Get More Out of Your Oracles.

[BibT_eX]

[DOI]

Kim S. Larsen

Proceedings of the Interactive Theorem Proving - 8th International Conference, 2017

Efficient Certified RAT Verification.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE 26, 2017

2016

Sorting nine inputs requires twenty-five comparisons.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

Integrity Constraints for General-Purpose Knowledge Bases.

[BibT_eX]

[DOI]

Isabel Nunes

Proceedings of the Foundations of Information and Knowledge Systems, 2016

Active Integrity Constraints for Multi-context Systems.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Engineering and Knowledge Management, 2016

2015

repAIrC: A Tool for Ensuring Data Consistency by Means of Active Integrity Constraints.

[BibT_eX]

[DOI]

CoRR, 2015

When Six Gates are Not Enough.

[BibT_eX]

[DOI]

CoRR, 2015

Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computer Mathematics - International Conference, 2015

Applying Sorting Networks to Synthesize Optimized Sorting Libraries.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2015

Sorting Networks: The End Game.

[BibT_eX]

[DOI]

Michael Codish

Proceedings of the Language and Automata Theory and Applications, 2015

Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker.

[BibT_eX]

[DOI]

Proceedings of the Interactive Theorem Proving - 6th International Conference, 2015

Active Integrity Constraints: From Theory to Implementation.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Discovery, Knowledge Engineering and Knowledge Management, 2015

repAIrC: A Tool for Ensuring Data Consistency.

[BibT_eX]

[DOI]

Proceedings of the KMIS 2015, 2015

2014

The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes.

[BibT_eX]

[DOI]

Michael Codish

Felix Palludan Hargreaves

Proceedings of the 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2014

Twenty-Five Comparators Is Optimal When Sorting Nine Inputs (and Twenty-Nine for Ten).

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence, 2014

Group communication patterns for high performance computing in scala.

[BibT_eX]

[DOI]

Daniel Merkle

Proceedings of the 3rd ACM SIGPLAN workshop on Functional high-performance computing, 2014

Proving Termination and Memory Safety for Programs with Pointer Arithmetic.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

Proving Termination of Programs Automatically with AProVE.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2012

SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs.

[BibT_eX]

[DOI]

J. Autom. Reason., 2012

Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2012

2011

Polytool: Polynomial interpretations as a basis for termination analysis of logic programs.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2011

Automated termination proofs for haskell by term rewriting.

[BibT_eX]

[DOI]

Matthias Raffelsieper

Stephan Swiderski

ACM Trans. Program. Lang. Syst., 2011

Proving Termination by Dependency Pairs and Inductive Theorem Proving.

[BibT_eX]

[DOI]

J. Autom. Reason., 2011

Optimal Base Encodings for Pseudo-Boolean Constraints.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2011

A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2011

2010

Automated termination analysis for logic programs with cut.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2010

Static Termination Analysis for Prolog Using Term Rewriting and SAT Solving.

[BibT_eX]

[DOI]

Künstliche Intell., 2010

Loops under Strategies ... Continued

[BibT_eX]

[DOI]

Proceedings of the Proceedings International Workshop on Strategies in Rewriting, 2010

Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT.

[BibT_eX]

[DOI]

Carsten Fuhs

Proceedings of the Theory and Applications of Satisfiability Testing, 2010

Optimizing the AES S-Box using SAT.

[BibT_eX]

Carsten Fuhs

Proceedings of the 8th International Workshop on the Implementation of Logics, 2010

Lazy Abstraction for Size-Change Termination.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Dependency Triples for Improving Termination Analysis of Logic Programs with Cut.

[BibT_eX]

[DOI]

Thomas Ströder

Proceedings of the Logic-Based Program Synthesis and Transformation, 2010

2009

Automated termination proofs for logic programs by term rewriting.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2009

Proving Termination of Integer Term Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

The Dependency Triple Framework for Termination of Logic Programs.

[BibT_eX]

[DOI]

Manh Thang Nguyen

Proceedings of the Logic-Based Program Synthesis and Transformation, 2009

Inductive Theorem Proving meets Dependency Pairs.

[BibT_eX]

[DOI]

Proceedings of the Interaction versus Automation: The two Faces of Deduction, 04.10., 2009

Termination of Integer Term Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Interaction versus Automation: The two Faces of Deduction, 04.10., 2009

Termination Analysis by Dependency Pairs and Inductive Theorem Proving.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 2009

2008

Static termination analysis for prolog using term rewriting and SAT solving.

[BibT_eX]

[DOI]

PhD thesis, 2008

Adding constants to string rewriting.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2008

Deciding Innermost Loops.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Maximal Termination.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

Improving Context-Sensitive Dependency Pairs.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2008

Search Techniques for Rational Polynomial Orders.

[BibT_eX]

[DOI]

Carsten Fuhs

Rafael Navarro-Marset

Proceedings of the Intelligent Computer Mathematics, 9th International Conference, 2008

2007

SAT Solving for Termination Analysis with Polynomial Interpretations.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

Termination Analysis of Logic Programs Based on Dependency Graphs.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2007

Proving Termination Using Recursive Path Orders and SAT Solving.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems, 6th International Symposium, 2007

Decision Procedures for Loop Detection.

[BibT_eX]

[DOI]

Proceedings of the Deduction and Decision Procedures, 30.09. - 05.10.2007, 2007

Implementing RPO and POLO using SAT.

[BibT_eX]

[DOI]

Proceedings of the Deduction and Decision Procedures, 30.09. - 05.10.2007, 2007

Termination of Programs using Term Rewriting and SAT Solving.

[BibT_eX]

[DOI]

Proceedings of the Deduction and Decision Procedures, 30.09. - 05.10.2007, 2007

Proving Termination by Bounded Increase.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 2007

2006

Mechanizing and Improving Dependency Pairs.

[BibT_eX]

[DOI]

J. Autom. Reason., 2006

Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

SAT Solving for Argument Filterings.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2006

Automated Termination Analysis for Logic Programs by Term Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2006

Automatic Termination Proofs in the Dependency Pair Framework.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning, Third International Joint Conference, 2006

2005

Proving and Disproving Termination of Higher-Order Functions.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems, 5th International Workshop, 2005

Proving and Disproving Termination in the Dependency Pair Framework.

[BibT_eX]

[DOI]

Proceedings of the Deduction and Applications, 23.-28. October 2005, 2005

2004

Automated Termination Proofs with AProVE.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 15th International Conference, 2004

The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming, 2004

Improved Modular Termination Proofs Using Dependency Pairs.

[BibT_eX]

[DOI]