From

Institution

Field

Type

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

Reset

Papers matching “runtime bounds” 11

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
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
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
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
A Calculus for Modular Loop Acceleration and Non-Termination Proofs
2021 BIROn (Birkbeck, University of London) article Computer Science Logic, programming, and type systems Open access

Florian Frohn, Carsten Fuhs

0

citations
A Calculus for Amortized Expected Runtimes
2023 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access

Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Lena Verscht

22

citations
Accelerated bounded model checking with LoAT
2026 Science of Computer Programming article Computer Science Formal Methods in Verification Open access

Florian Frohn, Jürgen Giesl

0

citations
Multi-cost Bounded Tradeoff Analysis in MDP
2020 Journal of Automated Reasoning article Computer Science Formal Methods in Verification Open access

Arnd Hartmanns, Sebastian Junges, Joost-Pieter Katoen, Tim Quatmann

22

citations
A Syscall-Level Binary-Compatible Unikernel
2021 IEEE Transactions on Computers article Computer Science Security and Verification in Computing

Pierre Olivier, Hugo Lefeuvre, Daniel Chiba, Stefan Lankes, Changwoo Min, Binoy Ravindran

7

citations
Trade-offs between classical and quantum space using spooky pebbling
2025 Logical Methods in Computer Science article Computer Science Quantum Computing Algorithms and Architecture Open access

Arend-Jan Quist, Alfons Laarman

1

citations

11 results