225 citations
- Université Paris CitéFR306 papers
- Centre National de la Recherche ScientifiqueFR291 papers
- Université Paris DiderotFR88 papers
- Sorbonne Paris CitéFR62 papers
- Délégation Paris 7FR38 papers
- Institut national de recherche en sciences et technologies du numériqueFR35 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR31 papers
- Sorbonne UniversitéFR31 papers
- Centre for Quantum TechnologiesSG23 papers
- Université Paris-SaclayFR22 papers
- National University of SingaporeSG21 papers
- LIP6FR20 papers
493 papers
Distance statistics of block-weighted planar quadrangulations
Jérémie Bouttier, Emmanuel Guitter, Hugo Manet
We study random planar quadrangulations in which each block -- i.e., each simple (without multiple edges) component -- is assigned a weight . We derive an explicit expression fo…
Buy-at-Bulk Facility Location on Trees
Shamisa Nematollahi, Daniel Vaz
We consider the buy-at-bulk facility location problem (BBFL), a problem combining the classic facility location problem with buy-at-bulk network design, which finds motivation in t…
A uniform characterisation of the (a)synchronous must-preorder
Giovanni Bernardi, Hugo Férée, Gaëtan Lopez
In the setting of message passing software, De Nicola and Hennessy must-preorder defines when a program improves on another one. Since this preorder does not come equipped with a v…
Quantum Bayesian Networks: Compositionality and Typing via Linear Logic
Rémi Di Guardia, Thomas Ehrhard, Claudia Faggian
Quantum Bayesian networks provide a mathematical formalism to describe causal relations, to analyse correlations, and to predict the probabilities of measurement outcomes, in syste…
Synthetic Differential Geometry in Lean
Riccardo Brasca, Gabriella Clemente
This article is about the formalization of synthetic differential geometry with the Lean proof assistant and the mathematical library mathlib. The main result we prove and formaliz…
Proving and Computing: The Infinite Pigeonhole Principle and Countable Choice
Zena M. Ariola, Paul Downen, Hugo Herbelin
Structural recursion is a common technique used by programmers in modern languages and is taught to introductory computer science students. But what about its dual, structural core…