output
19992025
most citedBig Data Computing and Clouds: Trends and Future Directions

854 citations

Showing 2018Show all

21 papers · 1 filter

math.GR2018★ 2 cited

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…

cs.LO2018★ 1 cited

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…

cs.FL2018★ 2 cited

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…

cs.DM2018★ 6 cited

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…

quant-ph2018★ 26 cited

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…

quant-ph2018★ 108 cited

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…