Scalable pattern matching in computation graphs

DOI10.4204/EPTCS.417.5MaRDI QIDQ6934019zbMATH OpenFDO

Authors Luca Mondada, Pablo Andrés-Martínez

Publication date 3 September 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4204/EPTCS.417.5

Mathematics Subject Classification ID

Data structures (68P05) Networks and circuits as models of computation; circuit complexity (68Q06) Grammars and rewriting systems (68Q42) Quantum computation (81P68)

Cites work

• Catalan Numbers
• Labelled port graph -- a formal structure for models and computations
• Multivariate Fuss-Catalan numbers
• String diagram rewrite theory II: Rewriting with symmetric monoidal structure
• String diagram rewrite theory. I: Rewriting with Frobenius structure

This page was built for publication: Scalable pattern matching in computation graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6934019)