Berkholz, Christoph
- Answering Conjunctive Queries under Updates
2017/02/21 by Christoph Berkholz, Jens Keppeler, Berkholz, Christoph +3 · 6 citations
Computer Science · #Advanced Database Systems and Queries #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Databases (cs.DB) #Distributed systems and fault tolerance #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
- Limitations of Algebraic Approaches to Graph Isomorphism Testing
2015/02/20 by Christoph Berkholz, Martin Grohe, Berkholz, Christoph +1 · 5 citations
Computer Science · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Machine Learning and Algorithms
- Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration
2019/12/23 by Carmeli, Nofar, Zeevi, Shai, Berkholz, Christoph +2 · 4 citations
#Databases (cs.DB) #FOS: Computer and information sciences
- Answering UCQs under updates and in the presence of integrity constraints
2017/09/28 by Berkholz, Christoph, Keppeler, Jens, Schweikardt, Nicole · 3 citations
#Databases (cs.DB) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
- Answering FO+MOD queries under updates on bounded degree databases
2017/02/28 by Christoph Berkholz, Berkholz, Christoph, Jens Keppeler +3 · 4 citations
Computer Science · #Advanced Database Systems and Queries #Algorithms and Data Compression #Data Management and Algorithms #Databases (cs.DB) #FOS: Computer and information sciences #Logic in Computer Science (cs.LO)
- Linear Diophantine Equations, Group CSPs, and Graph Isomorphism
2016/07/14 by Christoph Berkholz, Martin Grohe, Berkholz, Christoph +1 · 2 citations
Computer Science · #Complexity and Algorithms in Graphs #Advanced Graph Theory Research #semigroups and automata theory
- Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
2015/09/28 by Berkholz, Christoph, Bonsma, Paul, Grohe, Martin · 1 citation
#Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
- Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman\n Refinement Steps
2016/08/30 by Christoph Berkholz, Jakob Nordström, Berkholz, Christoph +1 · 1 citation
Computer Science · #Advanced Database Systems and Queries #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #F.2.3 #F.4.1 #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems