854 citations
- École Normale Supérieure de LyonFR328 papers
- Centre National de la Recherche ScientifiqueFR231 papers
- Institut national de recherche en sciences et technologies du numériqueFR163 papers
- Lyon 1 UniversitéFR162 papers
- Université de LyonFR63 papers
- Université Grenoble AlpesFR21 papers
- University of LeedsGB19 papers
- Laboratoire d'Informatique de GrenobleFR17 papers
- LIP - Laboratory of Instrumentation and Experimental Particle PhysicsPT17 papers
- Union UniversityRS14 papers
- Laboratoire des Sciences pour la Conception, l'Optimisation et la ProductionFR13 papers
- École PolytechniqueFR12 papers
21 papers · 1 filter
The domino problem is undecidable on surface groups
Nathalie Aubrun, Sebastián Barbieri, Etienne Moutot
We show that the domino problem is undecidable on orbit graphs of non-deterministic substitutions which satisfy a technical property. As an application, we prove that the domino pr…
Bisimilarity of Open Terms in Stream GSOS
Filippo Bonchi, Tom van Bussel, Matias David Lee +1
Stream GSOS is a specification format for operations and calculi on infinite sequences. The notion of bisimilarity provides a canonical proof technique for equivalence of closed te…
Computing the Width of Non-deterministic Automata
Denis Kuperberg, Anirban Majumdar
We introduce a measure called width, quantifying the amount of nondeterminism in automata. Width generalises the notion of good-for-games (GFG) automata, that correspond to NFAs of…
The 2-domination and Roman domination numbers of grid graphs
Michaël Rao, Alexandre Talon
We investigate the 2-domination number for grid graphs, that is the size of a smallest set of vertices of the grid such that each vertex of the grid belongs to or has at le…
Semidefinite programming hierarchies for constrained bilinear optimization
Mario Berta, Francesco Borderi, Omar Fawzi +1
We give asymptotically converging semidefinite programming hierarchies of outer bounds on bilinear programs of the form , maximized with respect…
Constant overhead quantum fault-tolerance with quantum expander codes
Omar Fawzi, Antoine Grospellier, Anthony Leverrier
We prove that quantum expander codes can be combined with quantum fault-tolerance techniques to achieve constant overhead: the ratio between the total number of physical qubits req…