Laboratoire d'Informatique de Paris-Nord

output

20032009

most citedMicroreboot -- A Technique for Cheap Recovery

369 citations

researchers with a paper here

G. Duchamp6 · h 21
K. Penson5 · h 26
A. Horzela2 profiles3 · h 15
P. Blasiak3 · h 17
A. Solomon2 · h 20
C. Tollu2 · h 12
Florin Pop2 profiles2 · h 30
Jean-Gabriel Luque2 profiles2 · h 15
M. Keynes2 · h 17
P. A. O. Sciences2 · h 24
Virgile Mogbil2 · h 6
V. Ravelomanana2 · h 10

collaborating institutions

Université Sorbonne Paris NordFR14 papers
Centre National de la Recherche ScientifiqueFR4 papers
Laboratoire de Physique Théorique de la Matière CondenséeFR4 papers
Université Paris CitéFR4 papers
Sorbonne UniversitéFR3 papers
Institute of Nuclear Physics, Polish Academy of SciencesPL2 papers
Laboratoire d'Informatique, du Traitement de l'Information et des SystèmesFR2 papers
Laboratoire d'Informatique Gaspard-MongeFR2 papers
The Open UniversityGB2 papers
Aix-Marseille UniversitéFR1 paper
American University of BeirutLB1 paper
California State University, Long BeachUS1 paper

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2007

Another Proof of Wright's Inequalities

Vlady Ravelomanana

We present a short way of proving the inequalities obtained by Wright in [Journal of Graph Theory, 4: 393 - 407 (1980)] concerning the number of connected graphs with $ℓ$ edges…

cs.DM2007

On the growth of components with non fixed excesses

Anne-Elisabeth Baert, Vlady Ravelomanana, Loÿs Thimonier

Denote by an $l$ -component a connected graph with $l$ edges more than vertices. We prove that the expected number of creations of $(l + 1)$ -component, by means of adding a new edge t…