From

Institution

Field

Type

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

Reset

Papers matching “runtime bounds” 50

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
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
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
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
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
Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Nils Lommen, Jürgen Giesl

7

citations
Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Nils Lommen, Jürgen Giesl

1

citations
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
On solving classes of positive-definite quantum linear systems with quadratically improved runtime in the condition number
2021 Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

Davide Orsucci, Vedran Dunjko

16

citations
Lower bounds for adiabatic quantum algorithms by quantum speed limits
2023 Physical Review Research article Computer Science Quantum Computing Algorithms and Architecture Open access

Jyong-Hao Chen

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
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
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
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
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
2021 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Fabian Meyer, Marcel Hark, Jürgen Giesl

20

citations
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
2021 other Computer Science Logic, programming, and type systems

Marcel Hark, Jürgen Giesl, Fabian Meyer

2

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 Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
2020 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Marcel Hark, Jürgen Giesl

0

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
A calculus for modular loop acceleration and non-termination proofs
2022 International Journal on Software Tools for Technology Transfer article Computer Science Logic, programming, and type systems Open access

Florian Frohn, Carsten Fuhs

8

citations