default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKaren Seidel 0001
Person information
- affiliation: Hasso Plattner Institute, University of Potsdam, Germany
Other persons with the same name
- Karen Seidel 0002 — Oxford University, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2022
[b1]Karen Seidel:
Modelling binary classification with computability theory (Binäre Klassifikation modellieren mit Berechenbarkeitstheorie). University of Potsdam, Germany, 2022
Journal Articles
- 2021
- [j2]Andreas Göbel, J. A. Gregor Lagodzinski
, Karen Seidel:
Counting Homomorphisms to Trees Modulo a Prime. ACM Trans. Comput. Theory 13(3): 19:1-19:33 (2021) - 2013
- [j1]Peter Koepke, Karen Räsch, Philipp Schlicht:
A minimal Prikry-type forcing for singularizing a measurable cardinal. J. Symb. Log. 78(1): 85-100 (2013)
Conference and Workshop Papers
- 2022
- [c7]Maximilian Böther, Otto Kißig, Martin Taraz, Sarel Cohen, Karen Seidel, Tobias Friedrich:
What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization. ICLR 2022 - 2021
- [c6]Ardalan Khazraei, Timo Kötzing, Karen Seidel:
Towards a Map for Incremental Learning in the Limit from Positive and Negative Information. CiE 2021: 273-284 - [c5]Timo Kötzing, Karen Seidel:
Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes. CiE 2021: 318-329 - 2019
- [c4]Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Alexander G. Melnikov, Karen Seidel, Frank Stephan:
Random Subgroups of Rationals. MFCS 2019: 25:1-25:14 - 2018
- [c3]Andreas Göbel, J. A. Gregor Lagodzinski, Karen Seidel:
Counting Homomorphisms to Trees Modulo a Prime. MFCS 2018: 49:1-49:13 - 2017
- [c2]Rupert Hölzl, Sanjay Jain, Philipp Schlicht, Karen Seidel, Frank Stephan:
Automatic Learning from Repetitive Texts. ALT 2017: 129-150 - [c1]Timo Kötzing, Martin Schirneck, Karen Seidel:
Normal Forms in Semantic Language Identification. ALT 2017: 493-516
Informal and Other Publications
- 2022
- [i6]Maximilian Böther, Otto Kißig, Martin Taraz, Sarel Cohen, Karen Seidel, Tobias Friedrich:
What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization. CoRR abs/2201.10494 (2022) - 2020
- [i5]Ardalan Khazraei, Timo Kötzing, Karen Seidel:
Learning Half-Spaces and other Concept Classes in the Limit with Iterative Learners. CoRR abs/2010.03227 (2020) - [i4]Timo Kötzing, Karen Seidel:
Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes. CoRR abs/2010.04782 (2020) - 2019
- [i3]Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Alexander G. Melnikov, Karen Seidel, Frank Stephan:
Random Subgroups of Rationals. CoRR abs/1901.04743 (2019) - 2018
- [i2]Martin Aschenbach, Timo Kötzing, Karen Seidel:
Learning Families of Formal Languages from Positive and Negative Information. CoRR abs/1801.10502 (2018) - [i1]Andreas Göbel, J. A. Gregor Lagodzinski, Karen Seidel:
Counting Homomorphisms to Trees Modulo a Prime. CoRR abs/1802.06103 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
