Articles in journal or book's chapters
2012
  1. S. Bhadra and A. Ferreira. Computing Multicast Trees in Dynamic Networks and the Complexity of Connected Components in Evolving Graphs. Journal of Internet Services and Applications, 3(3):269-275, 2012. (abstract) (bibtex entry)

  2. A. Ferreira and A. Jarry. Minimum-Energy Broadcast Routing in Dynamic Wireless Networks. Journal of Green Engineering, 2(2):115--123, 2012. (bibtex entry)

2010
  1. A. Ferreira, A. Goldman, and J. Monteiro. Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs. Wireless Networks, 16(3):627--640, 2010. (http://www.springerlink.com/content/c82014477847t646) (pdf) (abstract) (bibtex entry)

  2. A. Ferreira. Uma estratégia face à Revolução Digital. Teoria e Debate, 87:20-23, 2010. (abstract) (bibtex entry)

2009
  1. I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, and H. Rivano. Fractional Path Coloring in Bounded Degree Trees with Applications. Algorithmica, 2009. Published online: 14 February 2009. (http://dx.doi.org/10.1007/s00453-009-9278-3) (pdf) (abstract) (bibtex entry)

2008
  1. J-C. Bermond, A. Ferreira, S. Perennes, and J. Peters. Neighbourhood Broadcasting in Hypercubes. SIAM Journal on Discrete Mathematics, 21(4):823-843, January 2008. (bibtex entry)

2006
  1. D. Bartha, P. Berthomé, M. Diallo, and A. Ferreira. Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations. Discrete Optimization, 3(3):195-205, September 2006. (bibtex entry)

2004
  1. I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, P. Persiano, and H. Rivano. Approximate Constrained Bipartite Edge Coloring. Discrete Applied Mathematics, 143(1-3):54-61, 2004. (bibtex entry)

  2. A. Ferreira. Building a reference combinatorial model for MANETs. IEEE Network, 18(5):24--29, 2004. (bibtex entry)

2003
  1. B. Bui-Xuan, A. Ferreira, and A. Jarry. Computing shortest, fastest, and foremost journeys in dynamic networks. International Journal of Foundations of Computer Science, 14(2):267--285, April 2003. (bibtex entry)

  2. A. Clementi, A. Ferreira, P. Penna, S. Perennes, and R. Silvestri. The Minimum Range Assignment Problem on Linear Radio Networks. Algorithmica, 35(2):95--110, 2003. (bibtex entry)

  3. A. Ferreira, S. Pérennes, A. W. Richa, H. Rivano, and N. Stier. Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks. Telecommunication Systems, 24(2-4):123-138, October 2003. (bibtex entry)

2002
  1. E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. Song. Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP. Algorithmica, 33:183-200, 2002. (bibtex entry)

  2. D. Coudert, A. Ferreira, and S. Perennes. Isomorphisms of the De Bruijn digraph and free space optical networks. Networks, 40(3):155-164, 2002. (bibtex entry)

  3. A. Ferreira, J. Galtier, and P. Penna. Topological design, routing and hand-over in satellite networks. In I. Stojmenovic, editor, Handbook of Wireless Networks and Mobile Computing, pages 473-507. John Wiley and Sons, 2002. (bibtex entry)

  4. A. Ferreira, I. Guérin-Lassous, K. Marcus, and A. Rau-Chaplin. Parallel Computation on Interval Graphs: Algorithms and Experiments. Concurrency and Computation - Practice and Experience, 56(1):47--70, January 2002. (bibtex entry)

  5. A. Ferreira and I. Guérin-Lassous. Discrete computing with coarse grained parallel systems: An algorithmic approach. In R. Corrêa, I. Dutra, M. Fiallos, and F. Gomes, editors, Models for Parallel and Distributed Computation: Theory, Algorithmic Techniques, and Applications, chapter 5, part I, pages 117--143. Kluwer Academic Publishers, Boston (USA), 2002. (bibtex entry)

2001
  1. P. Bergé, A. Ferreira, J. Galtier, and J.-N. Petit. A Probabilistic Study of Inter-Satellite Links Load in Polar Orbit Satellite Constellations. International Journal on Telecommunication Systems, 18(1-3):123-135, 2001. (bibtex entry)

  2. M. Diallo, A. Ferreira, and A. Rau-Chaplin. A note on communication-efficient deterministic paralle algorithms for planar point location and 2D Voronoi diagram. Parallel Processing Letters, 11(2/3):327--340, 2001. (bibtex entry)

  3. A. Ferreira, J. Galtier, J.-N. Petit, and H. Rivano. Rerouting algorithms in a meshed satellite constellation. Annales des Telecommunications, 56(3/4):169-174, mar/apr 2001. (bibtex entry)

  4. A. Ferreira. Parallel Computing: Models. In C. A. Floudas and P. Pardalos, editors, Encyclopedia of Optimization -- Vol. IV, pages 264-269. Kluwer Academic Publisher, Boston (USA), 2001. (bibtex entry)

2000
  1. P. Berthomé, A. Ferreira, B. Maggs, S. Perennes, and G. Plaxton. Sorting-based selection algorithms on hypercubic networks. Algorithmica, 26:237-254, 2000. (bibtex entry)

  2. D. Coudert, A. Ferreira, and X. Muñoz. A Multihop-Multi-OPS Optical Interconnection Network. IEEE-OSA Journal on Lightwave Technologies, 18(12):2076-2085, 2000. (bibtex entry)

  3. D. Coudert, A. Ferreira, and X. Muñoz. Topologies for Optical Interconnection Networks Based on the Optical Transpose Interconnection System. Applied Optics - Information Processing, 39(17):2965-2974, June 2000. (bibtex entry)

  4. A. Ferreira, A. Goldman, and S. W. Song. Broadcasting in bus interconnection networks. Journal of Interconnection Networks - JOIN, 1(2):73-94, 2000. (bibtex entry)

  5. A. Ferreira and N. Schabanel. A randomized BSP/CGM algorithm for the maximal independent set. Parallel Processing Letters, 9(3):411-422, 2000. (bibtex entry)

1999
  1. R. Corrêa, A. Ferreira, and P. Rebreyend. Scheduling multiprocessor tasks with genetic algorithms. IEEE Transactions on Parallel and Distributed Systems, 10(8):825-837, August 1999. (bibtex entry)

  2. M. Diallo, A. Ferreira, A. Rau-Chaplin, and S. Ub da. Scalable 2d convex hull and triangulation algorithms for coarse-grained multicomputers. Journal of Parallel and Distributed Computing, 56(1):47--70, January 1999. (bibtex entry)

  3. A. Ferreira. On the design of parallel discrete algorithms for high performance computing systems. In P. Pardalos, editor, Parallel Processing of Discrete Problems, volume 106 of The IMA Volumes in Mathematics and its Aplications, pages 75-83. Springer Verlag, New York (USA), 1999. (bibtex entry)

  4. A. Ferreira, C. Kenyon, A. Rau-Chaplin, and S. Ubéda. d-Dimensional Range Search on Multicomputers. Algorithmica, 24(3/4):195-208, 1999. Special Issue on Coarse Grained Parallel Algorithms. (bibtex entry)

  5. A. Ferreira and S. Ubéda. Computing the medial axis transform in parallel with 8 scan operations. IEEE Transactions on Pattern Analysis & Machine Intelligence (PAMI), 21(3):277-282, March 1999. (bibtex entry)

1998
  1. H. Bourdin, A. Ferreira, and K. Marcus. A performance comparison between graph and hypergraph topologies for passive star WDM lightwave networks. Computer Networks and ISDN Systems, 8(30):805-819, May 1998. (bibtex entry)

  2. R. Corrêa, A. Ferreira, and S. Porto. Selected Algorithmic Techniques for Parallel Optimization. In D. Du and P. Pardalos, editors, Handbook of Combinatorial Optimization, volume 3, pages 407-456. Kluwer Academic Publisher, Boston (USA), 1998. (bibtex entry)

  3. A. Ferreira and I. Guérin-Lassous. Algorithmique discrète parallèle : le chaînon manquant. In J.-F. Myoupo, editor, Parallélisme et Répartitions, chapter II, pages 23-47. Hermes, Paris (F), 1998. (bibtex entry)

  4. A. Ferreira. Towards effective models for OPS--based lightwave networks. In P. Berthomé and A. Ferreira, editors, Optical Interconnects and Parallel Processing: Trends at the Interface, pages 209-233. Kluwer Academic Publisher, Boston (USA), 1998. (bibtex entry)

1997
  1. P. Berthomé and A. Ferreira. Communication Issues in Parallel Systems with Optical Interconnections. International Journal of Foundations of Computer Science, 8(2):143--162, 1997. Special Issue on Interconnection Networks. (bibtex entry)

  2. A. Ferreira and M. Morvan. Models for Parallel Algorithm Design: An Introduction. In A. Migdalas, P. Pardalos, and S. Storoy, editors, Parallel Computing in Optimization, pages 1--26. Kluwer Academic Publisher, Boston (USA), 1997. (bibtex entry)

1996
  1. P. Berthomé, A. Ferreira, and S. Perennes. Decomposing hierarchical Cayley graphs, with applications to information dissemination and algorithm design. IEEE Transactions on Parallel and Distributed Systems, 7(12):1292--1300, December 1996. (bibtex entry)

  2. R. Corrêa and A. Ferreira. Parallel Best-First Branch-and-Bound in Discrete Optimization: A Framework. In A. Ferreira and P. Pardalos, editors, Solving Combinatorial Optimization Problems in Parallel, volume 1054 of LNCS State-of-the-Art Surveys, pages 171--200. Springer-Verlag, 1996. (bibtex entry)

  3. A. Ferreira. Parallel and Communication Algorithms for Hypercube Multiprocessors. In A. Zomaya, editor, Handbook of Parallel and Distributed Computing, chapter 19, pages 568-589. McGraw-Hill, New York (USA), 1996. (bibtex entry)

  4. A. Ferreira, A. Goldman, and S. W. Song. Gossiping in bus interconnection networks. Parallel Algorithms and Applications, 8:309--331, 1996. Special Issue on Algorithms for Enhanced Meshes. (bibtex entry)

  5. A. Ferreira and M. Grammatikakis. Randomized routing in generalized hypercubes. Theoretical Computer Science, 158(1-2):53--64, 1996. (bibtex entry)

  6. A. Ferreira and P. Pardalos. SCOOP -- Solving Combinatorial Optimization Problems in Parallel. In A. Ferreira and P. Pardalos, editors, Solving Combinatorial Optimization Problems in Parallel, volume 1054 of LNCS State-of-the-Art Surveys, pages 1--6. Springer-Verlag, 1996. (bibtex entry)

  7. A. Ferreira and J.M. Robson. Fast and Scalable Parallel Algorithms for Knapsack and Similar Problems. Journal of Parallel and Distributed Computing, 39(1):1--13, November 1996. (bibtex entry)

1995
  1. P. Berthomé and A. Ferreira. On Broadcasting Schemes in Restricted Optical Passive Star Systems. DIMACS series in Discrete Mathematics and Theoretical Computer Science, 21:19--29, 1995. (bibtex entry)

  2. R. Corrêa and A. Ferreira. Modeling Parallel Branch-and-Bound for Asynchronous Implementations. DIMACS series in Discrete Mathematics and Theoretical Computer Science, 22:45--56, 1995. (bibtex entry)

  3. R. Corrêa and A. Ferreira. A Distributed Implementation of Asynchronous Parallel Branch and Bound. In A. Ferreira and J. Rolim, editors, Solving Irregular Problems in Parallel: State of the Art, pages 157--176. Kluwer Academic Publisher, Boston (USA), 1995. (bibtex entry)

  4. R. Corrêa and A. Ferreira. On the effectivenes of parallel branch and bound. Parallel Processing Letters, 5(3):375-386, 1995. (bibtex entry)

  5. F. Dehne, A. Ferreira, and A. Rau-Chaplin. Parallel processing of pointer based quadtrees. Computer Vision and Image Understanding, 62(1):1-10, 1995. (bibtex entry)

  6. T. Duboux, A. Ferreira, and M. Gastaldo. A Scalable Design for VLSI Dictionary Machines. Microprocessors & Microprogramming Journal, 41:359--372, 1995. Special Issue on Parallel Programmable Architectures and Compilation for Multi-dimensional Processing. (bibtex entry)

  7. A. Ferreira. Work and memory efficient parallel algorithms for the knapsack problem. International Journal of High Speed Computing, 4:595-606, 1995. (bibtex entry)

1994
  1. P. Berthomé and A. Ferreira. Time-optimal geometric algorithms in hypercubic networks. Parallel Algorithms and Applications, 4:169--181, 1994. (bibtex entry)

  2. F. Dehne, A. Ferreira, and A. Rau-Chaplin. A massively parallel knowledge-base server using a hypercube multiprocessor. Parallel Computing, 20:1369--1382, 1994. (bibtex entry)

  3. T. Duboux, A. Ferreira, and M. Gastaldo. 6: Algorithmique Parallèle -- Structures de Données Arborescentes. In G. Authié, A. Ferreira, J.L. Roch, G. Villard, J. Roman, C. Roucairol, and B. Virot, editors, Algorithmes parallèles -- analyse et conception, pages 129--171. Hermes, Paris (F), 1994. (bibtex entry)

  4. A. Ferreira and S. Ubéda. Ultra-fast parallel contour tracking, with applications to thinning. Pattern Recognition, 27(7):867-878, 1994. (bibtex entry)

1993
  1. A. Ferreira and J. Zerovnik. Bounding the probability of success of stochastic methods for global optimization. International Journal on Computers & Mathematics with Applications, 25(10/11):1-8, 1993. 2nd Special Issue on Global Optimization, Control and Games. (bibtex entry)

  2. A. Ferreira. On space-efficient algorithms for certain NP-Complete problems. Theoretical Computer Science, 120:311-315, 1993. (bibtex entry)

1992
  1. 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)

  2. 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)

  3. 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)

  4. 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)

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

  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. (bibtex entry)

1990
  1. M. Cosnard, J. Duprat, and A. Ferreira. The complexity of searching in X+Y and other multisets. Information Processing Letters, (34):103-109, 1990. (bibtex entry)

  2. F. Dehne, A. Ferreira, and A. Rau-Chaplin. Parallel branch and bound on fine grained hypercube multiprocessors. Parallel Computing, 15(1-3):201-209, 1990. (bibtex entry)

  3. A. Ferreira and M. Gastaldo. Experimentations de deux algorithmes de tri sur un hypercube de transputers. La Lettre du Transputer, (5):311-21, 1990. (bibtex entry)

1989
  1. M. Cosnard, J. Duprat, and A. Ferreira. Complexity of selection in X+Y. Theoretical Computer Science, 67:115-120, 1989. (bibtex entry)

  2. M. Cosnard and A. Ferreira. Generating Permutations on a VLSI Suitable Linear Network. The Computer Journal, 32(6):571-573, 1989. (bibtex entry)

1988
  1. M. Cosnard, A. Ferreira, and H. Herbelin. The Two-List Algorithm for the Knapsack Problem on a FPS T20. Parallel Computing, (9):385-388, 1988. (bibtex entry)

BACK TO INDEX


Last modified: Fri Dec 14 14:38:49 2012
by A. Ferreira.

Automatically generated by bibtex2html written by Gregoire Malandain