Publications of year 1998

BACK TO COATI PUBLICATION INDEX

Publications of year 1998

Books and proceedings
  1. A. Ferreira and J. Rolim, editors. Journal of Parallel and Distributed Computing -- Special Issue on Irregular Problems, volume 50. Academic Press, April 1998.
    @BOOK{FeRo98,
    EDITOR = {A. Ferreira and J. Rolim},
    KEY = {e-editor},
    MONTH = apr,
    NUMBER = {1/2},
    PUBLISHER = {Academic Press},
    TITLE = {{Journal of Parallel and Distributed Computing -- Special Issue on Irregular Problems}},
    VOLUME = {50},
    YEAR = {1998},
    
    }
    

     
  2. A. Ferreira, J. Rolim, H. Simon, and S. Teng, editors. Solving Irregularly Structured Problems in Parallel -- Irregular'98, volume 1457 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
    @BOOK{FRST98,
    EDITOR = {A. Ferreira and J. Rolim and H. Simon and S. Teng},
    KEY = {b-edition},
    PUBLISHER = {Springer-Verlag},
    SERIES = {Lecture Notes in Computer Science},
    TITLE = {{Solving Irregularly Structured Problems in Parallel -- Irregular'98}},
    VOLUME = {1457},
    YEAR = {1998},
    
    }
    

     
  3. P. Berthomé and A. Ferreira, editors. Optical Interconnects and Parallel Processing: Trends at the Interface. Kluwer Academic Publisher, Boston (USA), 1998.
    @BOOK{BeFe98,
    ADDRESS = {Boston (USA)},
    EDITOR = {P. Berthom\'e and A. Ferreira},
    KEY = {b-edition},
    PUBLISHER = {Kluwer Academic Publisher},
    TITLE = {{Optical Interconnects and Parallel Processing: Trends at the Interface}},
    YEAR = {1998},
    
    }
    

     
  4. M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, editors. Probabilistic methods for algorithmic discrete mathematics, volume 16 of Algorithms and Combinatorics. Springer-Verlag, Berlin, 1998.
    @book {MR1678554,
    TITLE = {Probabilistic methods for algorithmic discrete mathematics},
    SERIES = {Algorithms and Combinatorics},
    VOLUME = {16},
    EDITOR = {Habib, M. and McDiarmid, C. and Ramirez-Alfonsin, J. and Reed, B.},
    PUBLISHER = {Springer-Verlag},
    ADDRESS = {Berlin},
    YEAR = {1998},
    PAGES = {xviii+323},
    
    }
    

     
Articles in journal or book's chapters
  1. R. Corrêa, A. Ferreira, and S. Porto. Selected Algorithmic Techniques for Parallel Optimization. In D. Du and P. Pardalos, editors,Handbook of Combinatorial Optimization, volume 3, pages 407-456. Kluwer Academic Publisher, Boston (USA), 1998.
    @INCOLLECTION{CFP98,
    AUTHOR = {R. Corr\^ea and A. Ferreira and S. Porto},
    BOOKTITLE = {Handbook of Combinatorial Optimization},
    EDITOR = {D. Du and P. Pardalos},
    KEY = {bc-chapter},
    PAGES = {407-456},
    PUBLISHER = {Kluwer Academic Publisher, Boston (USA)},
    TITLE = {{Selected Algorithmic Techniques for Parallel Optimization}},
    VOLUME = {3},
    YEAR = {1998},
    
    }
    

     
  2. A. Ferreira. Towards effective models for OPS--based lightwave networks. In P. Berthomé and A. Ferreira, editors,Optical Interconnects and Parallel Processing: Trends at the Interface, pages 209-233. Kluwer Academic Publisher, Boston (USA), 1998.
    @INCOLLECTION{Fer98,
    AUTHOR = {A. Ferreira},
    ADDRESS = {Boston (USA)},
    BOOKTITLE = {Optical Interconnects and Parallel Processing: Trends at the Interface},
    EDITOR = {P. Berthom\'e and A. Ferreira},
    KEY = {bc-chapter},
    PAGES = {209-233},
    PUBLISHER = {Kluwer Academic Publisher},
    TITLE = {{{Towards effective models for OPS--based lightwave networks}}},
    YEAR = {1998},
    
    }
    

     
  3. A. Ferreira and I. Guérin-Lassous. Algorithmique discrète parallèle : le chaînon manquant. In J.-F. Myoupo, editor,Parallélisme et Répartitions, chapter II, pages 23-47. Hermes, Paris (F), 1998.
    @INCOLLECTION{FeGu98,
    AUTHOR = {A. Ferreira and I. Gu\'erin-Lassous},
    ADDRESS = {Paris (F)},
    BOOKTITLE = {Parall\'elisme et R\'epartitions},
    CHAPTER = {II},
    EDITOR = {J.-F. Myoupo},
    KEY = {bc-chapter},
    PAGES = {23-47},
    PUBLISHER = {Hermes},
    TITLE = {{Algorithmique discr\`ete parall\`ele : le cha\^inon manquant}},
    YEAR = {1998},
    
    }
    

     
  4. A. M. Frieze and B. Reed. Probabilistic analysis of algorithms. In Probabilistic methods for algorithmic discrete mathematics, volume 16 of Algorithms Combin., pages 36--92. Springer, Berlin, 1998.
    @incollection {MR1678562,
    AUTHOR = {Frieze, A. M. and Reed, B.},
    TITLE = {Probabilistic analysis of algorithms},
    BOOKTITLE = {Probabilistic methods for algorithmic discrete mathematics},
    SERIES = {Algorithms Combin.},
    VOLUME = {16},
    PAGES = {36--92},
    PUBLISHER = {Springer},
    ADDRESS = {Berlin},
    YEAR = {1998},
    
    }
    

     
  5. B. Beauquier, P. Hell, and S. Pérennes. Optimal Wavelength-routed Multicasting. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, 84(1-3), May 1998. [WWW ]
    @article{BHP98,
    author= { B. Beauquier and P. Hell and S. P\'erennes },
    title= { Optimal Wavelength-routed Multicasting },
    journal= { DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science },
    year= { 1998 },
    volume= { 84 },
    number = {1-3},
    month = may,
    url= { citeseer.nj.nec.com/312543.shtml },
    
    }
    

     
  6. J-C. Bermond, E. Darrot, O. Delmas, and S. Pérennes. Hamilton circuits in the directed wrapped butterfly network. Discrete Applied Mathematics, 84(1-3):21-42, 1998. [PDF ]
    @article{BDDP98,
    author= { J-C. Bermond and E. Darrot and O. Delmas and S. P\'erennes },
    title= { Hamilton circuits in the directed wrapped butterfly network },
    year= { 1998 },
    journal= { Discrete Applied Mathematics },
    volume= { 84 },
    number= { 1-3 },
    pages= { 21-42 },
    pdf= { ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BDDP98b.pdf },
    
    }
    

     
  7. J-C. Bermond, E. Darrot, O. Delmas, and S. Pérennes. Hamilton cycle decomposition of the butterfly networks. Parallel Processing Letters, 8(3):371-385, 1998. [PDF ]
    @article{BDDP98a,
    author= { J-C. Bermond and E. Darrot and O. Delmas and S. P\'erennes },
    title= { Hamilton cycle decomposition of the butterfly networks },
    journal= { Parallel Processing Letters },
    year= { 1998 },
    volume= { 8 },
    number= { 3 },
    pages= { 371-385 },
    pdf= { ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BDDP98a.pdf },
    
    }
    

     
  8. J-C. Bermond, L. Gargano, and S. Pérennes. Optimal sequential gossiping by short messages. Discrete Applied Mathematics, 86(2-3):145-155, 1998. [PDF ]
    @article{BGP98,
    author= { J-C. Bermond and L. Gargano and S. P\'erennes },
    title= { Optimal sequential gossiping by short messages },
    year= { 1998 },
    journal= { Discrete Applied Mathematics },
    volume= { 86 },
    number = {2-3},
    pages= { 145-155 },
    pdf= { ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BGP98.pdf },
    
    }
    

     
  9. J-C. Bermond, L. Gargano, A.A. Rescigno, and U. Vaccaro. Fast gossiping by short messages. SIAM Journal on Computing, 27(4):917-941, 1998. [PDF ]
    @Article{BGRV98,
    Author= {J-C. Bermond and L. Gargano and A.A. Rescigno and U. Vaccaro},
    Title= {Fast gossiping by short messages },
    Journal={SIAM Journal on Computing},
    Pages={917-941},
    Volume={27},
    Number= {4},
    Year={1998},
    PDF={ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BGRV98.pdf},
    
    }
    

     
  10. H. Bourdin, A. Ferreira, and K. Marcus. A performance comparison between graph and hypergraph topologies for passive star WDM lightwave networks. Computer Networks and ISDN Systems, 8(30):805-819, May 1998.
    @ARTICLE{BFM98,
    AUTHOR = {H. Bourdin and A. Ferreira and K. Marcus},
    JOURNAL = {Computer Networks and ISDN Systems},
    KEY = {j-journal},
    MONTH = may,
    NUMBER = {30},
    PAGES = {805-819},
    TITLE = {{A performance comparison between graph and hypergraph topologies for passive star {WDM} lightwave networks}},
    VOLUME = {8},
    YEAR = {1998},
    
    }
    

     
  11. M. Molloy and B. Reed. The size of the giant component of a random graph with a given degree sequence. Combin. Probab. Comput., 7(3):295--305, 1998.
    @article {MR1664335,
    AUTHOR = {Molloy, M. and Reed, B.},
    TITLE = {The size of the giant component of a random graph with a given degree sequence},
    JOURNAL = {Combin. Probab. Comput.},
    VOLUME = {7},
    YEAR = {1998},
    NUMBER = {3},
    PAGES = {295--305},
    
    }
    

     
  12. M. Molloy and B. Reed. A bound on the total chromatic number. Combinatorica, 18(2):241--280, 1998.
    @article {MR1656544,
    AUTHOR = {Molloy, M. and Reed, B.},
    TITLE = {A bound on the total chromatic number},
    JOURNAL = {Combinatorica},
    VOLUME = {18},
    YEAR = {1998},
    NUMBER = {2},
    PAGES = {241--280},
    
    }
    

     
  13. S. Perennes. Broadcasting and gossiping on de Bruijn, shuffle exchange and similar networks.. Discrete Applied Mathematics, 83:247-262, 1998.
    @article{Per98,
    author = {S. Perennes},
    journal = { Discrete Applied Mathematics},
    volume = {83},
    title = {{Broadcasting and gossiping on de Bruijn, shuffle exchange and similar networks.}},
    pages = {247-262},
    year = 1998,
    key = {0106},
    
    }
    

     
  14. B. Reed. $\omega,\ \Delta$, and $\chi$. J. Graph Theory, 27(4):177--212, 1998.
    @article {MR1610746,
    AUTHOR = {Reed, B.},
    TITLE = {{$\omega,\ \Delta$}, and {$\chi$}},
    JOURNAL = {J. Graph Theory},
    VOLUME = {27},
    YEAR = {1998},
    NUMBER = {4},
    PAGES = {177--212},
    
    }
    

     
  15. B. Reed and P. Seymour. Fractional colouring and Hadwiger's conjecture. J. Combin. Theory Ser. B, 74(2):147--152, 1998.
    @article {MR1654153,
    AUTHOR = {Reed, B. and Seymour, P.},
    TITLE = {Fractional colouring and {H}adwiger's conjecture},
    JOURNAL = {J. Combin. Theory Ser. B},
    VOLUME = {74},
    YEAR = {1998},
    NUMBER = {2},
    PAGES = {147--152},
    
    }
    

     
Conference's articles
  1. J-C. Bermond, N. Marlin, D. Peleg, and S. Pérennes. Virtual path layouts in simple ATM networks. In Proc. Conference IFIP ATM '98,Ilkley,U.K.,Jul. 1998, 1998.
    @InProceedings{BMPP98b,
    Author= {J-C. Bermond and N. Marlin and D. Peleg and S. P\'erennes },
    Title= {Virtual path layouts in simple ATM networks},
    Year={1998},
    BookTitle={Proc. Conference IFIP ATM '98,Ilkley,U.K.,Jul. 1998},
    
    }
    

     
  2. J-C. Bermond, N. Marlin, D. Peleg, and S. Pérennes. Directed virtual path layouts in ATM networks. In Proc. Conference DISC98, Andros, Greece,Sep. 1998 Lecture Notes in Computer Science, 1499, pages 75-i88. (Full version appeared in TCS), 1998. Springer Verlag.
    @InProceedings{BMPP98a,
    Author= {J-C. Bermond and N. Marlin and D. Peleg and S. P\'erennes },
    Title= {Directed virtual path layouts in {ATM} networks},
    Year={1998},
    BookTitle={Proc. Conference DISC98, Andros, Greece,Sep. 1998 Lecture Notes in Computer Science, 1499},
    Pages="75-i88. (Full version appeared in TCS)",
    Publisher={Springer Verlag},
    
    }
    

     
  3. Gruia Calinescu, Cristina G. Fernandes, and B. Reed. Multicuts in unweighted graphs with bounded degree and bounded tree-width. In Integer programming and combinatorial optimization (Houston, TX, 1998), volume 1412 of Lecture Notes in Comput. Sci., Berlin, pages 137--152, 1998. Springer.
    @inproceedings{MR1726341,
    AUTHOR = {C{\u{a}}linescu, Gruia and Fernandes, Cristina G. and Reed, B.},
    TITLE = {Multicuts in unweighted graphs with bounded degree and bounded tree-width},
    BOOKTITLE = {Integer programming and combinatorial optimization (Houston, TX, 1998)},
    SERIES = {Lecture Notes in Comput. Sci.},
    VOLUME = {1412},
    PAGES = {137--152},
    PUBLISHER = {Springer},
    ADDRESS = {Berlin},
    YEAR = {1998},
    
    }
    

     
  4. D. Coudert, A. Ferreira, and X. Muñoz. Multiprocessor Architectures Using Multi-hops Multi-OPS Lightwave Networks and Distributed Control. In IEEE International Parallel Processing Symposium, pages 151-155, 1998. IEEE Press. [PDF ] [POSTSCRIPT ]
    Abstract:
    In this paper we study the design of regular multicast networks implemented with Optical Passive Star (OPS) couplers. We focus on an architecture based on both Kautz graphs and stack-graphs, and show that it is very cost-effective with respect to its resources requirements, namely the number of OPS couplers, power budget, scalability and number of transceivers, and presents a large ratio number-of-nodes/diameter. The important issue of medium access control is also addressed and control protocols for accessing the optical couplers are given and analyzed. Finally, we show through simulation that these control protocols efficiently implement shortest path routing on these networks.

    @INPROCEEDINGS{CFM98,
    author = {D. Coudert and A. Ferreira and X. Muñoz},
    title = {{Multiprocessor Architectures Using Multi-hops Multi-OPS Lightwave Networks and Distributed Control}},
    booktitle = {IEEE International Parallel Processing Symposium},
    year = {1998},
    pages = {151-155},
    publisher = {IEEE Press},
    abstract = { In this paper we study the design of regular multicast networks implemented with Optical Passive Star (OPS) couplers. We focus on an architecture based on both Kautz graphs and stack-graphs, and show that it is very cost-effective with respect to its resources requirements, namely the number of OPS couplers, power budget, scalability and number of transceivers, and presents a large ratio number-of-nodes/diameter. The important issue of medium access control is also addressed and control protocols for accessing the optical couplers are given and analyzed. Finally, we show through simulation that these control protocols efficiently implement shortest path routing on these networks.},
    pdf = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFM-IPPS98.pdf},
    postscript = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFM-IPPS98.ps.gz} 
    }
    

     
  5. O. Dalle. MPCFS : un système de fichiers virtuel pour communications multipoints fiables entre systèmes UNIX. In Deuxièmes Journées Doctorales Informatique et Réseaux (JDIR'98), Paris, Avril 1998.
    @inproceedings{Dal98a,
    author = {Dalle, O.},
    title = {{MPCFS}~: un syst\`eme de fichiers virtuel pour communications multipoints fiables entre syst\`emes {UNIX}},
    booktitle = {Deuxi\`emes {J}ourn\'ees {D}octorales {I}nformatique et {R}\'eseaux ({JDIR}'98)},
    month = {Avril},
    year = 1998,
    address = {Paris} 
    }
    

     
  6. O. Dalle. MPCFS : un exemple d'intégration transparente de mécanismes de communication multipoints dans les systèmes UNIX. In Dominique Méry and Guy-René Perrin, editors, 10$^e$ Rencontres Francophones du Parallélisme (RENPAR'10), Strasbourg, Juin 1998.
    @inproceedings{Dal98b,
    author = {Dalle, O.},
    title = {{MPCFS}~: un exemple d'int{\'e}gration transparente de m\'ecanismes de communication multipoints dans les syst{\`e}mes {UNIX}},
    booktitle = {10$^e$ Rencontres Francophones du Parall{\'e}lisme ({RENPAR}'10)},
    editor = {M{\'e}ry, Dominique and Perrin, Guy-Ren{\'e}},
    month = {Juin},
    year = {1998},
    address = {Strasbourg} 
    }
    

     
  7. P. Di Gianantonio, F. Honsell, and L. Liquori. A Lambda Calculus of Objects with Self-inflicted Extension. In Proc. of ACM-SIGPLAN OOPSLA, International Symposium on Object Oriented, Programming, System, Languages and Applications, pages 166--178, 1998. The ACM Press. [POSTSCRIPT ]
    @InProceedings{DHL98,
    author = {P. {Di~G}ianantonio and F. Honsell and L. Liquori},
    title = {A {L}ambda {C}alculus of {O}bjects with {S}elf-inflicted {E}xtension},
    booktitle = {Proc. of ACM-SIGPLAN OOPSLA, International Symposium on Object Oriented, Programming, System, Languages and Applications},
    publisher = {The ACM Press},
    pages = {166--178},
    year = "1998",
    POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/oopsla-98.ps.gz},
    
    }
    

     
  8. M. Diallo, A. Ferreira, and A. Rau-Chaplin. Communication-efficient deterministic parallel algorithms for planar point location and 2d Voronoi diagram. In Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science -- STACS'98, volume 1373 of Lecture Notes in Computer Science, Paris, France, pages 399--409, February 1998. Springer Verlag.
    @INPROCEEDINGS{DFR98,
    AUTHOR = {M. Diallo and A. Ferreira and A. Rau-Chaplin},
    ADDRESS = {Paris, France},
    BOOKTITLE = {Proceedings of the {15th Symposium on Theoretical Aspects of Computer Science -- STACS'98}},
    KEY = {p-congint},
    MONTH = feb,
    PAGES = {399--409},
    PUBLISHER = {Springer Verlag},
    SERIES = {Lecture Notes in Computer Science},
    TITLE = {{Communication-efficient deterministic parallel algorithms for planar point location and 2d {Voronoi} diagram}},
    VOLUME = {1373},
    YEAR = {1998},
    
    }
    

     
  9. Hazel Everett, Sulamita Klein, and B. Reed. An optimal algorithm for finding clique-cross partitions. In Proceedings of the Twenty-ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1998), volume 135, pages 171--177, 1998.
    @inproceedings {MR1676561,
    AUTHOR = {Everett, Hazel and Klein, Sulamita and Reed, B.},
    TITLE = {An optimal algorithm for finding clique-cross partitions},
    BOOKTITLE = {Proceedings of the Twenty-ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1998)},
    JOURNAL = {Congr. Numer.},
    VOLUME = {135},
    YEAR = {1998},
    PAGES = {171--177},
    
    }
    

     
  10. A. Ferreira, I. Guérin-Lassous, K. Marcus, and A. Rau-Chaplin. Parallel Computation on Interval Graphs using PC clusters: Algorithms and Experiments. In D. Pritchard and J. Reeves, editors, Proceedings of Europar'98 (Distinguished Paper), volume 1470 of Lecture Notes in Computer Science, Southampton, UK, pages 875-886, September 1998. Springer Verlag.
    @INPROCEEDINGS{FGMR98,
    AUTHOR = {A. Ferreira and I. Gu\'erin-Lassous and K. Marcus and A. Rau-Chaplin},
    ADDRESS = {Southampton, UK},
    BOOKTITLE = {Proceedings of Europar'98 (Distinguished Paper)},
    EDITOR = {D. Pritchard and J. Reeves},
    KEY = {p-congint},
    MONTH = sep,
    PAGES = {875-886},
    PUBLISHER = {Springer Verlag},
    SERIES = {Lecture Notes in Computer Science},
    TITLE = {{Parallel Computation on Interval Graphs using PC clusters: Algorithms and Experiments}},
    VOLUME = {1470},
    YEAR = {1998},
    
    }
    

     
  11. L. Liquori. On Object Extension. In ECOOP, European Conference on Object Oriented Programming, volume 1445 of Lecture Notes in Computer Science, pages 498--552, 1998. Springer Verlag. [POSTSCRIPT ]
    @InProceedings{Liq98a,
    author = "Liquori, L.",
    title = "On {O}bject {E}xtension",
    booktitle = "ECOOP, European Conference on Object Oriented Programming",
    editor = "",
    pages = "498--552",
    volume = "1445",
    series = lncs,
    publisher = {Springer Verlag},
    month = "",
    year = "1998",
    POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/ecoop-98.ps.gz},
    
    }
    

     
  12. L. Liquori. Bounded Polymorphism for Extensible Objects. In Types, International Workshop on Types for Proof and Programs, volume 1657 of Lecture Notes in Computer Science, pages 149--163, 1998. Springer Verlag. [POSTSCRIPT ]
    @InProceedings{Liq98b,
    author = "Liquori, L.",
    title = "Bounded {P}olymorphism for {E}xtensible {O}bjects",
    booktitle = "Types, International Workshop on Types for Proof and Programs",
    editor = "",
    pages = "149--163",
    volume = "1657",
    series = lncs,
    publisher = {Springer Verlag},
    month = "",
    year = "1998",
    POSTSCRIPT= {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/types-98.ps.gz},
    
    }
    

     
  13. M. Molloy and B. Reed. Colouring graphs where chromatic number is almost their maximum degree. In LATIN'98: theoretical informatics (Campinas, 1998), volume 1380 of Lecture Notes in Comput. Sci., Berlin, pages 216--225, 1998. Springer.
    @inproceedings{MR1635533,
    AUTHOR = {Molloy, M. and Reed, B.},
    TITLE = {Colouring graphs where chromatic number is almost their maximum degree},
    BOOKTITLE = {LATIN'98: theoretical informatics (Campinas, 1998)},
    SERIES = {Lecture Notes in Comput. Sci.},
    VOLUME = {1380},
    PAGES = {216--225},
    PUBLISHER = {Springer},
    ADDRESS = {Berlin},
    YEAR = {1998},
    
    }
    

     
Internal reports
  1. D. Bacchiega, D. Gotta, L. Liquori, M. Porta, and M. Ramella Votta. Ipotesi Evolutive del Sistema MOMIX per la Specifica e Qualificazione di Sistemi TMN. Technical Report DTR 98.0089, CSELT, Centro Studi e Laboratori Telecomunicazioni, Telecom Italia Research Center, 1998.
    Note: Not available. In Italian.
    @TechReport{BG+98b,
    author = {D. Bacchiega and D. Gotta and L. Liquori and M. Porta and M. Ramella Votta},
    title = {{Ipotesi Evolutive del Sistema MOMIX per la Specifica e Qualificazione di Sistemi TMN}},
    institution = {CSELT, Centro Studi e Laboratori Telecomunicazioni, Telecom Italia Research Center},
    year = {1998},
    type = {Technical Report},
    number = {DTR 98.0089},
    note = {Not available. In Italian} 
    }
    

     
  2. T. Jiménez, P. Mussi, G. Siegel, and L. Villefranche. Parallel Architecture Issues. Technical report, Hipertrans Consortium, 1998.
    @TECHREPORT{JMSV98,
    AUTHOR = {T. Jim\'enez and P. Mussi and G. Siegel and L. Villefranche},
    INSTITUTION = {Hipertrans Consortium},
    TITLE = {Parallel Architecture Issues},
    YEAR = {1998} 
    }
    

     
  3. T. Jiménez, P. Mussi, G. Siegel, and L. Villefranche. Car Following Algorithms. Technical report, Hipertrans Consortium, 1998.
    @TECHREPORT{JMSV98,
    AUTHOR = {T. Jim\'enez and P. Mussi and G. Siegel and L. Villefranche},
    INSTITUTION = {Hipertrans Consortium},
    TITLE = {Car Following Algorithms},
    YEAR = {1998} 
    }
    

     
Miscellaneous
  1. A. Jarry. Théorie des graphes : chemins disjoints. Rapport de stage de magistère d'informatique, ENS Lyon, 1998.
    @MastersThesis{Jar99,
    author = {A. Jarry},
    title = {Th\'eorie des graphes : chemins disjoints},
    school = {ENS Lyon},
    year = {1998},
    type = {Rapport de stage de magist\`ere d'informatique},
    key={},
    
    }
    

     
  2. H. Rivano. Communication par constellations de satellites : reroutage pour les télécommunications mobiles. Rapport de stage de première année de Magistère d'Informatique et de Modélisation, ENS Lyon, 1998. [WWW ] [PDF ] [POSTSCRIPT ]
    @MASTERSTHESIS{Riv98,
    author = {H. Rivano},
    title = {Communication par constellations de satellites : reroutage pour les télécommunications mobiles},
    school = {ENS Lyon},
    year = {1998},
    type = {Rapport de stage de première année de Magistère d'Informatique et de Modélisation},
    pdf = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/riv98.pdf},
    postscript = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/riv98.ps.gz},
    url = {http://ensl.free.fr/rapports/} 
    }
    

     
  3. E. Darrot and B. Vaillant. Matrice de commutateurs à deux positions chacun. Demande de Brevet 98 15 397 déposée en France le 7 décembre 1998 au nom d'Alcatel, 1998.
    @Misc{DaVa98,
    Author = {Darrot, E. and Vaillant, B.},
    Title = {Matrice de commutateurs \`a deux positions chacun},
    HowPublished = {Demande de Brevet 98 15 397 d\'epos\'ee en France le 7 d\'ecembre 1998 au nom d'Alcatel},
    year={1998},
    
    }
    

     
  4. L. Liquori. An Introduction to SmallTalk. École Normale Supérieure de Lyon, 1998-1999.
    Note: Cours POOGL : Programmation à Objets et Génie Logiciel.
    @Misc{Smalltalk,
    author = {L. Liquori},
    title = {{An Introduction to SmallTalk}},
    howpublished = {\'Ecole Normale Sup\'erieure de Lyon},
    year = {1998-1999},
    note = {Cours {POOGL} : {P}rogrammation \`a {O}bjets et {G}\'enie {L}ogiciel}
    }
    

     

BACK TO COATI PUBLICATION INDEX



Last modified: Fri Oct 20 15:06:04 2017