Antonin Delpeuch

Orcid: 0000-0002-8612-8827

According to our database1, Antonin Delpeuch authored at least 11 papers between 2014 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Normalization for planar string diagrams and a quadratic equivalence algorithm.
Log. Methods Comput. Sci., 2022

2021
Word problems on string diagrams.
PhD thesis, 2021

The Word Problem for Braided Monoidal Categories is Unknot-Hard.
Proceedings of the Fourth International Conference on Applied Category Theory, 2021

2020
A survey of OpenRefine reconciliation services.
Proceedings of the 15th International Workshop on Ontology Matching co-located with the 19th International Semantic Web Conference (ISWC 2020), 2020

Running a Reconciliation Service for Wikidata.
Proceedings of the 1st Wikidata Workshop (Wikidata 2020) co-located with 19th International Semantic Web Conference(OPub 2020), 2020

OpenTapioca: Lightweight Entity Linking for Wikidata.
Proceedings of the 1st Wikidata Workshop (Wikidata 2020) co-located with 19th International Semantic Web Conference(OPub 2020), 2020

2019
The word problem for double categories.
CoRR, 2019

A complete language for faceted dataflow programs.
Proceedings of the Proceedings Applied Category Theory 2019, 2019

Autonomization of Monoidal Categories.
Proceedings of the Proceedings Applied Category Theory 2019, 2019

2018
Normal forms for planar connected string diagrams.
CoRR, 2018

2014
Complexity of Grammar Induction for Quantum Types.
Proceedings of the 11th workshop on Quantum Physics and Logic, 2014


  Loading...