Author:
Bollig Benedikt,Kuske Dietrich
Subject
Applied Mathematics,Logic
Reference28 articles.
1. Muller message-passing automata and logics;Bollig;Information and Computation,2008
2. Message-passing automata are expressively equivalent to EMSO logic;Bollig;Theoretical Computer Science,2006
3. Approximation schemes for first-order definable optimisation problems;Dawar,2007
4. Model theory makes formulas large;Dawar,2007
5. First-order queries on structures of bounded degree are computable with constant delay;Durand;ACM Transactions on Computational Logic,2007
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Testability of First-Order Properties in Bounded-Degree Graphs and Connections to Proximity-Oblivious Testing;SIAM Journal on Computing;2024-07-04
2. The Complexity of Model Checking Multi-Stack Systems;Theory of Computing Systems;2016-08-26
3. Hanf normal form for first-order logic with unary counting quantifiers;Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science;2016-07-05
4. Preservation and decomposition theorems for bounded degree structures;Logical Methods in Computer Science;2015-12-29
5. Preservation and decomposition theorems for bounded degree structures;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14