Martin Ritzert

University of Göttingen — Germany

Computer Science · Physical Sciences

8h-index287citations28works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Machine Learning and Algorithms(8), Advanced Graph Neural Networks(6), semigroups and automata theory(5), Computability, Logic, AI Algorithms(5), Machine Learning and Data Classification(4)

Publications28 total

A large dataset of labelled single tree point clouds, QSMs and tree graphs
Scientific Data·2025Open Access
Hierarchical clustering with maximum density paths and mixture models
arXiv (Cornell University)·2025Open Access
Internal Evaluation of Density-Based Clusterings with Noise
ArXiv.org·2025Open Access
MNIST-Nd: a set of naturalistic datasets to benchmark clustering across dimensions
arXiv (Cornell University)·2024Open Access
Distinguished In Uniform: Self Attention Vs. Virtual Nodes
arXiv (Cornell University)·2024Open Access
Boosting, Voting Classifiers and Randomized Sample Compression Schemes
arXiv (Cornell University)·2024Open Access
AdaBoost is not an Optimal Weak to Strong Learner
arXiv (Cornell University)·2023· 1 citedOpen Access
Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark
arXiv (Cornell University)·2023· 1 citedOpen Access
Graph machine learning for design of high‐octane fuels
AIChE Journal·2022· 30 citedOpen Access
On the Parameterized Complexity of Learning First-Order Logic
2022· 3 cited
Optimal Weak to Strong Learning
arXiv (Cornell University)·2022· 4 citedOpen Access
Graph Machine Learning for Design of High-Octane Fuels
arXiv (Cornell University)·2022Open Access
Graph Neural Networks for Maximum Constraint Satisfaction
Frontiers in Artificial Intelligence·2021· 30 citedOpen Access
On the Parameterized Complexity of Learning First-Order Logic
arXiv (Cornell University)·2021Open Access
On the Parameterized Complexity of Learning Logic.
arXiv (Cornell University)·2021· 1 citedOpen Access
Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing
arXiv (Cornell University)·2021· 1 citedOpen Access
Graph Learning with 1D Convolutions on Random Walks.
arXiv (Cornell University)·2021· 5 citedOpen Access
The Effects of Randomness on the Stability of Node Embeddings
Communications in computer and information science·2021· 14 citedOpen Access
The Effects of Randomness on the Stability of Node Embeddings
arXiv (Cornell University)·2020· 2 citedOpen Access
RUN-CSP: Unsupervised Learning of Message Passing Networks for Binary Constraint Satisfaction Problems
arXiv (Cornell University)·2019· 13 citedOpen Access
page 1 of 2Next →

Frequent Co-authors

Martin Grohe(20), Hinrikus Wolf(7), Jan Tönshoff(4), Jan Toenshoff(3), Kasper Green Larsen(3), Steffen van Bergerem(3), Jan G. Rittig(2), Artur M. Schweidtmann(2), Stefanie Winkler(2), Jana M. Weber(2), Philipp Morsch(2), Alexander Mitsos(2), Manuel Dahmen(2), Tobias Schumacher(2), Florian Lemmerich(2), Markus Strohmaier(2), Christof Löding(2), Eran Rosenbluth(2), Polina Turishcheva(2), Laura Hansel(2)