From

Institution

Field

Type

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

Reset

Papers matching “deterministic algorithms” 61

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm
2021 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science semigroups and automata theory Open access

León Bohn, Christof Löding

1

citations
Constructing deterministic $ω$-automata from examples by an extension of the RPNI algorithm
2021 arXiv (Cornell University) preprint Computer Science semigroups and automata theory Open access

León Bohn, Christof Löding

1

citations
Evaluating Massively Parallel Algorithms for DFA Minimisation, Equivalence Checking and Inclusion Checking
2025 arXiv (Cornell University) preprint Computer Science semigroups and automata theory Open access

Jan Heemstra, Jan Martens, Anton Wijs

0

citations
An Evaluation of Massively Parallel Algorithms for DFA Minimization
2024 Electronic Proceedings in Theoretical Computer Science article Computer Science semigroups and automata theory Open access

Jan Martens, Anton Wijs

0

citations
How fast can a parent estimate the value of their children? A quantum algorithm for stochastic games
2026 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Marien Raat, Merlin Incerti-Medici, James R. Wootton, Evert Van Nieuwenburg, Daniel Bultrini

0

citations
Minimal History-Deterministic Co-Büchi Automata: Congruences and Passive Learning
2025 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science semigroups and automata theory Open access

Christof Löding, Igor Walukiewicz

3

citations
Constructing Deterministic Parity Automata from Positive and Negative Examples
2024 TheoretiCS article Computer Science semigroups and automata theory Open access

León Bohn, Christof Löding

8

citations
Deterministic Fault-Tolerant State Preparation for Near-Term Quantum Error Correction: Automatic Synthesis Using Boolean Satisfiability
2025 conference-paper Computer Science Quantum Computing Algorithms and Architecture

L. Schmid, Tom Peham, Lucas Berent, Markus Müller, Robert Wille

0

citations
Experimental deterministic correction of qubit loss [1]
2021 Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC) conference-paper Computer Science Quantum Computing Algorithms and Architecture

Roman Stricker, Davide Vodola, Alexander Erhard, Lukas Postler, M. Meth, Martin Ringbauer, +4 more

3

citations
On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words
2023 Fundamenta Informaticae article Computer Science semigroups and automata theory

Christof Löding, Max Philip Stachon

0

citations
On Minimization and Learning of Deterministic $\omega$-Automata in the Presence of Don't Care Words
2023 Fundamenta Informaticae article Computer Science semigroups and automata theory Open access

Christof Löding, Max Philip Stachon

0

citations
Experimental deterministic correction of qubit loss
2020 Nature article Computer Science Quantum Computing Algorithms and Architecture Open access cited by 1 patent

M. Meth, Martin Ringbauer

62

citations
Experimental deterministic correction of qubit loss
2020 Zenodo (CERN European Organization for Nuclear Research) dataset Computer Science Quantum Computing Algorithms and Architecture Open access

Roman Stricker, Davide Vodola, Alexander Erhard, Lukas Postler, M. Meth, Martin Ringbauer, +4 more

0

citations
Experimental deterministic correction of qubit loss
2020 Zenodo (CERN European Organization for Nuclear Research) dataset Computer Science Quantum Computing Algorithms and Architecture Open access

Roman Stricker, Davide Vodola, Alexander Erhard, Lukas Postler, M. Meth, Martin Ringbauer, +4 more

0

citations
Removable Online Knapsack and Advice
2020 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Fabian Frei, Peter Rossmanith

1

citations
Stealing From the Dragon's Hoard: Online Unbounded Knapsack With Removal
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Optimization and Search Problems Open access

Matthias Gehnen, Kübra Güven, Moritz Stocker

0

citations
Improved Results for Knapsack with Removal
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Optimization and Search Problems Open access

Matthias Gehnen, Valentin Hächler, Dennis Komm, Richard Královič

0

citations
Online Simple Knapsack with Reservation Costs
2020 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

Hans-Joachim Boeckenhauer, Elisabet Burjons, Juraj Hromkovic̆, Henri Lotze, Peter Rossmanith

2

citations
Cow Path by Finite Agent: Time vs Pebbles
2026 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems

Stefan Dobrev, Rastislav Kráľovič, Richard Královič, Dana Pardubská, Peter Rossmanith

0

citations
Fast Equivalence Checking of Quantum Circuits of Clifford Gates
2023 Lecture notes in computer science conference-paper Computer Science Quantum Computing Algorithms and Architecture Open access

Dimitrios Thanos, Tim Coopmans, Alfons Laarman

11

citations
Interval-Constrained Bipartite Matching over Time
2025 Lecture notes in computer science conference-paper Computer Science Optimization and Search Problems

Andreas Abels, Mariia Anapolska, Christina Büsing

0

citations
Online Unbounded Knapsack
2025 Theory of Computing Systems article Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic̆, Ralf Klasing, Dennis Komm, Henri Lotze, +3 more

2

citations
Online Unbounded Knapsack
2024 arXiv (Cornell University) preprint Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Matthias Gehnen, Juraj Hromkovic̆, Ralf Klasing, Dennis Komm, Henri Lotze, +3 more

0

citations
Polynomial Time Quantum Approximation Schemes for Constrained Optimisation
2026 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Chinonso Onah, Kristel F. L. Michielsen

0

citations
Empirical Quantum Advantage in Constrained Optimization from Encoded Unitary Designs
2025 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

0

citations