From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “runtime analysis” 107

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Quantum Weakest Preconditions Revisited: Pre-expectations for Expected Runtime Analysis
2026 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Christina Gehnen, Dominique Unruh, Joost-Pieter Katoen

0

citations
Runtime Analysis of Quality Diversity Algorithms
2023 Proceedings of the Genetic and Evolutionary Computation Conference conference-paper Computer Science Metaheuristic Optimization Algorithms Research Open access

Jakob Bossek, Dirk Sudholt

4

citations
Runtime Analysis of Cartesian Genetic Programming in Evolving Boolean Functions
2026 Lecture notes in computer science conference-paper Computer Science Evolutionary Algorithms and Applications Open access

Duc-Cuong Dang, Roman Kalkreuth, Andre Opris

0

citations
MYX: Runtime Correctness Analysis for Multi-Level Parallel Programming Paradigms
2020 Lecture notes in computational science and engineering book-chapter Computer Science Parallel Computing and Optimization Techniques Open access

Joachim Protze, Miwako Tsuji, Christian Terboven, Thomas Dufaud, Hitoshi Murai, Serge G. Petiton, +3 more

1

citations
Automated Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops (Short WST Version)
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Nils Lommen, Jürgen Giesl

0

citations
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Nils Lommen, Fabian Meyer, Jürgen Giesl

7

citations
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
2022 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Nils Lommen, Jürgen Giesl

1

citations
Targeting Completeness: Automated Complexity Analysis of Integer Programs
2026 Journal of Automated Reasoning article Computer Science Software Engineering Research Open access

Nils Lommen, Éléanore Meyer, Jürgen Giesl

4

citations
Improving Automatic Complexity Analysis of Integer Programs
2022 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Jürgen Giesl, Nils Lommen, Marcel Hark

0

citations
Inferring Lower Runtime Bounds for Integer Programs
2020 ACM Transactions on Programming Languages and Systems article Computer Science Formal Methods in Verification Open access

Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl

12

citations
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
2026 Lecture notes in computer science conference-paper Open access

Nils Lommen, Fabian Meyer, Jürgen Giesl

0

citations
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
2026 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Nils Lommen, Éléanore Meyer, Jürgen Giesl

0

citations
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
2026 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Nils Lommen, Éléanore Meyer, Jürgen Giesl

0

citations
RMASanitizer: Generalized Runtime Detection of Data Races in Remote Memory Access Applications
2024 conference-paper Computer Science Parallel Computing and Optimization Techniques Open access

Simon Schwitanski, Yussur Mustafa Oraji, Cornelius Pätzold, Joachim Jenke, Felix Tomski

4

citations
Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
2025 International Symposium on Principles and Practice of Declarative Programming (PPDP) conference-paper Computer Science Logic, programming, and type systems Open access

1

citations
Debona: Decoupled Boundary Network Analysis for Tighter Bounds and Faster Adversarial Robustness Proofs
2020 arXiv (Cornell University) preprint Computer Science Adversarial Robustness in Machine Learning Open access

Christopher Brix, Thomas Noll

3

citations
On Modeling Depths of Power Electronic Circuits for Real-Time Simulation – A Comparative Analysis for Power Systems
2022 IEEE Open Access Journal of Power and Energy article Engineering Real-time simulation and control systems Open access

Giovanni De Carne, Georg F. Lauss, Mazheruddin Hussain Syed, Antonello Monti, Andrea Benigni, Shahab Karrari, +2 more

42

citations
Usecase analysis and hyperparameter optimization for targetDART applications
2025 RWTH Publications (RWTH Aachen) dissertation Computer Science Distributed systems and fault tolerance Open access

0

citations
Improving Automatic Complexity Analysis of Integer Programs
2022 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification

Jürgen Giesl, Nils Lommen, Marcel Hark, Fabian Meyer

10

citations
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
2022 Lecture notes in computer science conference-paper Computer Science Parallel Computing and Optimization Techniques Open access

Florian Frohn, Jürgen Giesl

16

citations
In-depth analysis of granular local search for capacitated vehicle routing
2023 Discrete Applied Mathematics article Engineering Vehicle Routing Optimization Methods

Christian Becker, Jean Bertrand Gauthier, Timo Gschwind, Michael Schneider

11

citations
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
2022 arXiv (Cornell University) preprint Computer Science Parallel Computing and Optimization Techniques Open access

Florian Frohn, Jürgen Giesl

0

citations
A runtime-optimized simulation tool for determining the interaction of catenary and pantographs
2025 RWTH Publications (RWTH Aachen) article Engineering Electrical Contact Performance and Analysis Open access

0

citations
UNICADO: multidisciplinary analysis in conceptual aircraft design
2022 CEAS Aeronautical Journal article Decision Sciences Probabilistic and Robust Engineering Design Open access

Maurice Zimmnau, Florian Schültke, Eike Stumpf

8

citations
Integrating KoAT’s push-button probabilistic cost analysis into Caesar
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Formal Methods in Verification Open access

Mats Eblenkamp

0

citations