default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristoph Standke
Person information
- affiliation: RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j2]Torsten Mütze, Christoph Standke, Veit Wiechert:
A minimum-change version of the Chung-Feller theorem for Dyck paths. Eur. J. Comb. 69: 260-275 (2018)- 2017
- [j1]Torsten Mütze, Christoph Standke, Veit Wiechert:
A minimum-change version of the Chung-Feller theorem for Dyck paths. Electron. Notes Discret. Math. 61: 901-907 (2017)
Conference and Workshop Papers
- 2024
- [c4]Martin Grohe, Benny Kimelfeld, Peter Lindner, Christoph Standke:
The Importance of Parameters in Database Queries. ICDT 2024: 14:1-14:17 - [c3]Jan Böker
, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke:
The Complexity of Homomorphism Reconstructibility. STACS 2024: 19:1-19:20 - 2023
- [c2]Martin Grohe, Peter Lindner, Christoph Standke:
Probabilistic Query Evaluation with Bag Semantics. ICDT 2023: 20:1-20:19 - 2021
- [c1]Nofar Carmeli, Martin Grohe, Peter Lindner, Christoph Standke:
Tuple-Independent Representations of Infinite Probabilistic Databases. PODS 2021: 388-401
Informal and Other Publications
- 2024
- [i7]Martin Grohe, Benny Kimelfeld, Peter Lindner, Christoph Standke:
The Importance of Parameters in Database Queries. CoRR abs/2401.04606 (2024) - [i6]Eva Fluck, Sandra Kiefer, Christoph Standke:
Untangling Gaussian Mixtures. CoRR abs/2403.06671 (2024) - [i5]Martin Grohe, Christoph Standke, Juno Steegmans, Jan Van den Bussche:
Query languages for neural networks. CoRR abs/2408.10362 (2024) - 2023
- [i4]Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke:
The Complexity of Homomorphism Reconstructibility. CoRR abs/2310.09009 (2023) - 2022
- [i3]Martin Grohe, Peter Lindner, Christoph Standke:
Probabilistic Query Evaluation with Bag Semantics. CoRR abs/2201.11524 (2022) - 2020
- [i2]Nofar Carmeli, Martin Grohe, Peter Lindner, Christoph Standke:
Tuple-Independent Representations of Infinite Probabilistic Databases. CoRR abs/2008.09511 (2020) - 2016
- [i1]Torsten Mütze, Christoph Standke, Veit Wiechert:
A minimum-change version of the Chung-Feller theorem for Dyck paths. CoRR abs/1603.02525 (2016)
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-09-26 01:52 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:
