
J.C. Bermond,
K. Berrada,
and J. Bond.
Extensions of networks with given diameter.
Discrete Math.,
75(13):3140,
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 = {13},
PAGES = {3140},
ISSN = {0012365X},
}

J.C. Bermond,
O. Favaron,
and M. Mahéo.
Hamiltonian decomposition of Cayley graphs of degree $4$.
J. Combin. Theory Ser. B,
46(2):142153,
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 = {142153},
ISSN = {00958956},
}

J.C. Bermond and J.M. Fourneau.
Independent connections: an easy characterization of baselineequivalent multistage interconnection networks.
Theoret. Comput. Sci.,
64(2):191201,
1989.
@article{MR1000955,
AUTHOR = {Bermond, J.C. and Fourneau, J.M.},
TITLE = {Independent connections: an easy characterization of baselineequivalent multistage interconnection networks},
JOURNAL = {Theoret. Comput. Sci.},
VOLUME = {64},
YEAR = {1989},
NUMBER = {2},
PAGES = {191201},
ISSN = {03043975},
}

J.C. Bermond,
N. Homobono,
and C. Peyrat.
Large faulttolerant interconnection networks.
Graphs Combin.,
5(2):107123,
1989.
@article{MR998267,
AUTHOR = {Bermond, J.C. and Homobono, N. and Peyrat, C.},
TITLE = {Large faulttolerant interconnection networks},
JOURNAL = {Graphs Combin.},
VOLUME = {5},
YEAR = {1989},
NUMBER = {2},
PAGES = {107123},
ISSN = {09110119},
}

J.C. Bermond and C. Peyrat.
Induced subgraphs of the power of a cycle.
SIAM J. Discrete Math.,
2(4):452455,
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 = {452455},
ISSN = {08954801},
}

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

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

C. T. Hoàng and B. A. Reed.
$P\sb 4$comparability graphs.
Discrete Math.,
74(12):173200,
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 = {12},
PAGES = {173200},
}

C. T. Hoàng and B. A. Reed.
Some classes of perfectly orderable graphs.
J. Graph Theory,
13(4):445463,
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 = {445463},
}

C. J. H. McDiarmid and B. A. Reed.
Building heaps fast.
J. Algorithms,
10(3):352365,
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 = {352365},
}

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 4555,
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 = {4555},
PUBLISHER = {New York Acad. Sci.},
ADDRESS = {New York},
YEAR = {1989},
}

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 199210,
1989.
NorthHolland.
@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 = {NorthHolland},
pages = {199210},
}

J.C. Bermond and C. Peyrat.
De Bruijn and Kautz networks: a competitor for the hypercube?.
In F. André and JP. Verjus, editors,
Proceedings of the 1st European Workshop on Hypercubes and Distributed Computers, Rennes,
pages 279293,
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={279293},
Editor={F. Andr\'e and JP. Verjus},
Publisher={North Holland},
}

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 1619,
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 = {pcongint},
PAGES = {1619},
PUBLISHER = {Penn State University Press},
TITLE = {{Parallel algorithms for searching in {X+Y}}},
VOLUME = {3},
YEAR = {1989},
}

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

F. Dehne,
A. Ferreira,
and A. RauChaplin.
Parallel fractional cascading on a hypercube multiprocessor.
In Proceedings of the 27th Annual Allerton Conference on Communication, Control and Computing,
pages 10841093,
October 1989.
@INPROCEEDINGS{DFR89b,
AUTHOR = {F. Dehne and A. Ferreira and A. RauChaplin},
BOOKTITLE = {Proceedings of the 27th Annual Allerton Conference on Communication, Control and Computing},
KEY = {pcongint},
MONTH = {October},
PAGES = {10841093},
TITLE = {{{Parallel fractional cascading on a hypercube multiprocessor}}},
YEAR = {1989},
}

A. Ferreira.
The Knapsack Problem on Parallel Architectures.
In M. Cosnard et al., editor,
Parallel and Distributed Algorithms,
pages 145152,
1989.
NorthHolland.
@INPROCEEDINGS{Fer89,
AUTHOR = {A. Ferreira},
BOOKTITLE = {Parallel and Distributed Algorithms},
EDITOR = {M. Cosnard et al.},
KEY = {pcongint},
PAGES = {145152},
PUBLISHER = {NorthHolland},
TITLE = {{The Knapsack Problem on Parallel Architectures}},
YEAR = {1989},
}

A. Ferreira and M. Gastaldo.
Implementing sorting on a hypercube.
In F. André et J.P. Verjus, editor,
Hypercube and Distributed Computers,
pages 359360,
1989.
INRIANorthHolland.
@INPROCEEDINGS{FeGa89,
AUTHOR = {A. Ferreira and M. Gastaldo},
BOOKTITLE = {Hypercube and Distributed Computers},
EDITOR = {F. Andr\'e et J.P. Verjus},
KEY = {pcongint},
PAGES = {359360},
PUBLISHER = {INRIANorthHolland},
TITLE = {{{Implementing sorting on a hypercube}}},
YEAR = {1989},
}

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}
}

F. Baccelli,
M. Badel,
A. JeanMarie,
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. JeanMarie and Z. Liu and P. Mussi",
INSTITUTION = "INRIA Sophia Antipolis",
TITLE = "Specifications for Synchronization Primitives in the QNET Tool",
YEAR = "1989"
}

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 = {SpringerVerlag},
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}
}

P. Mussi and P. Nain.
Description and Specifications for New ProductForm 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 ProductForm Queueing Network Stations",
YEAR = "1989"
}

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