| 2008 |
|---|
| 27 | EE | Hervé Daudé,
Vlady Ravelomanana:
Random 2-XORSAT at the Satisfiability Threshold.
LATIN 2008: 12-23 |
| 2007 |
|---|
| 26 | EE | Anne-Elisabeth Baert,
Vlady Ravelomanana,
Loÿs Thimonier:
On the growth of components with non fixed excesses
CoRR abs/0706.1642: (2007) |
| 25 | EE | Vlady Ravelomanana:
Another Proof of Wright's Inequalities
CoRR abs/0706.1665: (2007) |
| 24 | EE | Jean Cardinal,
Vlady Ravelomanana,
Mario Valencia-Pabon:
Chromatic Edge Strength of Some Multigraphs
CoRR abs/0706.3848: (2007) |
| 23 | EE | Vlady Ravelomanana:
Optimal Initialization and Gossiping Algorithms for Random Radio Networks.
IEEE Trans. Parallel Distrib. Syst. 18(1): 17-28 (2007) |
| 22 | EE | Christian Lavault,
Jean-François Marckert,
Vlady Ravelomanana:
Quasi-optimal energy-efficient leader election algorithms in radio networks.
Inf. Comput. 205(5): 679-693 (2007) |
| 21 | EE | Vlady Ravelomanana:
Another proof of Wright's inequalities.
Inf. Process. Lett. 104(1): 36-39 (2007) |
| 2006 |
|---|
| 20 | EE | Vlady Ravelomanana,
Alphonse Laza Rijamamy:
Creation and Growth of Components in a Random Hypergraph Process.
COCOON 2006: 350-359 |
| 19 | EE | Vlady Ravelomanana:
The Average Size of Giant Components between the Double-Jump.
Algorithmica 46(3-4): 529-555 (2006) |
| 18 | EE | Christian Lavault,
Jean-François Marckert,
Vlady Ravelomanana:
A Quasi-Optimal Leader Election Algorithm in Radio Networks with Log-Logarithmic Awake Time Slots
CoRR abs/cs/0607028: (2006) |
| 17 | EE | Christian Lavault,
Jean-François Marckert,
Vlady Ravelomanana:
Quasi-Optimal Leader Election Algorithms in Radio Networks with Loglogarithmic Awake Time Slots
CoRR abs/cs/0607034: (2006) |
| 16 | EE | Vlady Ravelomanana:
The Average Size of Giant Components Between the Double-Jump
CoRR abs/cs/0607057: (2006) |
| 15 | EE | Vlady Ravelomanana,
Alphonse Laza Rijamamy:
Creation and Growth of Components in a Random Hypergraph Process
CoRR abs/cs/0607059: (2006) |
| 2005 |
|---|
| 14 | EE | Vlady Ravelomanana:
Randomized Initialization of a Wireless Multihop Network.
HICSS 2005 |
| 13 | EE | Vlady Ravelomanana:
Distributed k-Clustering Algorithms for Random Wireless Multihop Networks.
ICN (1) 2005: 109-116 |
| 2004 |
|---|
| 12 | EE | Fayçal Djerourou,
Christian Lavault,
Gabriel Antoine Louis Paillard,
Vlady Ravelomanana:
Assigning Codes in a Random Wireless Network.
ICT 2004: 348-353 |
| 11 | EE | Romain Mellier,
Jean Frédéric Myoupo,
Vlady Ravelomanana:
A Non-Token-Based-Distributed Mutual Exclusion Algorithm for Single-Hop Mobile Ad Hoc Networks.
MWCN 2004: 287-298 |
| 10 | EE | Vlady Ravelomanana:
Randomized Initialization of a Wireless Multihop Network
CoRR abs/cs/0412014: (2004) |
| 9 | EE | Vlady Ravelomanana:
Extremal Properties of Three Dimensional Sensor Networks with Applications
CoRR cs.DS/0411027: (2004) |
| 8 | EE | Vlady Ravelomanana,
Loÿs Thimonier:
Forbidden Subgraphs in Connected Graphs
CoRR cs.DS/0411093: (2004) |
| 7 | EE | Cyril Banderier,
Jean-Marie Le Bars,
Vlady Ravelomanana:
Generating Functions For Kernels of Digraphs (Enumeration & Asymptotics for Nim Games)
CoRR math.CO/0411138: (2004) |
| 6 | EE | Vlady Ravelomanana:
Extremal Properties of Three-Dimensional Sensor Networks with Applications.
IEEE Trans. Mob. Comput. 3(3): 246-257 (2004) |
| 5 | EE | Vlady Ravelomanana,
Loÿs Thimonier:
Forbidden subgraphs in connected graphs.
Theor. Comput. Sci. 314(1-2): 121-171 (2004) |
| 2003 |
|---|
| 4 | EE | Anne-Elisabeth Baert,
Vlady Ravelomanana,
Loÿs Thimonier:
On the growth of components with non-fixed excesses.
Discrete Applied Mathematics 130(3): 487-493 (2003) |
| 3 | EE | Jean Frédéric Myoupo,
Loÿs Thimonier,
Vlady Ravelomanana:
Average case analysis-based protocols to initialize packet radio networks.
Wireless Communications and Mobile Computing 3(4): 539-548 (2003) |
| 2000 |
|---|
| 2 | | Vlady Ravelomanana,
Loÿs Thimonier:
Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs.
LATIN 2000: 28-37 |
| 1 | EE | Vlady Ravelomanana,
Loÿs Thimonier:
Patchworks and metablocks enumeration.
Inf. Process. Lett. 73(3-4): 77-86 (2000) |
