Christoph Berkholz - Citegraph

Author Info

Name	Affiliation	Papers
CHRISTOPH BERKHOLZ	Humboldt Univ, Inst Informat, D-10099 Berlin, Germany	18
Collaborators	Citations	PageRank
13	49	7.03
Referers	Referees	References
66	156	138

Search Limit

100156

Publications (18 rows)

Collaborators (13 rows)

Referers (66 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration	0	0.34	2021
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration	1	0.35	2020
Supercritical Space-Width Trade-offs for Resolution.	0	0.34	2020
Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular Width.	0	0.34	2019
Compiling Existential Positive Queries to Bounded-Variable Fragments	0	0.34	2019
Answering UCQs under updates and in the presence of integrity constraints.	5	0.42	2018
The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs.	2	0.37	2018
Answering FO+MOD queries under updates on bounded degree databases.	7	0.52	2017
Answering Conjunctive Queries under Updates.	13	0.56	2017
Supercritical Space-Width Trade-Offs for Resolution.	0	0.34	2016
Linear diophantine equations, group CSPs, and graph isomorphism	0	0.34	2016
Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps.	2	0.38	2016
On the speed of constraint propagation and the time complexity of arc consistency testing	2	0.40	2013
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement.	9	0.51	2013
Bounds for the Quantifier Depth in Finite-Variable Logics: Alternation Hierarchy	1	0.35	2013
On the Complexity of Finding Narrow Proofs	4	0.39	2012
Bounds for the quantifier depth in two-variable logic	0	0.34	2012
Lower Bounds for Existential Pebble Games and k-Consistency Tests	3	0.40	2012

1