Kröll, Markus

1. A Complexity Theory for Hard Enumeration Problems
   2016/10/18 by Creignou, Nadia, Kröll, Markus, Pichler, Reinhard +2 · 3 citations
   #Computational Complexity (cs.CC) #F.1.3 #FOS: Computer and information sciences
2. Enumeration Complexity of Conjunctive Queries with Functional\n Dependencies
   2017/12/21 by Nofar Carmeli, Carmeli, Nofar, Markus Kröll +1 · 2 citations
   Computer Science · #Advanced Database Systems and Queries #Computational Complexity (cs.CC) #Data Management and Algorithms #Databases (cs.DB) #FOS: Computer and information sciences #H.2.3 #Logic, Reasoning, and Knowledge
3. Efficiently Enumerating Minimal Triangulations
   2016/04/11 by Carmeli, Nofar, Kenig, Batya, Kimelfeld, Benny +1 · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
4. On the Enumeration Complexity of Unions of Conjunctive Queries
   2018/12/10 by Carmeli, Nofar, Kröll, Markus · 1 citation
   #Databases (cs.DB) #FOS: Computer and information sciences