Mengel, Stefan; Vinall-Smeeth, Harry:
A lower bound on unambiguous context free grammars via communication complexity
#!ilm_mods_00065797!#
In: Proceedings of the ACM on Management of Data, vol. 3 (2025), no. 2, art. 88
DOI: https://doi.org/10.1145/3725225
Berkholz, Christoph; Kuske, Dietrich; Schwarz, Christian:
Boolean basis, formula size, and number of modal operators
#!ilm_mods_00069963!#
In: Logical methods in computer science, vol. 21 (2025), no. 3, art. 10
DOI: https://doi.org/10.46298/lmcs-21(3:10)2025
Berkholz, Christoph; Lichter, Moritz; Vinall-Smeeth, Harry:
Supercritical size-width tree-like resolution trade-offs for graph isomorphism
#!ilm_mods_00075659!#
In: 50th International Symposium on Mathematical Foundations of Computer Science: MFCS 2025, August 25–29, 2025, Warsaw, Poland (ISBN 978-3-95977-388-1), (2025), art. 18
DOI: https://doi.org/10.4230/LIPIcs.MFCS.2025.18
Berkholz, Christoph; Kuske, Dietrich; Schwarz, Christian:
Modal logic is more succinct iff bi-implication is available in some form
#!ilm_mods_00012377!#
In: 41st International Symposium on Theoretical Aspects of Computer Science: STACS 2024, March 12-14, 2024, Clermont-Ferrand, France (ISBN 978-3-95977-311-9), (2024), art. 12
DOI: https://doi.org/10.4230/LIPIcs.STACS.2024.12
Berkholz, Christoph; Mengel, Stefan; Wilhelm, Hermann:
A characterization of efficiently compilable constraint languages
#!ilm_mods_00012376!#
In: 41st International Symposium on Theoretical Aspects of Computer Science: STACS 2024, March 12-14, 2024, Clermont-Ferrand, France (ISBN 978-3-95977-311-9), (2024), art. 11
DOI: https://doi.org/10.4230/LIPIcs.STACS.2024.11
Vinall-Smeeth, Harry:
From quantifier depth to quantifier number: separating structures with k variables
#!ilm_mods_00017706!#
In: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science (ISBN 979-8-4007-0660-8), (2024), art. 71
DOI: https://doi.org/10.1145/3661814.3662125
Vinall-Smeeth, Harry:
Structured d-DNNF is not closed under negation
#!ilm_mods_00019995!#
In: Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence: Jeju, Korea, 3-9 August 2024 (ISBN 978-1-956792-04-1), (2024), pp. 3593–3601
DOI: https://doi.org/10.24963/ijcai.2024/398
Berkholz, Christoph; Vinall-Smeeth, Harry:
A dichotomy for succinct representations of homomorphisms
#!ilm_mods_00006037!#
In: 50th International Colloquium on Automata, Languages, and Programming: ICALP 2023, July 10-14, 2023, Paderborn, Germany (ISBN 978-3-95977-278-5), (2023), art. 113
DOI: https://doi.org/10.4230/LIPIcs.ICALP.2023.113
Berkholz, Christoph; Nordström, Jakob:
Near-optimal lower bounds on quantifier depth and Weisfeiler-Leman refinement steps
#!ilm_mods_00008014!#
In: Journal of the ACM: JACM, vol. 70 (2023), no. 5, art. 32
DOI: https://doi.org/10.1145/3195257
Carmeli, Nofar; Zeevi, Shai; Berkholz, Christoph; Conte, Alessio; Kimelfeld, Benny; Schweikardt, Nicole:
Answering (unions of) conjunctive queries using random access and random-order enumeration
#!ilm_mods_00001101!#
In: ACM transactions on database systems: TODS, vol. 47 (2022), no. 3, art. 9
DOI: https://doi.org/10.1145/3531055
