From

Institution

Field

Type

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

Reset

Papers matching “restricted randomization” 12

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Randomization in Non-Uniform Finite Automata
2020 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science semigroups and automata theory Open access

Pavol Ďuriš, Rastislav Kráľovič, Richard Královič, Dana Pardubská, Martin Pašen, Peter Rossmanith

1

citations
Quantum Boltzmann Machines: Applications in Quantitative Finance
2023 RePEc: Research Papers in Economics preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Cameron Perot

0

citations
Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions
2020 IEEE Transactions on Automatic Control article Computer Science Formal Methods in Verification Open access

Leonore Winterer, Sebastian Junges, Ralf Wimmer, Nils Jansen, Ufuk Topcu, Joost-Pieter Katoen, +1 more

13

citations
Deductive reasoning about concurrent probabilistic programs
2025 RWTH Publications (RWTH Aachen) dissertation Computer Science Logic, programming, and type systems Open access

Ira Fesefeldt

0

citations
Stochastic games with lexicographic objectives
2023 Formal Methods in System Design article Computer Science Formal Methods in Verification Open access

Krishnendu Chatterjee, Joost-Pieter Katoen, Stefanie Mohr, Maximilian Weininger, Tobias Winkler

5

citations
Nicht-parametrische Schätzung von Kundensegmenten mit Paneldaten
2021 RWTH Publications (RWTH Aachen) dissertation Computer Science Bayesian Methods and Mixture Models Open access

Johannes Ferdinand Jörg

1

citations
High Dimensional Quantum Machine Learning With Small Quantum Computers
2023 Quantum article Computer Science Quantum Computing Algorithms and Architecture Open access

Simon C. Marshall, Casper Gyurik, Vedran Dunjko

36

citations
Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP
2023 Warwick Research Archive Portal (University of Warwick) article Computer Science Complexity and Algorithms in Graphs Open access

Matthias Englert, Heiko Röglin, Berthold Vöcking

33

citations
An Investigation of the Recoverable Robust Assignment Problem
2020 RWTH Publications (RWTH Aachen) conference-paper Computer Science Complexity and Algorithms in Graphs Open access

Dennis Fischer, Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger

6

citations
Results from a survey of major biological databases on the availability of metadata fields relevant to Digital Sequence Information (DSI)
2026 Zenodo (CERN European Organization for Nuclear Research) dataset Computer Science Research Data Management Practices Open access

Débora Silva Raposo, Davide Faggionato, Barbara Ebert, Pablo Orozco, Guy Cochrane, Yīmíng Bào, +20 more

0

citations
Results from a survey of major biological databases on the availability of metadata fields relevant to Digital Sequence Information (DSI)
2026 Zenodo (CERN European Organization for Nuclear Research) dataset Computer Science Research Data Management Practices Open access

Débora Silva Raposo, Davide Faggionato, Barbara Ebert, Pablo Orozco, Guy Cochrane, Yīmíng Bào, +20 more

0

citations
Quantum Log-Determinant Methods for Torsion-Sensitive Topological Data Analysis
2026 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Dimitrios Thanos, Caesnan M. G. Leditto, Adam Wesołowski, Andreea-Iulia Lefterovici, Mahtab Yaghubi Rad

0

citations

12 results