Publications of year 1992

1. editor J.-C. Bermond. Interconnection Networks, volume 37,38. Discrete Applied Mathematics, 1992.
   Note: (also appeared in Topics in Discrete Mathematics, Vol 5,1992, North Holland) 582 pp. [bibtex-entry]

1. F. Dehne, A. Ferreira, and A. Rau-Chaplin. Algorithmique SIMD. In M.Cosnard, M.Nivat, and Y.Robert, editors,Algorithmique Parallèle, Etudes et Recherches en Informatique, pages 65--80. Masson, 1992. [bibtex-entry]


2. K. Kilakos and B. Reed. A semi-integral total colouring. In Sets, graphs and numbers (Budapest, 1991), volume 60 of Colloq. Math. Soc. János Bolyai, pages 429--438. North-Holland, Amsterdam, 1992. [bibtex-entry]


3. S. Akl, M. Cosnard, and A. Ferreira. Data-movement-intensive problems : two folk theorems in parallel computation revisited. Theoretical Computer Science, 95:323--337, 1992. [bibtex-entry]


4. N. Alon, C. McDiarmid, and B. Reed. Star arboricity. Combinatorica, 12(4):375--380, 1992. [bibtex-entry]


5. J.-C. Bermond, C. Delorme, and J-J. Quisquater. Table of large $({\Delta},D)$-graphs. Discrete Applied Mathematics, 37/38:575--577, 1992. [bibtex-entry]


6. J.-C. Bermond, P. Hell, A. L. Liestman, and J. G. Peters. Broadcasting in bounded degree graphs. SIAM Journal on Discrete Mathematics, 5(1):10--24, 1992. [PDF ] [bibtex-entry]


7. J.-C. Bermond, P. Hell, A. L. Liestman, and J. G. Peters. Sparse broadcast graphs. Discrete Applied Mathematics, 36:97--130, 1992. [bibtex-entry]


8. J.-C. Bermond, P. Hell, and J.-J. Quisquater. Construction of large packet radio networks. Parallel Processing Letters, 2(1):3-12, 1992. [PDF ] [bibtex-entry]


9. J.-C. Bermond, P. Michallon, and D. Trystram. Broadcasting in wraparound meshes with parallel monodirectional links. Parallel Computing, 18:639--648, 1992. [bibtex-entry]


10. F. Dehne, A. Ferreira, and A. Rau-Chaplin. Parallel fractional cascading on hypercube multiprocessors. Computational Geometry - Theory and Applications, 2:141--167, 1992. [bibtex-entry]


11. A. Ferreira and S.W. Song. Achieving optimality for gate matrix layout and PLA folding : a graph theoretic approach. Integration: the VLSI journal, 14:173--195, 1992. [bibtex-entry]


12. A. Frieze, C. McDiarmid, and B. Reed. On a conjecture of Bondy and Fan. Ars Combin., 33:329--336, 1992. [bibtex-entry]


13. B. Reed and C. McDiarmid. The strongly connected components of $1$-in, $1$-out. Combin. Probab. Comput., 1(3):265--274, 1992. [bibtex-entry]

1. S. Akl, M. Cosnard, and A. Ferreira. Revisiting parallel speedup complexity. In W.W. Koczkodaj, P.L. Lauer, and A.A. Toptsis, editors, Proceedings of the IEEE International Conference on Computing and Information -- ICCI'92, pages 179--182, 1992. IEEE Press. [bibtex-entry]


2. J.-C. Bermond and P. Fraigniaud. Broadcasting and NP-Completeness. In Graph Theory Notes of New York, volume XXII, pages 8--14, 1992. [PDF ] [bibtex-entry]


3. J. C. Bermond and M. Syska. Routage wormhole et canaux virtuels. In M. Nivat M. Cosnard and Y. Robert, editors, Algorithmique Parallèle, pages 149--158, 1992. Masson. [PDF ] [bibtex-entry]


4. P. Berthomé and A. Ferreira. Efficiently solving geometric problems on large hypercube multiprocessors. In S. Tzafestas, P. Borne, and L. Grandinetti, editors, Parallel and Distributed Computing in Engineering Systems, pages 123--128, 1992. IMACS - North Holland. [bibtex-entry]


5. M. Cosnard and A. Ferreira. Designing non-numerical parallel algorithms. In D.J. Evans, G.R. Joubert, and H. Liddell, editors, invited paper, Proceedings of the International Conference on Parallel Computing -- ParCo'91, London (UK), pages 3--18, 1992. Elsevier Science Publishers B.V.. [bibtex-entry]


6. T. Duboux, A. Ferreira, and M. Gastaldo. MIMD Dictionary Machines: from theory to practice. In L. Bougé et al., editor, Parallel Processing: CONPAR 92 - VAPP V, volume 634 of Lecture Notes in Computer Science, pages 545--550, 1992. Springer-Verlag. [bibtex-entry]


7. A. Ferreira. Parallel search in sorted multisets, and NP-Complete problems. In R. Baeza-Yates and U. Manber, editors, Computer Science - Research and Applications, Santiago - Chile, pages 383--394, 1992. Plenum Press. [bibtex-entry]


8. A. Ferreira and S. Song. Achieving optimality for gate matrix layout and PLA folding: a graph theoretic approach. In I. Simon, editor, LATIN '92, volume 384 of Lecture Notes in Computer Science, São Paulo (Br), pages 139--153, 1992. Springer-Verlag. [bibtex-entry]


9. C. McDiarmid, B. Reed, A. Schrijver, and B. Shepherd. Noninterfering network flows. In Algorithm theory---SWAT '92 (Helsinki, 1992), volume 621 of Lecture Notes in Comput. Sci., Berlin, pages 245--257, 1992. Springer. [bibtex-entry]

This document was translated from BibT_EX by bibtex2html