From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “counting” 184

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Balanced and Unbalanced Triangle Count in Signed Networks
2023 IEEE Transactions on Knowledge and Data Engineering article Computer Science Graph Theory and Algorithms

Aikta Arya, Pradumn Kumar Pandey, Akrati Saxena

9

citations
Simulating Quantum Circuits by Model Counting
2024 Lecture notes in computer science conference-paper Computer Science Quantum Computing Algorithms and Architecture Open access

Jingyi Mei, Marcello Bonsangue, Alfons Laarman

15

citations
Simulating Quantum Circuits by Model Counting
2024 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Jingyi Mei, Marcello Bonsangue, Alfons Laarman

1

citations
Approximate Evaluation of First-Order Counting Queries
2021 Society for Industrial and Applied Mathematics eBooks conference-paper Computer Science Advanced Graph Theory Research Open access

Jan Dreier, Peter Rossmanith

5

citations
Going Deep and Going Wide: Counting Logic and Homomorphism Indistinguishability over Graphs of Bounded Treedepth and Treewidth
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Eva Fluck, Tim Seppelt, Gian Luca Spitzer

0

citations
Counting Bounded Tree Depth Homomorphisms
2020 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Advanced Graph Theory Research Open access

Martin Grohe

21

citations
Equivalence Checking of Quantum Circuits by Model Counting
2024 Lecture notes in computer science conference-paper Computer Science Quantum Computing Algorithms and Architecture Open access

Jingyi Mei, Tim Coopmans, Marcello Bonsangue, Alfons Laarman

15

citations
Quantum Physics using Weighted Model Counting
2025 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Joon‐Hyung Lee, Alfons Laarman

1

citations
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Jan Dreier, Daniel Mock, Peter Rossmanith

0

citations
Graphs Identified by Logics with Counting
2021 ACM Transactions on Computational Logic article Computer Science Advanced Graph Theory Research Open access

Sandra Kiefer, Pascal Schweitzer, Erkal Selman

5

citations
Equivalence Checking of Quantum Circuits via Path-Sum and Weighted Model Counting
2026 Lecture notes in computer science conference-paper Computer Science Quantum Computing Algorithms and Architecture Open access

Wei‐Jia Huang, Christophe Chareton, Yu-Fang Chen, Kai-Min Chung, Min-Hsiu Hsieh, Alfons Laarman, +1 more

2

citations
Both Ends Count! Just How Good are LLM Agents at "Text-to-Big SQL"?
2026 RWTH Publications (RWTH Aachen) conference-paper Computer Science Advanced Database Systems and Queries Open access

Germán T. Eizaguirre, Lars Tissen, Marc Sánchez‐Artigas

0

citations
Both Ends Count! Just How Good are LLM Agents at Text-to-“Big SQL”?
2026 RWTH Publications (RWTH Aachen) book-chapter Computer Science Topic Modeling Open access

Germán T. Eizaguirre, Lars Tissen, Marc Sánchez‐Artigas

0

citations
Both Ends Count! Just How Good are LLM Agents at Text-to-“Big SQL”?
2026 Workshop on Machine Learning and Systems (EuroMLSys) conference-paper Computer Science Advanced Database Systems and Queries Open access

Germán T. Eizaguirre, Lars Tissen, Marc Sánchez‐Artigas

0

citations
Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation
2026 arXiv (Cornell University) preprint Computer Science Quantum Computing Algorithms and Architecture Open access

Alexis de Colnet, Floris Geerts, Rihan Hai, Alfons Laarman, Joon Hyung Lee, Guillermo A. Pérez

0

citations
Graph Learning with 1D Convolutions on Random Walks.
2021 arXiv (Cornell University) preprint Computer Science Advanced Graph Neural Networks Open access

Jan Toenshoff, Martin Ritzert, Hinrikus Wolf, Martin Grohe

5

citations
The Complexity of Homomorphism Reconstructibility
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke

1

citations
The Complexity of Homomorphism Reconstructibility
2025 ACM Transactions on Computation Theory article Computer Science Advanced Graph Theory Research Open access

Jan Böker, Louis Härtel, Nina Runde, Tim Seppelt, Christoph Standke

0

citations
A Finite-Model-Theoretic View on Propositional Proof Complexity
2022 Logical Methods in Computer Science article Computer Science Complexity and Algorithms in Graphs Open access

Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa

5

citations
The Complexity of Homomorphism Reconstruction Revisited
2026 DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) article Computer Science Advanced Graph Theory Research Open access

Timo Gervens, Martin Grohe, Louis Härtel, Philipp Silva da Fonseca

0

citations
Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability
2023 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Moritz Lichter, Benedikt Pago, Tim Seppelt

0

citations
Temporal Constraint Satisfaction Problems in Fixed-Point Logic
2020 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Advanced Graph Theory Research Open access

Manuel Bodirsky, Wied Pakusa, Jakub Rydval

10

citations
A compositional approach to probabilistic knowledge compilation
2021 International Journal of Approximate Reasoning article Computer Science Bayesian Modeling and Causal Inference Open access

Giso H. Dal, Alfons Laarman, Arjen Hommersom, Peter Lucas

6

citations
Choiceless Computation and Symmetry: Limitations of Definability
2021 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access

Benedikt Pago

4

citations
Simulating Logspace-Recursion with Logarithmic Quantifier Depth
2023 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Advanced Graph Theory Research

Steffen van Bergerem, Martin Grohe, Sandra Kiefer, Luca Oeljeklaus

1

citations