32 citations
- Institut national de recherche en sciences et technologies du numériqueFR12 papers
- Geometric (India)IN3 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR3 papers
- Orange (France)FR3 papers
- Centre National de la Recherche ScientifiqueFR2 papers
- Institut de Recherche en Informatique et Systèmes AléatoiresFR2 papers
- Laboratoire de Mathématiques de VersaillesFR2 papers
- Laboratoire d'Informatique Algorithmique: Fondements et ApplicationsFR2 papers
- Nantes UniversitéFR2 papers
- Association for Symbolic LogicUS1 paper
- Ben-Gurion University of the NegevIL1 paper
- CEA Paris-SaclayFR1 paper
Showing 2011Show all
3 papers · 1 filter
math.CO2011★ 2 cited
5-choosability of graphs with 2 crossings
Victor Campos, Frédéric Havet
We show that every graph with two crossings is 5-choosable. We also prove that every graph which can be made planar by removing one edge is 5-choosable.
cs.NI2011
On Using Seeders for P2P Live Streaming
Fabien Mathieu
Seeders (peers that do not request anything but contribute to the system) are a powerful concept in peer-to-peer (P2P). They allow to leverage the capacities of a P2P system. While…
math.PR2011
Strong approximation of partial sums under dependence conditions with application to dynamical systems
Florence Merlevède, Emmanuel Rio
In this paper, we obtain precise rates of convergence in the strong invariance principle for stationary sequences of real-valued random variables satisfying weak dependence conditi…