default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKathrin Skubch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Petru Tighineanu, Lukas Grossberger, Paul Baireuther, Kathrin Skubch, Stefan Falkner, Julia Vinogradska, Felix Berkenkamp:
Scalable Meta-Learning with Gaussian Processes. AISTATS 2024: 1981-1989- 2023
- [i6]Petru Tighineanu, Lukas Grossberger, Paul Baireuther, Kathrin Skubch, Stefan Falkner, Julia Vinogradska, Felix Berkenkamp:
Scalable Meta-Learning with Gaussian Processes. CoRR abs/2312.00742 (2023) - 2022
- [c5]Petru Tighineanu, Kathrin Skubch, Paul Baireuther, Attila Reiss, Felix Berkenkamp, Julia Vinogradska:
Transfer Learning with Gaussian Processes for Bayesian Optimization. AISTATS 2022: 6152-6181 - [c4]Amrutha Saseendran, Kathrin Skubch, Stefan Falkner, Margret Keuper:
Trading off Image Quality for Robustness is not Necessary with Regularized Deterministic Autoencoders. NeurIPS 2022 - 2021
- [c3]Amrutha Saseendran, Kathrin Skubch, Margret Keuper:
Multi-Class Multi-Instance Count Conditioned Adversarial Image Generation. ICCV 2021: 6742-6751 - [c2]Amrutha Saseendran, Kathrin Skubch, Stefan Falkner, Margret Keuper:
Shape your Space: A Gaussian Mixture Regularization Approach to Deterministic Autoencoders. NeurIPS 2021: 7319-7332 - [i5]Amrutha Saseendran, Kathrin Skubch, Margret Keuper:
Multi-Class Multi-Instance Count Conditioned Adversarial Image Generation. CoRR abs/2103.16795 (2021) - [i4]Petru Tighineanu, Kathrin Skubch, Paul Baireuther, Attila Reiss, Felix Berkenkamp, Julia Vinogradska:
Transfer Learning with Gaussian Processes for Bayesian Optimization. CoRR abs/2111.11223 (2021)
2010 – 2019
- 2019
- [j5]Amin Coja-Oghlan, Oliver Cooley
, Mihyun Kang, Kathrin Skubch:
Core forging and local limit theorems for the k-core of random graphs. J. Comb. Theory B 137: 178-231 (2019) - 2018
- [b1]Kathrin Skubch:
Message passing algorithms for investigating invariants of sparse random graphs. Goethe University Frankfurt, Frankfurt am Main, Germany, 2018 - 2017
- [j4]Amin Coja-Oghlan, Will Perkins, Kathrin Skubch:
Limits of discrete distributions and Gibbs measures on random graphs. Eur. J. Comb. 66: 37-59 (2017) - [j3]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
How does the core sit inside the mantle? Random Struct. Algorithms 51(3): 459-482 (2017) - [j2]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
The Minimum Bisection in the Planted Bisection Model. Theory Comput. 13(1): 1-22 (2017) - [i3]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
Core forging and local limit theorems for the k-core of random graphs. CoRR abs/1707.03556 (2017) - 2015
- [j1]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
How does the core sit inside the mantle? Electron. Notes Discret. Math. 49: 489-496 (2015) - [c1]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
The Minimum Bisection in the Planted Bisection Model. APPROX-RANDOM 2015: 710-725 - [i2]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
How does the core sit inside the mantle? CoRR abs/1503.09030 (2015) - [i1]Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch:
The minimum bisection in the planted bisection model. CoRR abs/1505.02985 (2015)
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 2024-06-10 20:26 CEST 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:
