Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

String Diagram Rewrite Theory I: Rewriting with Frobenius Structure
Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, et al.
Journal of the ACM (2022) Vol. 69, Iss. 2, pp. 1-58
Open Access | Times Cited: 29

Showing 1-25 of 29 citing articles:

An Introduction to String Diagrams for Computer Scientists
Robin Piedeleu, Fabio Zanasi
(2025)
Closed Access | Times Cited: 1
Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus
Boldizsár Poór, Quanlong Wang, Razin A. Shaikh, et al.
(2023), pp. 1-14
Open Access | Times Cited: 10
Context-Free Languages of String Diagrams
Matt Earnshaw, Mario Román
Lecture notes in computer science (2025), pp. 1-23
Closed Access
Diagrammatic Algebra of First Order Logic
Filippo Bonchi, Alessandro Di Giorgio, Nathan Haydon, et al.
(2024), pp. 1-15
Open Access | Times Cited: 3
Pregeometric Spaces from Wolfram Model Rewriting Systems as Homotopy Types
Xerxes D. Arsiwalla, Jonathan Gorard
International Journal of Theoretical Physics (2024) Vol. 63, Iss. 4
Open Access | Times Cited: 2
ZX-calculus for the working quantum computer scientist
John van de Wetering
arXiv (Cornell University) (2020)
Closed Access | Times Cited: 14
String diagram rewrite theory II: Rewriting with symmetric monoidal structure
Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, et al.
Mathematical Structures in Computer Science (2022) Vol. 32, Iss. 4, pp. 511-541
Open Access | Times Cited: 8
Deconstructing the Calculus of Relations with Tape Diagrams
Filippo Bonchi, Alessandro Di Giorgio, Alessio Santamaria
Proceedings of the ACM on Programming Languages (2023) Vol. 7, Iss. POPL, pp. 1864-1894
Open Access | Times Cited: 4
The Relational Machine Calculus
Chris Barrett, Daniel Castle, Willem Heijltjes
(2024), pp. 1-15
Open Access | Times Cited: 1
Decapodes: A diagrammatic tool for representing, composing, and computing spatialized partial differential equations
L. E. Morris, Andrew Baas, Jesus Arias, et al.
Journal of Computational Science (2024) Vol. 81, pp. 102345-102345
Open Access | Times Cited: 1
Compositional Value Iteration with Pareto Caching
Kazuki Watanabe, Marck van der Vegt, Sebastian Junges, et al.
Lecture notes in computer science (2024), pp. 467-491
Closed Access | Times Cited: 1
Kindergarden quantum mechanics graduates ...or how I learned to stop gluing LEGO together and love the ZX-calculus
Bob Coecke, Dominic Horsman, Aleks Kissinger, et al.
Theoretical Computer Science (2021) Vol. 897, pp. 1-22
Open Access | Times Cited: 8
String diagram rewrite theory III: Confluence with and without Frobenius
Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, et al.
Mathematical Structures in Computer Science (2022) Vol. 32, Iss. 7, pp. 829-869
Open Access | Times Cited: 6
Complete ZX-calculi for the stabiliser fragment in odd prime dimensions
Robert Booth, Titouan Carette
arXiv (Cornell University) (2022)
Open Access | Times Cited: 4
Higher-Dimensional Subdiagram Matching
Amar Hadzihasanovic, Diana Kessler
(2023), pp. 1-13
Open Access | Times Cited: 2
From Gs-monoidal to Oplax Cartesian Categories: Constructions and Functorial Completeness
T. A. Fritz, Fabio Gadducci, Davide Trotta, et al.
Applied Categorical Structures (2023) Vol. 31, Iss. 5
Closed Access | Times Cited: 2
A Categorical Approach to Synthetic Chemistry
Ella Gale, Leo Lobski, Fabio Zanasi
Lecture notes in computer science (2023), pp. 276-294
Closed Access | Times Cited: 2
Kindergarden quantum mechanics graduates (...or how I learned to stop gluing LEGO together and love the ZX-calculus)
Bob Coecke, Dominic Horsman, Aleks Kissinger, et al.
arXiv (Cornell University) (2021)
Open Access | Times Cited: 4
Truth diagrams for some non-classical and modal logics
Can Başķent
Journal of Applied Non-Classical Logics (2024) Vol. 34, Iss. 4, pp. 527-560
Closed Access
Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem
Adriano Barile, Stefano Berardi, Luca Roversi
Theoretical Computer Science (2024), pp. 115031-115031
Open Access
A robust graph-based approach to observational equivalence
Dan R. Ghica, Koko Muroya, Todd Waugh Ambridge
arXiv (Cornell University) (2019)
Open Access | Times Cited: 1
Deconstructing the Calculus of Relations with Tape Diagrams
Filippo Bonchi, Alessandro Di Giorgio, Alessio Santamaria
arXiv (Cornell University) (2022)
Open Access | Times Cited: 1
Weakening and Iterating Laws using String Diagrams
Alexandre Goy
Electronic Notes in Theoretical Informatics and Computer Science (2023) Vol. Volume 1 - Proceedings of...
Open Access
A Strict Constrained Superposition Calculus for Graphs
Rachid Echahed, Mnacho Echenim, Mehdi Mhalla, et al.
Lecture notes in computer science (2023), pp. 135-155
Open Access
Allegories of Symbolic Manipulations
Francesco Gavazzo
(2023), pp. 1-15
Open Access
Page 1 - Next Page

Scroll to top