1. 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},
   
    KEYWORDS = {parallelisme, grain fin, hypercubes, h-ram}
    
   }

2. 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},
   
    KEYWORDS = {parallelisme, optimisation, knapsack}
    
   }

1. 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},
   
    KEYWORDS = {ordres partiels}
    
   }

2. 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},
   
    KEYWORDS = {parallelisme, grain fin, hypercubes}
    
   }

3. 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},
   
    KEY = {p-congint},
   
    PAGES = {162-165},
   
    TITLE = {{Finding the smallest path in a rectilinear polygon on a hypercube multiprocessor}},
   
    YEAR = {1991},
   
    KEYWORDS = {parallelisme, grain fin, hypercubes}
    
   }

1. 1991.
   

   @MISC{usp91:inv,
   
    YEAR = {1991},
   
    OPTkey = {z},
   
    OPTauthor = {A. Ferreira},
   
    OPTtitle = {Parallelism and NP-Complete problems},
   
    OPThowpublished = {Invited talk, International Workshop on Combinatorics, S\~ao Paulo (Br)},
   
    OPTmonth = {},
   
    OPTyear = {1991},
   
    OPTnote = {},
   
    OPTannote = {}
    
   }

2. 1991.
   

   @MISC{euro91:inv,
   
    YEAR = {1991},
   
    OPTkey = {z},
   
    OPTauthor = {A. Ferreira},
   
    OPTtitle = {Towards a massively parallel branch \& bound},
   
    OPThowpublished = {Invited talk, EURO XI, Aachen (RFA)},
   
    OPTmonth = {},
   
    OPTyear = {1991},
   
    OPTnote = {},
   
    OPTannote = {}
    
   }

BACK TO INDEX