Publications of year 1991

N. Alon, C. McDiarmid, and B. Reed. Acyclic coloring of graphs. Random Structures Algorithms, 2(3):277--288, 1991.

@article {MR1109695,
AUTHOR = {Alon, N. and McDiarmid, C. and Reed, B.},
TITLE = {Acyclic coloring of graphs},
JOURNAL = {Random Structures Algorithms},
VOLUME = {2},
YEAR = {1991},
NUMBER = {3},
PAGES = {277--288},

}

J-C. Bermond and J-C. Konig. Un protocole distribué pour la 2-connexité. TSI, 10(4):269--274, 1991.

@Article{BeKo91,
Author="J-C. Bermond and J-C. Konig",
Title="Un protocole distribu\'e pour la 2-connexit\'e",
Journal="TSI",
Pages="269--274",
Year="1991",
Volume="10",
Number="4",

}

J-C. Bermond and D. Tzvieli. Minimal diameter double loop networks, part II: dense optimal families. Networks, 21:1--9, 1991.

@Article{BeTz91,
Author="J-C. Bermond and D. Tzvieli",
Title="Minimal diameter double loop networks, part {II}: dense optimal families",
Journal="Networks",
Year="1991",
Volume="21",
Pages="1--9" 
}

M. Cosnard and A. Ferreira. On the real power of loosely coupled parallel architectures. Parallel Processing Letters, 1(2):103--111, 1991.

@ARTICLE{CoFe91,
AUTHOR = {M. Cosnard and A. Ferreira},
JOURNAL = {Parallel Processing Letters},
KEY = {j-journal},
NUMBER = {2},
PAGES = {103--111},
TITLE = {{On the real power of loosely coupled parallel architectures}},
VOLUME = {1},
YEAR = {1991},

}

A. Ferreira. A parallel time/hardware tradeoff $T.H = O(2^{n/2})$ for the knapsack problem. IEEE Transactions on Computers, 40(2):221--225, 1991.

@ARTICLE{Fer91,
AUTHOR = {A. Ferreira},
JOURNAL = {IEEE Transactions on Computers},
KEY = {j-journal},
NUMBER = {2},
PAGES = {221--225},
TITLE = {{A parallel time/hardware tradeoff {$T.H = O(2^{n/2})$} for the knapsack problem}},
VOLUME = {40},
YEAR = {1991},

}

Conference's articles

M. Cosnard and A. Ferreira. A tight bound for selection in X+Y. In F. Dehne et al., editor, Advances in Computing and Information - ICCI '91, volume 497 of Lecture Notes in Computer Science, pages 134--138, 1991. Springer-Verlag.

@INPROCEEDINGS{CoFe91b,
AUTHOR = {M. Cosnard and A. Ferreira},
BOOKTITLE = {Advances in Computing and Information - ICCI '91},
EDITOR = {F. Dehne et al.},
KEY = {p-congint},
PAGES = {134--138},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
TITLE = {{A tight bound for selection in {X+Y}}},
VOLUME = {497},
YEAR = {1991},

}

F. Dehne, A. Ferreira, and A. Rau-Chaplin. Efficient parallel construction and manipulation of pointer based quadtrees. In Proceedings of the International Conference on Parallel Processing -- ICPP'91, St. Charles (USA), pages 255--262, 1991.

@INPROCEEDINGS{DFR91,
AUTHOR = {F. Dehne and A. Ferreira and A. Rau-Chaplin},
ADDRESS = {St. Charles (USA)},
BOOKTITLE = {Proceedings of the International Conference on Parallel Processing -- ICPP'91},
KEY = {p-congint},
PAGES = {255--262},
TITLE = {{Efficient parallel construction and manipulation of pointer based quadtrees}},
YEAR = {1991},

}

A. Ferreira and J. Peters. Finding the smallest path in a rectilinear polygon on a hypercube multiprocessor. In Proceedings of the Third Canadian Conference on Computational Geometry -- CCCG'91, Vancouver (Ca), pages 162--165, 1991.

@INPROCEEDINGS{FePe91,
AUTHOR = {A. Ferreira and J. Peters},
ADDRESS = {Vancouver (Ca)},
BOOKTITLE = {Proceedings of the Third Canadian Conference on Computational Geometry -- CCCG'91},
PAGES = {162--165},
TITLE = {{Finding the smallest path in a rectilinear polygon on a hypercube multiprocessor}},
YEAR = {1991},

}

Internal reports

P. Mussi and H. Rakotoarisoa. PARallélisation sur réseaux de Transputers de Simulations pour l'EVALuation de performances. Rapport technique 131, INRIA Sophia Antipolis, Septembre 1991.

@TECHREPORT { MuRa91,
AUTHOR = "P. Mussi and H. Rakotoarisoa",
INSTITUTION = "INRIA Sophia Antipolis",
MONTH = "Septembre",
NUMBER = "131",
TITLE = "PARall\'elisation sur r\'eseaux de Transputers de Simulations pour l'EVALuation de performances",
TYPE = "Rapport technique",
YEAR = "1991" 
}

BACK TO COATI PUBLICATION INDEX

Last modified: Sat Jan 29 19:00:42 2022