default search action
Christoph Koch 0006
Person information
- affiliation: Graz University of Technology, Austria
Other persons with the same name
- Christoph Koch 0001
(aka: Christoph E. Koch) — EPFL DATA Laboratory, Switzerland
- Christoph Koch 0002 — Erziehungswissenschaftliche Hochschule Rheinland-Pfalz, Germany
- Christoph Koch 0003 — Universität Lübeck, Germany
- Christoph Koch 0004 — Universität Passau, Germany
- Christoph Koch 0005 — Friedrich-Schiller-Universität Jena (and 1 more)
- Christoph Koch 0007 — Hamburg University of Technology, Germany
- Christoph Koch 0008 — University of Warwick, Mathematics Institute, Coventry, UK
- Christoph Koch 0009 — University Hospital Eppendorf, Germany
- Christoph Koch 0010
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j8]Anna Saranti
Actionable Explainable AI (AxAI): A Practical Example with Aggregation Functions for Adaptive Classification and Textual Explanations for Interpretable Machine Learning. Mach. Learn. Knowl. Extr. 4(4): 924-953 (2022)
2010 – 2019
- 2019
- [j7]Oliver Cooley, Mihyun Kang, Christoph Koch:
The Size of the Giant Component in Random Hypergraphs: a Short Proof. Electron. J. Comb. 26(3): 3 (2019) - 2018
- [j6]Oliver Cooley
The size of the giant high-order component in random hypergraphs. Random Struct. Algorithms 53(2): 238-288 (2018) - 2017
- [j5]Béla Bollobás, Oliver Cooley
Jigsaw percolation on random hypergraphs. J. Appl. Probab. 54(4): 1261-1277 (2017) - 2016
- [j4]Oliver Cooley
Threshold and Hitting Time for High-Order Connectedness in Random Hypergraphs. Electron. J. Comb. 23(2): 2 (2016) - [c1]Christoph Koch, Johannes Lengler
Bootstrap Percolation on Geometric Inhomogeneous Random Graphs. ICALP 2016: 147:1-147:15 - [i1]Christoph Koch, Johannes Lengler:
Bootstrap percolation on geometric inhomogeneous random graphs. CoRR abs/1603.02057 (2016) - 2015
- [j3]Oliver Cooley
Evolution of high-order connected components in random hypergraphs. Electron. Notes Discret. Math. 49: 569-575 (2015) - [j2]Mihyun Kang
Bootstrap percolation in random k-uniform hypergraphs. Electron. Notes Discret. Math. 49: 595-601 (2015) - [j1]Mihyun Kang
The Phase Transition in Multitype Binomial Random Graphs. SIAM J. Discret. Math. 29(2): 1042-1064 (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-12-02 21:25 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: