References

1. Josh Alman & Virginia Vassilevska Williams (2020): A Refined Laser Method and Faster Matrix Multiplication.
2. Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Paweł Sobociński & Fabio Zanasi (2016): Rewriting modulo symmetric monoidal structure. Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. Available at http://dx.doi.org/10.1145/2933575.2935316.
3. Bob Coecke & Aleks Kissinger (2017): Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning. Cambridge University Press, doi:10.1017/9781316219317.
4. Lucas Dixon & Aleks Kissinger (2010): Open Graphs and Monoidal Theories.
5. Fabrizio Genovese & Jelle Herold (2021): A Categorical Semantics for Hierarchical Petri Nets.
6. Fabrizio Romano Genovese, Fosco Loregian & Daniele Palombi (2021): Nets with Mana: A Framework for Chemical Reaction Modelling.
7. Fred G. Gustavson (1978): Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition. ACM Trans. Math. Softw. 4(3), pp. 250–269. Available at https://doi.org/10.1145/355791.355796.
8. Benjamin Heintz, Rankyung Hong, Shivangi Singh, Gaurav Khandelwal, Corey Tesdahl & Abhishek Chandra (2019): MESH: A Flexible Distributed Hypergraph Processing System.
9. Stephen Lack (2004): Composing PROPs. Theory and Applications of Categories 13(9), pp. 147–163. Available at http://www.tac.mta.ca/tac/volumes/13/9/13-09abs.html.
10. Yves Lafont (2003): Towards an algebraic theory of Boolean circuits. Journal of Pure and Applied Algebra 184(2-3), pp. 257–310, doi:10.1016/S0022-4049(03)00069-0.
11. Evan Patterson, Andrew Baas, James Fairbanks, Micah Halter, Sophie Libkind & Owen Lynch (2020): Catlab.jl: A framework for applied category theory, doi:10.17605/OSF.IO/HMNFE. Available at https://osf.io/hmnfe/. Publisher: OSF.
12. Evan Patterson, David I. Spivak & Dmitry Vagner (2020): Wiring diagrams as normal forms for computing in symmetric monoidal categories. In: Proceedings of the 2020 Applied Category Theory Conference. Available at http://dx.doi.org/10.4204/EPTCS.333.4.
13. Peter Selinger (2010): A survey of graphical languages for monoidal categories. arXiv:0908.3347 [math] 813, pp. 289–355, doi:10.1007/978-3-642-12821-9-4.
14. Julian Shun (2020): Practical Parallel Hypergraph Algorithms. In: Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP '20. Association for Computing Machinery, New York, NY, USA, pp. 232–249. Available at https://doi.org/10.1145/3332466.3374527.
15. Pawel Sobocinski, Paul W. Wilson & Fabio Zanasi (2019): CARTOGRAPHER: A Tool for String Diagrammatic Reasoning (Tool Paper). In: Markus Roggenbach & Ana Sokolova: 8th Conference on Algebra and Coalgebra in Computer Science (CALCO 2019), Leibniz International Proceedings in Informatics (LIPIcs) 139. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp. 20:1–20:7, doi:10.4230/LIPIcs.CALCO.2019.20. Available at http://drops.dagstuhl.de/opus/volltexte/2019/11448.
16. David I. Spivak (2020): Poly: An abundant categorical setting for mode-dependent dynamics.
17. Paul Wilson & Fabio Zanasi (2021): The Cost of Compositionality: A High-Performance Implementation of String Diagram Composition. Available at https://arxiv.org/abs/2105.09257.
18. Raphael Yuster & Uri Zwick (2005): Fast Sparse Matrix Multiplication. ACM Trans. Algorithms 1(1), pp. 2–13. Available at https://doi.org/10.1145/1077464.1077466.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org