From

Institution

Field

Type

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

Reset

Papers matching “complexity bounds” 111

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Advice Complexity bounds for Online Delayed F-Node-, H-Node- and H-Edge-Deletion Problems
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Optimization and Search Problems Open access

Niklas Berndt, Henri Lotze

1

citations
Advice Complexity Bounds for Online Delayed $$\mathcal{F}$$-Node-, H-Node- and H-Edge-Deletion Problems
2023 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems

Niklas Berndt, Henri Lotze

3

citations
A Generalization Bound for a Family of Implicit Networks
2024 arXiv (Cornell University) preprint Computer Science Neural Networks and Applications Open access

Samy Wu Fung, Benjamin Berkels

0

citations
A generalization bound for a family of implicit networks
2026 Neurocomputing article Computer Science Interconnection Networks and Systems Open access

Samy Wu Fung, Benjamin Berkels

0

citations
Factorised Representations of Join Queries: Tight Bounds and a New Dichotomy
2025 arXiv (Cornell University) preprint Computer Science Complexity and Algorithms in Graphs Open access

Christoph Berkholz, Harry Vinall-Smeeth

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
KoAT: Automatic Complexity and Termination Analysis of Integer Programs
2026 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification 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 Formal Methods in Verification Open access

Nils Lommen, Éléanore Meyer, Jürgen Giesl

0

citations
A Finite-Model-Theoretic View on Propositional Proof Complexity
2022 Logical Methods in Computer Science article Computer Science Complexity and Algorithms in Graphs Open access

Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa

5

citations
A Generalization Bound for a Family of Implicit Networks
2025 SSRN Electronic Journal preprint Computer Science Neural Networks and Applications Open access

Samy Wu Fung, Benjamin Berkels

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
On the advice complexity of the online dominating set problem
2021 Theoretical Computer Science article Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Juraj Hromkovic̆, Sacha Krug

3

citations
Targeting Completeness: Automated Complexity Analysis of Integer Programs
2026 Journal of Automated Reasoning article Computer Science Software Engineering Research Open access

Nils Lommen, Éléanore Meyer, Jürgen Giesl

4

citations
Lower Bounds on Learning Pauli Channels With Individual Measurements
2025 IEEE Transactions on Information Theory article Computer Science Quantum Computing Algorithms and Architecture Open access

Omar Fawzi, Aadil Oufkir, Daniel Stilck França

5

citations
Inferring Lower Runtime Bounds for Integer Programs
2020 ACM Transactions on Programming Languages and Systems article Computer Science Formal Methods in Verification Open access

Florian Frohn, Matthias Naaf, Marc Brockschmidt, Jürgen Giesl

12

citations
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
2023 conference-paper Computer Science Advanced Graph Theory Research

Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer

4

citations
The Complexity of Reachability in Parametric Markov Decision Processes
2020 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Sebastian Junges, Joost-Pieter Katoen, Guillermo A. Pérez, Tobias Winkler

10

citations
Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus
2022 arXiv (Cornell University) preprint Computer Science Logic, Reasoning, and Knowledge Open access

Benedikt Pago

0

citations
Improving Automatic Complexity Analysis of Integer Programs
2022 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Jürgen Giesl, Nils Lommen, Marcel Hark

0

citations
Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-Circuits
2023 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Benedikt Pago

1

citations
Lower Bounds for Conjunctive and Disjunctive Turing Kernels
2021 RWTH Publications (RWTH Aachen) conference-paper Computer Science Computability, Logic, AI Algorithms Open access

Elisabet Burjons, Peter Rossmanith

0

citations
The Advice Complexity of Delayed F-Node-Deletion Problems and of Disconnected Delayed H-Edge-Deletion Problems
2024 SSRN Electronic Journal preprint Computer Science Optimization and Search Problems Open access

Niklas Berndt, Henri Lotze

0

citations
The complexity of reachability in parametric Markov decision processes
2021 Journal of Computer and System Sciences article Computer Science Formal Methods in Verification Open access

Sebastian Junges, Joost-Pieter Katoen, Guillermo A. Pérez, Tobias Winkler

23

citations
Computational Complexity of the Weisfeiler-Leman Dimension
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Simon Raßmann, Pascal Schweitzer

1

citations