| 2009 |
|---|
| 20 | EE | Pascal Mérindol,
Jean-Jacques Pansiot,
Stéphane Cateloin:
The mdt algorithm
CoRR abs/0904.0217: (2009) |
| 2007 |
|---|
| 19 | EE | Pascal Mérindol,
Jean-Jacques Pansiot,
Stéphane Cateloin:
Path Computation for Incoming Interface Multipath Routing.
ECUMN 2007: 75-85 |
| 2002 |
|---|
| 18 | EE | Damien Magoni,
Jean-Jacques Pansiot:
Network Layer Search Service Using Oriented Multicasting.
INFOCOM 2002 |
| 17 | EE | Damien Magoni,
Jean-Jacques Pansiot:
Internet topology modeler based on map sampling.
ISCC 2002: 1021-1027 |
| 16 | EE | Damien Magoni,
Jean-Jacques Pansiot:
Analysis and Comparison of Internet Topology Generators.
NETWORKING 2002: 364-375 |
| 2001 |
|---|
| 15 | EE | Damien Magoni,
Jean-Jacques Pansiot:
Influence of Network Topology on Protocol Simulation.
ICN (1) 2001: 762-770 |
| 14 | EE | Damien Magoni,
Jean-Jacques Pansiot:
Oriented multicast routing algorithm applied to network-level agent search.
Discrete Mathematics & Theoretical Computer Science 4(2): 255-272 (2001) |
| 2000 |
|---|
| 13 | EE | Mouhamadou Lamine Diagne,
Thomas Noël,
Jean-Jacques Pansiot:
Active Networks for IPv6 Communication Redirection.
MATA 2000: 139-150 |
| 1986 |
|---|
| 12 | | Jean-Jacques Pansiot:
Decidability of Periodicity for Infinite Words.
ITA 20(1): 43-46 (1986) |
| 1985 |
|---|
| 11 | | Jean-Jacques Pansiot:
Subword complexities and iteration.
Bulletin of the EATCS 26: 55-62 (1985) |
| 1984 |
|---|
| 10 | | Jean-Jacques Pansiot:
On various classes of infinite words obtained by iterated mappings.
Automata on Infinite Words 1984: 188-197 |
| 9 | | Jean-Jacques Pansiot:
Complexité des Facteurs des Mots Infinis Engendrés par Morphimes Itérés.
ICALP 1984: 380-389 |
| 8 | | Jean-Jacques Pansiot:
Bornes inferieures sur la complexite des facteurs des mots infinis engendres par morphimes iteres.
STACS 1984: 230-240 |
| 1983 |
|---|
| 7 | | Jean-Jacques Pansiot:
A Propos d'une Conjecture de F. Dejean sur les Répétitions dans les Mots.
ICALP 1983: 585-596 |
| 6 | | Jean-Jacques Pansiot:
Hiérarchie et fermeture de certaines classes de tag-systèmes.
Acta Inf. 20: 179-196 (1983) |
| 5 | | Jean-Jacques Pansiot:
Mots Infinis de Fibonacci et Morphismes Itérés.
ITA 17(2): 131-135 (1983) |
| 1981 |
|---|
| 4 | | Jean-Jacques Pansiot:
A Decidable Property of Iterated Morphisms.
Theoretical Computer Science 1981: 152-158 |
| 3 | | Jean-Jacques Pansiot:
The Morse Sequence and Iterated Morphisms.
Inf. Process. Lett. 12(2): 68-70 (1981) |
| 2 | | Jean-Jacques Pansiot:
A Note on Post's Correspondence Problem.
Inf. Process. Lett. 12(5): 233 (1981) |
| 1979 |
|---|
| 1 | | John E. Hopcroft,
Jean-Jacques Pansiot:
On the Reachability Problem for 5-Dimensional Vector Addition Systems.
Theor. Comput. Sci. 8: 135-159 (1979) |
