From

Institution

Field

Type

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

Reset

Papers matching “runtime analysis” 72

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 Logic, programming, and type systems Open access

Christina Gehnen, Dominique Unruh, Joost-Pieter Katoen

0

citations
Runtime Analysis of Quality Diversity Algorithms
2023 Genetic and Evolutionary Computation Conference (GECCO) conference-paper Computer Science Evolutionary Algorithms and Applications 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 Logic, programming, and type systems 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 Logic, programming, and type systems 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 Logic, programming, and type systems 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 Computer Science Logic, programming, and type systems 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 Logic, programming, and type systems 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 Logic, programming, and type systems 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 Proceedings of the International Conference on Parallel Processing 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
Usecase analysis and hyperparameter optimization for targetDART applications
2025 RWTH Publications (RWTH Aachen) dissertation Computer Science Parallel Computing and Optimization Techniques Open access

0

citations
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Florian Frohn, Jürgen Giesl

16

citations
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
2022 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Florian Frohn, Jürgen Giesl

0

citations
Integrating KoAT’s push-button probabilistic cost analysis into Caesar
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Logic, programming, and type systems Open access

Mats Eblenkamp

0

citations
Dynamic Symbolic Execution for Semantic Difference Analysis of Component and Connector Architectures
2025 arXiv (Cornell University) preprint Computer Science Software Testing and Debugging Techniques Open access

Johanna Grahl, Bernhard Rumpe⋆, Max Stachon, Sebastian Stüber

0

citations
An Event Model for Trace-Based Performance Analysis of MPI Partitioned Point-to-Point Communication
2023 conference-paper Computer Science Parallel Computing and Optimization Techniques Open access

Isabel Thärigen, Marc-André Hermanns, Markus Geimer

1

citations
On Deciding Constant Runtime of Linear Loops
2026 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Florian Frohn, Jürgen Giesl, Peter Giesl, Nils Lommen

0

citations
On Deciding Constant Runtime of Linear Loops
2026 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Florian Frohn, Jürgen Giesl, Peter Giesl, Nils Lommen

0

citations
Tool Support for Co-Simulation-Based Analysis
2020 Springer eBooks book-chapter Computer Science Modeling and Simulation Systems Open access

Karsten Albers, Benjamin Bolte, Max‐Arno Meyer, Axel Terfloth, Anna Wissdorf

3

citations