![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Philippe Malbos
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i6]Philippe Malbos, Tanguy Massacrier, Georg Struth:
Single-set cubical categories and their formalisation with a proof assistant. CoRR abs/2401.10553 (2024) - 2023
- [i5]Cameron Calk, Eric Goubault, Philippe Malbos:
Persistent homology of directed spaces. CoRR abs/2305.03357 (2023) - [i4]Cameron Calk, Philippe Malbos, Damien Pous, Georg Struth:
Higher Catoids, Higher Quantales and their Correspondences. CoRR abs/2307.09253 (2023) - [i3]Dimitri Ara, Albert Burroni, Yves Guiraud, Philippe Malbos, François Métayer, Samuel Mimram:
Polygraphs: From Rewriting to Higher Categories. CoRR abs/2312.00429 (2023) - 2022
- [j4]Cameron Calk, Eric Goubault, Philippe Malbos, Georg Struth:
Algebraic coherent confluence and higher globular Kleene algebras. Log. Methods Comput. Sci. 18(4) (2022) - [j3]Cyrille Chenavier, Benjamin Dupont
, Philippe Malbos
:
Confluence of algebraic rewriting systems. Math. Struct. Comput. Sci. 32(7): 870-897 (2022) - 2021
- [c7]Cameron Calk, Eric Goubault, Philippe Malbos:
Abstract Strategies and Coherence. RAMiCS 2021: 108-125 - [c6]Philippe Malbos
, Isaac Ren
:
Completion in Operads via Essential Syzygies. ISSAC 2021: 305-312 - 2020
- [i2]Cameron Calk, Eric Goubault, Philippe Malbos, Georg Struth:
Algebraic coherent confluence and higher-dimensional globular Kleene algebras. CoRR abs/2006.16129 (2020)
2010 – 2019
- 2018
- [j2]Yves Guiraud, Philippe Malbos:
Polygraphs of finite derivation type. Math. Struct. Comput. Sci. 28(2): 155-201 (2018) - [i1]Cameron Calk, Eric Goubault, Philippe Malbos:
Time-reversal homotopical properties of concurrent systems. CoRR abs/1812.05062 (2018) - 2016
- [c5]Philippe Malbos, Samuel Mimram:
Homological Computations for Term Rewriting Systems. FSCD 2016: 27:1-27:17 - 2014
- [c4]Aurelien Grolet, Philippe Malbos, Fabrice Thouverez
:
Eigenvalue Method with Symmetry and Vibration Analysis of Cyclic Structures. CASC 2014: 121-137 - 2013
- [c3]Yves Guiraud, Philippe Malbos
, Samuel Mimram:
A Homotopical Completion Procedure with Applications to Coherence of Monoids. RTA 2013: 223-238 - 2012
- [j1]Yves Guiraud, Philippe Malbos
:
Coherence in monoidal track categories. Math. Struct. Comput. Sci. 22(6): 931-969 (2012)
2000 – 2009
- 2002
- [c2]Frédéric Gruau, Philippe Malbos:
The Blob: A Basic Topological Concept for "Hardware-Free" Distributed Computation. UMC 2002: 151-163 - [c1]Philippe Malbos:
Rewriting Systems and Hochschild-Mitchell Homology. GETCO 2002: 59-72
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint