From

Institution

Field

Type

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

Reset

Papers matching “runtime bounds” 16

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

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
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
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 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
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
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
Quantitative Monitoring of Signal First-Order Logic
2026 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Marek Chalupa, Thomas A. Henzinger, N. Ege Saraç, Emily Yu

0

citations
Quantitative Monitoring of Signal First-Order Logic
2026 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Marek Chalupa, Thomas A. Henzinger, N. Ege Saraç, Emily Yu

0

citations
Efficiently Approximating Attention Is Hard
2026 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Lukas Haverbeck, Carmen Amo Alonso, Andrés Felipe Posada-Moreno, Sebastian Trimpe, Marco Pavone

0

citations
Rapid Mixing of Quantum Gibbs Samplers for Weakly-Interacting Quantum Systems
2025 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Štěpán Šmíd, Mario Berta, Roberto Bondesan

1

citations

16 results