Subject
General Computer Science,Theoretical Computer Science
Reference46 articles.
1. Fixpoint logics, relational machines, and computational complexity;Abitoul;IEEE FOCS,1992
2. S. Arnborg, B. Courcelle, A. Proskurowski and D. Seese, An algebraic theory of graph reduction, Technical Report LaBRI-90–02, Universite de Bordeaux. Jan. 1990, JACM, vol. 40 No. 5, 1993 pp. 1134–1164. (Extended abstract in Lee. Notes Comp. Sci. 532, 1991, pp. 70–83.)
3. The design and analysis of computer algorithms;Aho,1974
4. Universality of Data Retrieval Languages;Aho;6th Symposium on Principles of Programming Languages,1979
5. Reachability is harder for directed than for undirected finite graphs;Ajtai;Journal of Symbolic Logic, 55 (1),1990
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Twin-Width IV: Ordered Graphs and Matrices;Journal of the ACM;2024-06-13
2. Twin-width IV: ordered graphs and matrices;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
3. Parameterized circuit complexity of model-checking on sparse structures;Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science;2018-07-09
4. A logical approach to locality in pictures languages;Journal of Computer and System Sciences;2016-09
5. Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract);Graph-Theoretic Concepts in Computer Science;2010