Publications of year 1989

BACK TO COATI PUBLICATION INDEX

Publications of year 1989

Articles in journal or book's chapters
  1. J-C. Bermond, K. Berrada, and J. Bond. Extensions of networks with given diameter. Discrete Math., 75(1-3):31--40, 1989.
    Note: Graph theory and combinatorics (In honor of P. Erdös' 75, Cambridge, 1988).
    @article{MR1001383,
    AUTHOR = {Bermond, J-C. and Berrada, K. and Bond, J.},
    TITLE = {Extensions of networks with given diameter},
    NOTE = {Graph theory and combinatorics (In honor of P. Erd\"os' 75, Cambridge, 1988)},
    JOURNAL = {Discrete Math.},
    VOLUME = {75},
    YEAR = {1989},
    NUMBER = {1-3},
    PAGES = {31--40},
    ISSN = {0012-365X},
    
    }
    

     
  2. J-C. Bermond, O. Favaron, and M. Mahéo. Hamiltonian decomposition of Cayley graphs of degree $4$. J. Combin. Theory Ser. B, 46(2):142--153, 1989.
    @article{MR992988,
    AUTHOR = {Bermond, J-C. and Favaron, O. and Mah{\'e}o, M.},
    TITLE = {Hamiltonian decomposition of {C}ayley graphs of degree {$4$}},
    JOURNAL = {J. Combin. Theory Ser. B},
    VOLUME = {46},
    YEAR = {1989},
    NUMBER = {2},
    PAGES = {142--153},
    ISSN = {0095-8956},
    
    }
    

     
  3. J-C. Bermond and J.-M. Fourneau. Independent connections: an easy characterization of baseline-equivalent multistage interconnection networks. Theoret. Comput. Sci., 64(2):191--201, 1989.
    @article{MR1000955,
    AUTHOR = {Bermond, J-C. and Fourneau, J.-M.},
    TITLE = {Independent connections: an easy characterization of baseline-equivalent multistage interconnection networks},
    JOURNAL = {Theoret. Comput. Sci.},
    VOLUME = {64},
    YEAR = {1989},
    NUMBER = {2},
    PAGES = {191--201},
    ISSN = {0304-3975},
    
    }
    

     
  4. J-C. Bermond, N. Homobono, and C. Peyrat. Large fault-tolerant interconnection networks. Graphs Combin., 5(2):107--123, 1989.
    @article{MR998267,
    AUTHOR = {Bermond, J-C. and Homobono, N. and Peyrat, C.},
    TITLE = {Large fault-tolerant interconnection networks},
    JOURNAL = {Graphs Combin.},
    VOLUME = {5},
    YEAR = {1989},
    NUMBER = {2},
    PAGES = {107--123},
    ISSN = {0911-0119},
    
    }
    

     
  5. J-C. Bermond and C. Peyrat. Induced subgraphs of the power of a cycle. SIAM J. Discrete Math., 2(4):452--455, 1989.
    @article{BePe89b,
    AUTHOR = {Bermond, J-C. and Peyrat, C.},
    TITLE = {Induced subgraphs of the power of a cycle},
    JOURNAL = {SIAM J. Discrete Math.},
    VOLUME = {2},
    YEAR = {1989},
    NUMBER = {4},
    PAGES = {452--455},
    ISSN = {0895-4801},
    
    }
    

     
  6. M. Cosnard, J. Duprat, and A. Ferreira. Complexity of selection in X+Y. Theoretical Computer Science, 67:115--120, 1989.
    @ARTICLE{CDF89,
    AUTHOR = {M. Cosnard and J. Duprat and A. Ferreira},
    JOURNAL = {Theoretical Computer Science},
    KEY = {j-journal},
    PAGES = {115--120},
    TITLE = {{{Complexity of selection in {X+Y}}}},
    VOLUME = {67},
    YEAR = {1989},
    
    }
    

     
  7. M. Cosnard and A. Ferreira. Generating Permutations on a VLSI Suitable Linear Network. The Computer Journal, 32(6):571--573, 1989.
    @ARTICLE{CoFe89,
    AUTHOR = {M. Cosnard and A. Ferreira},
    JOURNAL = {The Computer Journal},
    KEY = {j-journal},
    NUMBER = {6},
    PAGES = {571--573},
    TITLE = {{Generating Permutations on a {VLSI} Suitable Linear Network}},
    VOLUME = {32},
    YEAR = {1989},
    
    }
    

     
  8. C. T. Hoàng and B. A. Reed. $P\sb 4$-comparability graphs. Discrete Math., 74(1-2):173--200, 1989.
    Note: Graph colouring and variations.
    @article {MR989133,
    AUTHOR = {Ho{\`a}ng, C. T. and Reed, B. A.},
    TITLE = {{$P\sb 4$}-comparability graphs},
    NOTE = {Graph colouring and variations},
    JOURNAL = {Discrete Math.},
    VOLUME = {74},
    YEAR = {1989},
    NUMBER = {1-2},
    PAGES = {173--200},
    
    }
    

     
  9. C. T. Hoàng and B. A. Reed. Some classes of perfectly orderable graphs. J. Graph Theory, 13(4):445--463, 1989.
    @article {MR1010579,
    AUTHOR = {Ho{\`a}ng, C. T. and Reed, B. A.},
    TITLE = {Some classes of perfectly orderable graphs},
    JOURNAL = {J. Graph Theory},
    VOLUME = {13},
    YEAR = {1989},
    NUMBER = {4},
    PAGES = {445--463},
    
    }
    

     
  10. C. J. H. McDiarmid and B. A. Reed. Building heaps fast. J. Algorithms, 10(3):352--365, 1989.
    @article {MR1006990,
    AUTHOR = {McDiarmid, C. J. H. and Reed, B. A.},
    TITLE = {Building heaps fast},
    JOURNAL = {J. Algorithms},
    VOLUME = {10},
    YEAR = {1989},
    NUMBER = {3},
    PAGES = {352--365},
    
    }
    

     
Conference's articles
  1. J-C. Bermond, G. Illiades, and C. Peyrat. An optimization problem in distributed loop computer networks. In Combinatorial Mathematics: Proceedings of the Third International Conference (New York, 1985), volume 555 of Ann. New York Acad. Sci., New York, pages 45--55, 1989. New York Acad. Sci..
    @inproceedings{MR1018608,
    AUTHOR = {Bermond, J-C. and Illiades, G. and Peyrat, C.},
    TITLE = {An optimization problem in distributed loop computer networks},
    BOOKTITLE = {Combinatorial Mathematics: Proceedings of the Third International Conference (New York, 1985)},
    SERIES = {Ann. New York Acad. Sci.},
    VOLUME = {555},
    PAGES = {45--55},
    PUBLISHER = {New York Acad. Sci.},
    ADDRESS = {New York},
    YEAR = {1989},
    
    }
    

     
  2. J-C. Bermond and J-C. Konig. General and efficient decentralized consensus protocols II. In Proc. of the International Workshop on Parallel and distributed algorithms, Bonas, France, pages 199--210, 1989. North-Holland.
    @inproceedings{BeKo89,
    author = {Bermond, J-C. and Konig, J-C.},
    title = {General and efficient decentralized consensus protocols II},
    booktitle = {Proc. of the International Workshop on Parallel and distributed algorithms, Bonas, France},
    year = {1989},
    publisher = {North-Holland},
    pages = {199--210},
    
    }
    

     
  3. J-C. Bermond and C. Peyrat. De Bruijn and Kautz networks: a competitor for the hypercube?. In F. André and J-P. Verjus, editors, Proceedings of the 1st European Workshop on Hypercubes and Distributed Computers, Rennes, pages 279--293, 1989. North Holland.
    @InProceedings{BePe89,
    Author={Bermond, J-C. and Peyrat, C.},
    Title={De {B}ruijn and {K}autz networks: a competitor for the hypercube?},
    BookTitle={Proceedings of the 1st European Workshop on Hypercubes and Distributed Computers, Rennes},
    Year={1989},
    Pages={279--293},
    Editor={F. Andr\'e and J-P. Verjus},
    Publisher={North Holland},
    
    }
    

     
  4. M. Cosnard and A. Ferreira. Parallel algorithms for searching in X+Y. In F.Ris and P.M.Kogge, editors, Proceedings of the International Conference on Parallel Processing -- ICPP'89, volume 3, pages 16--19, 1989. Penn State University Press.
    @INPROCEEDINGS{CoFe89b,
    AUTHOR = {M. Cosnard and A. Ferreira},
    BOOKTITLE = {Proceedings of the International Conference on Parallel Processing -- ICPP'89},
    EDITOR = {F.Ris and P.M.Kogge},
    KEY = {p-congint},
    PAGES = {16--19},
    PUBLISHER = {Penn State University Press},
    TITLE = {{Parallel algorithms for searching in {X+Y}}},
    VOLUME = {3},
    YEAR = {1989},
    
    }
    

     
  5. F. Dehne, A. Ferreira, and A. Rau-Chaplin. Parallel branch and bound on fine grained hypercube multiprocessors. In Proceedings of the IEEE Workshop on Tools for AI, Herndon, VA (USA), pages 616--622, 1989. IEEE Press.
    @INPROCEEDINGS{DFR89,
    AUTHOR = {F. Dehne and A. Ferreira and A. Rau-Chaplin},
    ADDRESS = {Herndon, VA (USA)},
    BOOKTITLE = {Proceedings of the IEEE Workshop on Tools for AI},
    KEY = {p-congint},
    PAGES = {616--622},
    PUBLISHER = {IEEE Press},
    TITLE = {{{Parallel branch and bound on fine grained hypercube multiprocessors}}},
    YEAR = {1989},
    
    }
    

     
  6. F. Dehne, A. Ferreira, and A. Rau-Chaplin. Parallel fractional cascading on a hypercube multiprocessor. In Proceedings of the 27th Annual Allerton Conference on Communication, Control and Computing, pages 1084--1093, October 1989.
    @INPROCEEDINGS{DFR89b,
    AUTHOR = {F. Dehne and A. Ferreira and A. Rau-Chaplin},
    BOOKTITLE = {Proceedings of the 27th Annual Allerton Conference on Communication, Control and Computing},
    KEY = {p-congint},
    MONTH = {October},
    PAGES = {1084--1093},
    TITLE = {{{Parallel fractional cascading on a hypercube multiprocessor}}},
    YEAR = {1989},
    
    }
    

     
  7. A. Ferreira and M. Gastaldo. Implementing sorting on a hypercube. In F. André et J.-P. Verjus, editor, Hypercube and Distributed Computers, pages 359--360, 1989. INRIA-North-Holland.
    @INPROCEEDINGS{FeGa89,
    AUTHOR = {A. Ferreira and M. Gastaldo},
    BOOKTITLE = {Hypercube and Distributed Computers},
    EDITOR = {F. Andr\'e et J.-P. Verjus},
    KEY = {p-congint},
    PAGES = {359--360},
    PUBLISHER = {INRIA-North-Holland},
    TITLE = {{{Implementing sorting on a hypercube}}},
    YEAR = {1989},
    
    }
    

     
  8. A. Ferreira. The Knapsack Problem on Parallel Architectures. In M. Cosnard et al., editor, Parallel and Distributed Algorithms, pages 145--152, 1989. North-Holland.
    @INPROCEEDINGS{Fer89,
    AUTHOR = {A. Ferreira},
    BOOKTITLE = {Parallel and Distributed Algorithms},
    EDITOR = {M. Cosnard et al.},
    KEY = {p-congint},
    PAGES = {145--152},
    PUBLISHER = {North-Holland},
    TITLE = {{The Knapsack Problem on Parallel Architectures}},
    YEAR = {1989},
    
    }
    

     
  9. Z. Liu and P. Mussi. Performance evaluation of a deadlock free protocol for blocking rings. In International Conference on Super Computing, June 1989.
    @inproceedings{LiMu89,
    author = {Z. Liu and P. Mussi},
    booktitle = {International Conference on Super Computing},
    location = {Heraklion, Greece},
    title = {Performance evaluation of a deadlock free protocol for blocking rings},
    year = {1989},
    month = {June} 
    }
    

     
Internal reports
  1. F. Baccelli, M. Badel, A. Jean-Marie, Z. Liu, and P. Mussi. Specifications for Synchronization Primitives in the QNET Tool. Technical report, INRIA Sophia Antipolis, 1989.
    @TECHREPORT{IMSE552,
    AUTHOR = "F. Baccelli and M. Badel and A. Jean-Marie and Z. Liu and P. Mussi",
    INSTITUTION = "INRIA Sophia Antipolis",
    TITLE = "Specifications for Synchronization Primitives in the QNET Tool",
    YEAR = "1989" 
    }
    

     
  2. A. Ferreira. An optimal ${O(n^2)}$ algorithm to fold special PLA's. Technical report, 1989.
    Note: (abstract).
    @TECHREPORT{plaabs:j,
    AUTHOR = {A. Ferreira},
    BOOKTITLE = {Advances in Optimization and Control},
    EDITOR = {H.A.Eiseltand G.Pederzoli},
    JOURNAL = {Zentralblatt f\"ur Mathematik},
    KEY = {x},
    NOTE = {(abstract)},
    PUBLISHER = {Springer-Verlag},
    SERIES = {Lecture Notes in Economics and Math. Systems},
    TITLE = {{An optimal ${O(n^2)}$ algorithm to fold special {PLA's}}},
    VOLUME = {655.90029},
    YEAR = {1989} 
    }
    

     
  3. P. Mussi and P. Nain. On New Product-Form Queueing Network Stations. Technical report, INRIA Sophia Antipolis, 1989.
    @TECHREPORT{IMSE556,
    AUTHOR = "P. Mussi and P. Nain",
    INSTITUTION = "INRIA Sophia Antipolis",
    TITLE = "On New Product-Form Queueing Network Stations",
    YEAR = "1989" 
    }
    

     
  4. P. Mussi and P. Nain. Description and Specifications for New Product-Form Queueing Network Stations. Technical report, INRIA Sophia Antipolis, 1989.
    @TECHREPORT{IMSE553,
    AUTHOR = "P. Mussi and P. Nain",
    INSTITUTION = "INRIA Sophia Antipolis",
    TITLE = "Description and Specifications for New Product-Form Queueing Network Stations",
    YEAR = "1989" 
    }
    

     

BACK TO COATI PUBLICATION INDEX



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