output
20002026
most citedBenchmark Analysis of Representative Deep Neural Network Architectures

853 citations

Showing 2009Show all

27 papers · 1 filter

cs.DC2009★ 1 cited

Self-Stabilizing Byzantine Asynchronous Unison

Swan Dubois, Maria Gradinariu Potop-Butucaru, Mikhail Nesterenko +1

We explore asynchronous unison in the presence of systemic transient and permanent Byzantine faults in shared memory. We observe that the problem is not solvable under less than st…

cs.DM2009

On the Minimum Size of a Contraction-Universal Tree

Olivier Bodini

A tree T_uni is m-universal for the class of trees if for every tree T of size m, T can be obtained from T_uni by successive contractions of edges. We prove that a m-universal tree…

cs.DM2009

Optimal Partial Tiling of Manhattan Polyominoes

Olivier Bodini, Jérémie Lumbroso

Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi…

cs.DM2009

Boltzmann Samplers for v-balanced Colored Necklaces

Olivier Bodini, Alice Jacquot

This paper is devoted to the random generation of particular colored necklaces for which the number of beads of a given color is constrained (these necklaces are called v-balanced)…

cs.DM2009★ 5 cited

Boltzmann Samplers for Colored Combinatorial Objects

Olivier Bodini, Alice Jacquot

In this paper, we give a general framework for the Boltzmann generation of colored objects belonging to combinatorial constructible classes. We propose an intuitive notion called p…

cs.DM2009★ 4 cited

Distances on Rhombus Tilings

Olivier Bodini, Thomas Fernique, Michael Rao +1

The rhombus tilings of a simply connected domain of the Euclidean plane are known to form a flip-connected space (a flip is the elementary operation on rhombus tilings which rotate…