Parallel and Distributed Computing Theory and Practice

First Canada-France Conference Montréal, Canada, May 19–21, 1994 Proceedings

  • Editors
  • Michel Cosnard
  • Afonso Ferreira
  • Joseph Peters
Conference proceedings

Part of the Lecture Notes in Computer Science book series (LNCS, volume 805)

Table of contents

  1. Front Matter
  2. Nicholas Pippenger
    Pages 1-12
  3. Raymond Greenlaw, Jonathan Machta
    Pages 23-34
  4. Y. Daniel Liang, Raymond Greenlaw, Glenn Manacher
    Pages 45-57
  5. Said Bettayeb, Zevi Miller, Tony Peng, Hal Sudborough
    Pages 73-80
  6. Markus Röttger, Ulf -Peter Schroeder, Walter Unger
    Pages 81-94
  7. Frank Dehne, Rafael D. Lins
    Pages 95-100
  8. P. Baldy, H. Dicky, R. Medina, M. Morvan, J. F. Vilarem
    Pages 101-113
  9. Frank Dehne
    Pages 115-119
  10. Danny Krizanc, Lata Narayanan
    Pages 121-136
  11. Ubéda Stéphane
    Pages 137-152
  12. Van -Dat Cung, Bertrand Le Cun
    Pages 153-168
  13. V. Bokka, H. Gurla, S. Olariu, J. L. Schwing
    Pages 169-180
  14. André Hily, Dominique Sotteau
    Pages 197-206
  15. Krzysztof Diks, Andrzej Pelc
    Pages 207-217
  16. Klaus Jansen, Haiko Müller
    Pages 219-234

About these proceedings

Introduction

This volume presents the proceedings of the First Canada-France Conference on Parallel Computing; despite its name, this conference was open to full international contribution and participation, as shown by the list of contributing authors.
This volume consists of in total 22 full papers, either invited or accepted and revised after a thorough reviewing process. All together the papers provide a highly competent perspective on research in parallel algorithms and complexity, interconnection networks and distributed computing, algorithms for unstructured problems, and structured communications from the point of view of parallel and distributed computing.

Keywords

Distributed Memory Computing Interconnection Networks Parallel Algorithms Parallel Computing Structured Communications Strukturielle Kommunikation Verbindungsnetzwerke Verteiltes Rechnen algorithm algorithms complexity distributed computing

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-58078-6
  • Copyright Information Springer-Verlag 1994
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-58078-2
  • Online ISBN 978-3-540-48435-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Electronics
Telecommunications