A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

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

Papers matching “approximate dynamic programming” 6

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Precedence constraints in combinatorial optimization
2026 RWTH Publications (RWTH Aachen) dissertation Computer Science Advanced Graph Theory Research Open access

Corinna Mathwieser

0

citations
Minimum color‐degree perfect b‐matchings
2020 Networks article Computer Science Complexity and Algorithms in Graphs Open access

Mariia Anapolska, Christina Büsing, Martin Comis, Tabea Krabs

1

citations
Which Algorithms Can Graph Neural Networks Learn?
2026 arXiv (Cornell University) preprint Computer Science Advanced Graph Neural Networks Open access

Solveig Wittig, Antonis Vasileiou, Robert R. Nerem, Timo Stoll, Floris Geerts, Yusu Wang, +1 more

0

citations
Towards compiler-aided correctness checking of adjoint MPI applications
2020 conference-paper Computer Science Software Testing and Debugging Techniques Open access

Alexander Hück, Joachim Protze, Jan-Patrick Lehr, Christian Terboven, Christian H Bischof, Matthias Müller

5

citations
Stochastic Gradient Descent with Momentum: Analysis and Synthesis via Integral Quadratic Constraints
2026 arXiv (Cornell University) preprint Computer Science Stochastic Gradient Optimization Techniques Open access

Dennis Gramlich, Carsten W. Scherer, Christian Ebenbauer

0

citations
Provably Bounding Neural Network Preimages
2023 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Suhas Kotha, Christopher Brix, J. Zico Kolter, Krishnamurthy

6

citations

6 results