From

Institution

Field

Type

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

Reset

Papers matching “generalization bounds” 135

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Higher-order finite elements for embedded simulation
2020 ACM Transactions on Graphics article Computer Science Computer Graphics and Visualization Techniques

Andreas Longva, Fabian Löschner, Tassilo Kugelstadt, José Antonio Fernández-Fernández, Jan Bender

21

citations
Stochastic Games with Lexicographic Reachability-Safety Objectives
2020 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

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

20

citations
Scenario-Based Verification of Uncertain MDPs
2020 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Murat Cubuktepe, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen, Ufuk Topcu

20

citations
Under-Approximating Expected Total Rewards in POMDPs
2022 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Alexander Bork, Joost-Pieter Katoen, Tim Quatmann

10

citations
Optimized feature space learning for generating efficient binary codes for image retrieval
2021 Signal Processing Image Communication article Computer Science Advanced Image and Video Retrieval Techniques Open access

Abin Jose, Erik Stefan Ottlik, Christian Rohlfing, Jens-Rainer Ohm

8

citations
Exploring sparse graphs with advice
2022 Information and Computation article Computer Science Optimization and Search Problems Open access

Hans-Joachim Böckenhauer, Janosch Fuchs

7

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
Generalized concentratable entanglement via parallelized permutation tests
2025 Physical Review Research article Computer Science Quantum Information and Cryptography Open access

Johannes Knörzer, Zherui Jerry Wang, Jordi Tura

5

citations
Tuple-Independent Representations of Infinite Probabilistic Databases
2021 ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS) conference-paper Computer Science Advanced Database Systems and Queries Open access

Nofar Carmeli, Martin Grohe, Peter Lindner, Christoph Standke

4

citations
Accurate Score Prediction for Dual-Sieve Attacks
2025 Journal of Cryptology article Computer Science Cryptography and Data Security Open access

Léo Ducas, Ludo N. Pulles

2

citations
Blind Extraction of Equitable Partitions from Graph Signals
2022 IEEE International Conference on Acoustics Speech and Signal Processing conference-paper Computer Science Advanced Graph Neural Networks Open access

Michael Scholkemper, Michael Schaub

2

citations
Computing subset vertex covers in H-free graphs
2025 Theoretical Computer Science article Computer Science Advanced Graph Theory Research Open access

Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen

2

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
Tools and Algorithms for Sound Multi-Objective Probabilistic Model Checking
2026 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Arnd Hartmanns, Tim Quatmann, Mark van Wijk

1

citations
Dynamics of curved travelling fronts for the discrete Allen-Cahn equation on a two-dimensional lattice
2020 Discrete and Continuous Dynamical Systems article Computer Science Nonlinear Dynamics and Pattern Formation Open access

Mia Jukić, Hermen Jan Hupkes

1

citations
Under-Approximating Expected Total Rewards in POMDPs
2022 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Alexander Bork, Joost-Pieter Katoen, Tim Quatmann

1

citations
A Hyperlogic for Strategies in Stochastic Games (Extended Version)
2025 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

0

citations
The Parameterized Complexity of Learning Monadic Second-Order Logic
2025 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Steffen van Bergerem

0

citations
Root-to-Leaf Path Random Walks, Normalized Hodge Laplacians, and Cheeger Inequalities on Simplicial Complexes
2026 arXiv (Cornell University) preprint Computer Science Topological and Geometric Data Analysis Open access

Francesco Viganò, Tolga Birdal, Michael T. Schaub, Mauricio Barahona

0

citations
Unitary fault-tolerant encoding of Pauli states in surface codes
2026 npj Quantum Information article Computer Science Quantum Computing Algorithms and Architecture Open access

Luis Colmenárez, Remmy A. M. Zen, Jan Ollé, Florian Marquardt, Markus Michael Müller

0

citations
Fast and Flexible Spiking Network Simulations on Massively Distributed On-Chip Memory Accelerators
2026 arXiv (Cornell University) preprint Computer Science Parallel Computing and Optimization Techniques Open access

Catherine Mia Schöfmann, Jan Finkbeiner, Jan Vogelsang, Susanne Kunkel

0

citations
A decomposition-compatible canonization framework for the graph isomorphism problem
2021 RWTH Publications (RWTH Aachen) dissertation Computer Science Graph Theory and Algorithms Open access

Daniel Wiebking

0

citations
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Jan Dreier, Daniel Mock, Peter Rossmanith

0

citations
Computing Subset Vertex Covers in $H$-Free Graphs
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma

0

citations
The Parameterized Complexity of Learning Monadic Second-Order Logic
2023 HAL (Le Centre pour la Communication Scientifique Directe) conference-paper Computer Science Advanced Graph Theory Research Open access

Steffen van Bergerem, Martin Grohe, Nina Runde

0

citations