Karen Seidel

According to our database, Karen Seidel authored at least 11 papers between 2013 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Modelling binary classification with computability theory (Binäre Klassifikation modellieren mit Berechenbarkeitstheorie)

Karen Seidel

PhD thesis, 2022

What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization.

Maximilian Böther, Otto Kißig, Martin Taraz, Sarel Cohen, Karen Seidel, Tobias Friedrich

Proceedings of the Tenth International Conference on Learning Representations, 2022

2021

Counting Homomorphisms to Trees Modulo a Prime.

Andreas Göbel, J. A. Gregor Lagodzinski, Karen Seidel

ACM Trans. Comput. Theory, 2021

Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes.

Timo Kötzing, Karen Seidel

Proceedings of the Connecting with Computability, 2021

Towards a Map for Incremental Learning in the Limit from Positive and Negative Information.

Ardalan Khazraei, Timo Kötzing, Karen Seidel

Proceedings of the Connecting with Computability, 2021

2020

Learning Half-Spaces and other Concept Classes in the Limit with Iterative Learners.

Ardalan Khazraei, Timo Kötzing, Karen Seidel

CoRR, 2020

2019

Random Subgroups of Rationals.

Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Alexander G. Melnikov, Karen Seidel, Frank Stephan

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

Learning Families of Formal Languages from Positive and Negative Information.

Martin Aschenbach, Timo Kötzing, Karen Seidel

CoRR, 2018

2017

Normal Forms in Semantic Language Identification.

Timo Kötzing, Martin Schirneck, Karen Seidel

Proceedings of the International Conference on Algorithmic Learning Theory, 2017

Automatic Learning from Repetitive Texts.

Rupert Hölzl, Sanjay Jain, Philipp Schlicht, Karen Seidel, Frank Stephan

Proceedings of the International Conference on Algorithmic Learning Theory, 2017

2013

A minimal Prikry-type forcing for singularizing a measurable cardinal.

Peter Koepke, Karen Räsch, Philipp Schlicht

J. Symb. Log., 2013