August 01, 1996 article Open access Logical Hierarchies in PTIME Information and Computation DOI: 10.1006/inco.1996.0070 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 11 stored of 124 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Recursive Querying of Neural Networks via Weighted Structures 2026 Proceedings of the ACM on Management of Data article Computer Science Logic, Reasoning, and Knowledge 0 citations Computational Complexity of the Weisfeiler-Leman Dimension 2026 ACM Transactions on Computational Logic article Computer Science Advanced Graph Theory Research 0 citations Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements 2025 Journal of the ACM article Computer Science Complexity and Algorithms in Graphs Open access 0 citations Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements 2025 Journal of the ACM article Computer Science Complexity and Algorithms in Graphs Open access 0 citations Logical equivalences, homomorphism indistinguishability, and forbidden minors 2024 Information and Computation article Computer Science Advanced Graph Theory Research Open access 3 citations Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements 2023 Annual Symposium on Foundations of Computer Science conference-paper Computer Science Complexity and Algorithms in Graphs 4 citations Canonisation and Definability for Graphs of Bounded Rank Width 2022 ACM Transactions on Computational Logic article Computer Science Advanced Graph Theory Research Open access 7 citations The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs 2022 SIAM Journal on Discrete Mathematics article Computer Science Advanced Graph Theory Research Open access 11 citations Graphs Identified by Logics with Counting 2021 ACM Transactions on Computational Logic article Computer Science Advanced Graph Theory Research Open access 5 citations The Weisfeiler-Leman algorithm 2020 ACM SIGLOG News article Computer Science Advanced Graph Theory Research 24 citations Counting Bounded Tree Depth Homomorphisms 2020 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Advanced Graph Theory Research Open access 21 citations 11 results References 0