From

Institution

Field

Type

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

Reset

Papers matching “runtime complexity” 71

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
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
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
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
From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
2024 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

1

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
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
Complexity profiles: A large-scale review of energy system models in terms of complexity
2020 Energy Strategy Reviews article Engineering Integrated Energy Systems Optimization Open access

Elias Ridha, Lars Nolting, Aaron Praktiknjo

75

citations
A model-based reference architecture for complex assistive systems and its application
2024 Software & Systems Modeling article Computer Science Advanced Software Engineering Methodologies Open access

Judith Michael

6

citations
Fine-grained Complexity Analysis of Two Classic TSP Variants
2020 ACM Transactions on Algorithms article Computer Science Complexity and Algorithms in Graphs Open access

Mark de Berg, Kevin Buchin, Bart M. P. Jansen, Gerhard J. Woeginger

17

citations
The potential of deep learning to reduce complexity in energy system modeling
2021 International Journal of Energy Research article Engineering Integrated Energy Systems Optimization Open access

Clara Sophie Köhnen, Jan Priesmann, Lars Nolting, Leander Kotzur, Martin Robinius, Aaron Praktiknjo

15

citations
Uplifting the complexity of analysis for probabilistic security of electricity supply assessments using artificial neural networks
2024 Energy and AI article Engineering Integrated Energy Systems Optimization Open access

Justin Münch, Jan Priesmann, Marius Reich, Marius Tillmanns, Aaron Praktiknjo, Mario Adam

4

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
Reducing integration complexity of learning analytics in eXtended reality through a modular and standards-based pipeline : design and evaluation of the OmiLAXR framework
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Online Learning and Analytics Open access

Sergej Görzen

0

citations
CompDSE: A Methodology for Design Space Exploration of Computing Subsystems Within Complex Cyber‐Physical Systems
2025 IET Cyber-Physical Systems Theory & Applications article Computer Science Embedded Systems Design Techniques Open access

Faezeh Sadat Saadatmand, Todor P. Stefanov, Ignacio González Alonso, Andy D. Pimentel, Benny Åkesson

0

citations
Methoden für die automatische Komplexitäts- und Terminierungsanalyse von (probabilistischen) Programmen und ihre Vollständigkeit
2021 RWTH Publications (RWTH Aachen) dissertation Computer Science Logic, programming, and type systems Open access

Marcel Hark

1

citations
Polynomial Loops: Beyond Termination
2020 EPiC series in computing conference-paper Computer Science Logic, programming, and type systems Open access

Marcel Hark, Florian Frohn, Jürgen Giesl

13

citations
On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem
2023 arXiv (Cornell University) preprint Computer Science Advanced Multi-Objective Optimization Algorithms Open access

Jakob Bossek, Christian Grimme

0

citations
Object-Centric Alignments
2023 arXiv (Cornell University) preprint Business, Management and Accounting Business Process Modeling and Analysis Open access

Lukas Liß, Jan Niklas Adams, Wil M. P. van der Aalst

1

citations
Double-loop importance sampling for McKean–Vlasov stochastic differential equation
2024 Statistics and Computing article Economics, Econometrics and Finance Stochastic processes and financial applications Open access

Nadhir Ben Rached, Abdul-Lateef Haji-Ali, Shyam Mohan Subbiah Pillai, Raul F. Tempone

9

citations