Publications of A. Ferreira

1. H. Alt and A. Ferreira, editors. Proceedings of STACS 2002, volume 2285 of Lecture Notes in Computer Science. Springer-Verlag, 2002. [bibtex-entry]


2. A. Ferreira and D. Krob, editors. Mobile Networks & Applications (MONET) -- Special Issue on Discrete Algorithms and Methods for Mobile Computing and Communications. ACM/Baltzer, 2001. [bibtex-entry]


3. A. Ferreira and H. Reichel, editors. Proceedings of STACS 2001, volume 2010 of Lecture Notes in Computer Science. Springer-Verlag, 2001. [bibtex-entry]


4. A. Ferreira and G. Kindervater, editors. Parallel Computing -- Special Issue on High Performance Computing in Operations Research, volume 26. Elsevier Science B. V., 2000. [bibtex-entry]


5. E. Altman, A. Ferreira, and J. Galtier. Les réseaux satellitaires de télécommunications. Interéditions, 1999. [bibtex-entry]


6. P. Berthomé and A. Ferreira, editors. Optical Interconnects and Parallel Processing: Trends at the Interface. Kluwer Academic Publisher, Boston (USA), 1998. [bibtex-entry]


7. A. Ferreira and J. Rolim, editors. Journal of Parallel and Distributed Computing -- Special Issue on Irregular Problems, volume 50. Academic Press, April 1998. [bibtex-entry]


8. A. Ferreira, J. Rolim, H. Simon, and S. Teng, editors. Solving Irregularly Structured Problems in Parallel -- Irregular'98, volume 1457 of Lecture Notes in Computer Science. Springer-Verlag, 1998. [bibtex-entry]


9. G. Bilardi, A. Ferreira, R. Lüling, and J. Rolim, editors. Parallel Algorithms for Solving Irregularly Structured Problems -- Irregular'97, volume 1253 of Lecture Notes in Computer Science. Springer-Verlag, 1997. [bibtex-entry]


10. A. Ferreira and P. Pardalos, editors. Solving Combinatorial Optimization Problems in Parallel: Methods and Techniques, volume 1054 of LNCS State-of-the-Art Surveys. Springer-Verlag, 1996. [bibtex-entry]


11. A. Ferreira and J. Rolim, editors. Theoretical Computer Science -- Special Issue on Irregularly Structured Problems. North-Holland, 1996. [bibtex-entry]


12. A. Ferreira, J. Rolim, Y. Saad, and T. Yang, editors. Parallel Algorithms for Solving Irregularly Structured Problems -- Irregular'96, volume 1117 of Lecture Notes in Computer Science. Springer-Verlag, 1996. [bibtex-entry]


13. G. Authié, Jean-Marie Garcia, A. Ferreira, J.L. Roch, G. Villard, J. Roman, C. Roucairol, and B. Virot, editors. Algorithmique parallèle et applications irrégulières. Hermes, Paris (F), 1995. [bibtex-entry]


14. A. Ferreira and J. Rolim, editors. Parallel Algorithms for Irregular Problems: State of the Art. Kluwer Academic Publisher, Boston (USA), 1995. [bibtex-entry]


15. A. Ferreira and J. Rolim, editors. Parallel Algorithms for Solving Irregularly Structured Problems -- Irregular'95, volume 980 of Lecture Notes in Computer Science. Springer-Verlag, 1995. [bibtex-entry]


16. S. Akl, A. Ferreira, P. Fraigniaud, and D. Sotteau, editors. Parallel Processing Letters -- Special Issue on Algorithmic and Structural Aspects of Interconnection Networks. World Publisher Co., 1994. [bibtex-entry]


17. G. Authié, A. Ferreira, J.L. Roch, G. Villard, J. Roman, C. Roucairol, and B. Virot, editors. Algorithmes parallèles -- analyse et conception. Hermes, Paris (F), 1994. [bibtex-entry]


18. M. Cosnard, A. Ferreira, and J. Peters, editors. Parallel and Distributed Computing -- Theory and Practice, volume 805 of Lecture Notes in Computer Science. Springer-Verlag, 1994. [bibtex-entry]

1. A. Ferreira. Structures de données et modélisation discrète pour l'algorithmique des systèmes massivement parallèles. Habilitation à diriger des recherches, Ecole Normale Supérieure de Lyon et Université Claude Bernard Lyon, France, February 1994. [bibtex-entry]


2. A. Ferreira. Contributions à la Recherche dans des Ensembles Ordonnés : du Séquentiel au Parallèle. PhD thesis, Institut National Polytechnique de Grenoble, France, Juanary 1990. [bibtex-entry]

1. S. Bhadra and A. Ferreira. Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphs. J. Internet Services and Applications, 3(3):269-275, 2012. [WWW ] [PDF ] [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. [PDF ] [Abstract] [bibtex-entry]


3. I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, and H. Rivano. Fractional Path Coloring in Bounded Degree Trees with Applications. Algorithmica, 58(2):516-540, 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]


4. A. Ferreira. Uma estratégia face à Revolução Digital. Teoria e Debate, 87:20-23, 2010. [Abstract] [bibtex-entry]


5. 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. [WWW ] [PDF ] [Abstract] [bibtex-entry]


6. J-C. Bermond, A. Ferreira, S. Pérennes, and J. Peters. Neighbourhood Broadcasting in Hypercubes. SIAM Journal on Discrete Mathematics, 21(4):823-843, 2007. [PDF ] [Abstract] [bibtex-entry]


7. 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]


8. 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, September 2004. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


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


10. 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]


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


12. 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):123--138, October 2003. [WWW ] [PDF ] [Abstract] [bibtex-entry]


13. A. Ferreira. Parallel Computing: Models. In C. Floudas and P. Pardalos, editors,Encyclopedia of Optimization. Kluwer Academic Publisher, Boston (USA), 2002. [bibtex-entry]


14. 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. [PDF ] [bibtex-entry]


15. A. Ferreira and I. Guérin-Lassous. Discrete Computing with Coarse Grained Systems. In R. Corrêa, I. Dutra, M. Fiallos, and F. Gomes, editors,Parallel and Distributed Algorithms: Theory, Algorithmic Techniques and Applications, Applied Optimization, chapter 5, part I, pages 117--143. Kluwer Academic Publishers, Boston (USA), 2002. [bibtex-entry]


16. 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]


17. D. Coudert, A. Ferreira, and S. Pérennes. Isomorphisms of the De Bruijn Digraph and Free-Space Optical Networks. Networks (Wiley-Interscience), 40(3):155-164, October 2002. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


18. 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]


19. 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]


20. 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. [PDF ] [bibtex-entry]


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


22. A. Ferreira, J. Galtier, J.-N. Petit, and H. Rivano. Re-routing algorithms in a meshed satellite constellation. Annals of Telecommunications, 56(3/4):169--174, march/april 2001. [PDF ] [Abstract] [bibtex-entry]


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


24. D. Coudert, A. Ferreira, and X. Muñoz. A Multihop-Multi-OPS Optical Interconnection Network. IEEE/OSA Journal of Lightwave Technology, 18(12):2076-2085, 2000. [POSTSCRIPT ] [Abstract] [bibtex-entry]


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


26. 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]


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


28. 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]


29. 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]


30. R. Corrêa, A. Ferreira, and P. Rebreyend. Integrating list heuristics in genetic algorithms for multiprocessor scheduling. IEEE Transactions on Parallel and Distributed Systems, 10(8):825-837, August 1999. [bibtex-entry]


31. 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]


32. 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]


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


34. 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]


35. 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]


36. 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]


37. 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]


38. 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]


39. 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]


40. 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.
    Note: Special Issue on Interconnection Networks. [bibtex-entry]


41. 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]


42. 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]


43. 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]


44. P. Berthomé, A. Ferreira, and S. Pérennes. 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]


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


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


47. 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]


48. 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]


49. 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]


50. 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]


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


52. 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]


53. T. Duboux, A. Ferreira, and M. Gastaldo. A Scalable Design for VLSI Dictionary Machines. Microprocessors & Microprogramming Journal, 41:359--372, 1995.
    Note: Special Issue on Parallel Programmable Architectures and Compilation for Multi-dimensional Processing.
    Keywords: parallelisme, grain fin, machine dico. [bibtex-entry]


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


55. 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]


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


57. 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]


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


59. A. Ferreira. On space-efficient algorithms for certain NP-Complete problems. Theoretical Computer Science, 120:311--315, 1993.
    Keywords: parallelisme, optimisation, knapsack. [bibtex-entry]


60. 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.
    Note: 2nd Special Issue on Global Optimization, Control and Games. [bibtex-entry]


61. 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]


62. 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]


63. 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]


64. 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]


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


66. 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]


67. 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]


68. 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]


69. 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]


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


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


72. 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]

1. A. Goldman, P. Floriano, and A. Ferreira. A tool for obtaining information on DTN traces. In Proceedings of the 4th Extreme Conference on Communication, Zurique, CH, 2012. [PDF ] [Abstract] [bibtex-entry]


2. A. Casteigts, S. Chaumette, and A. Ferreira. Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks. In Proc. of 16th Intl. Conference on Structural Information and Communication Complexity (SIROCCO'09), volume 5869 of Lecture Notes in Computer Science, Piran, Slovenia, pages 126-140, May 2009. Springer-Verlag. [PDF ] [Abstract] [bibtex-entry]


3. A. Ferreira. Road-mapping the Digital Revolution: Visions from COST Foresight 2030 (An exercise in multi-disciplinarity). In Proceedings of IEEE Wireless VITAE'09, Aalborg, Denmark, pages 5p, May 2009. IEEE Press. [PDF ] [Abstract] [bibtex-entry]


4. A. Ferreira, A. Goldman, and J. Monteiro. On the evaluation of shortest journeys in dynamic networks. In Proceedings of the 6th IEEE International Symposium on Network Computing and Applications, Cambridge, MA, USA, pages 3--10, July 2007.
   Note: Invited Paper. [PDF ] [Abstract] [bibtex-entry]


5. A. Ferreira, A. Goldman, and J. Monteiro. Using Evolving Graphs Foremost Journey to Evaluate Ad-Hoc Routing Protocols. In Proceedings of 25th Brazilian Symposium on Computer Networks (SBRC'07), Belem, Brazil, pages 17--30, June 2007. [PDF ] [Abstract] [bibtex-entry]


6. A. Ferreira, A. Goldman, and J. Monteiro. Performance Evaluation of Dynamic Networks using an Evolving Graph Combinatorial Model. In Proceedings of the 2nd IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2006), Montreal, CA, pages 173--180, June 2006.
   Note: Best Student Paper Award. [WWW ] [bibtex-entry]


7. A. Ferreira and A. Jarry. Complexity of Minimum Spanning Tree in Evolving Graphs and the Minimum-Energy Broadcast Routing Problem. In Proceedings of WiOpt'04 -- Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks, Cambridge, United Kingdom, March 2004. [bibtex-entry]


8. P. Berthomé, M. Diallo, and A. Ferreira. Generalized Parametric Multi-Terminal Flows Problem. In Proceedings of WG'03, volume 2880 of Lecture Notes in Computer Science, pages 71--80, June 2003. Springer-Verlag. [bibtex-entry]


9. S. Bhadra and A. Ferreira. Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks. In S. Pierre, M. Barbeau, and E. Kranakis, editors, Proceedings of Adhoc-Now'03, volume 2865 of Lecture Notes in Computer Science, Montreal, pages 259--270, October 2003. Springer Verlag. [bibtex-entry]


10. B. Bui-Xuan, A. Ferreira, and A. Jarry. Evolving graphs and least cost journeys in dynamic networks. In Proceedings of WiOpt'03 -- Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks, Sophia Antipolis, pages 141--150, March 2003. INRIA Press. [bibtex-entry]


11. A. Ferreira, S. Perennes, A.W. Richa, H. Rivano, and N. Stier Moses. Models, complexity and algorithms for the design of multifiber WDM networks. In Telecommunications, 2003. ICT 2003. 10th International Conference on, volume 1, pages 12--18, 23 Feb.-1 March 2003. [PDF ] [Abstract] [bibtex-entry]


12. A. Ferreira. On models and algorithms for dynamic communication networks: The case for evolving graphs. In 4$^{\rm e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2002), Mèze, France, May 2002. [bibtex-entry]


13. A. Ferreira, S. Pérennes, A. Richa, H. Rivano, and N. Stier. On the design of multifiber WDM networks. In AlgoTel'02, Mèze, France, pages 25--32, May 2002. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


14. A. Caminada, A. Ferreira, and L. Floriani. Principal Component Analysis for data volume reduction in experimental analysis of heuristics. In Proceedings of GECCO 2001 Workshop on Real-life Evolutionary Design Optimisation, San Francisco (USA), 2001. [bibtex-entry]


15. I. Caragianis, A. Ferreira, C. Kaklamanis, S. Pérennes, and H. Rivano. Fractional path coloring on bounded degree trees. In F. Orejas, P. G. Spirakis, and J. van Leeuwen, editors, Proceedings of the 28th ICALP, volume 2076 of Lecture Notes in Computer Science, Crete, Greece, pages 732--743, July 2001. Springer-Verlag. [PDF ] [Abstract] [bibtex-entry]


16. I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, P. Persiano, and H. Rivano. Approximate Constrained Bipartite Edge Coloring. In V.B. Le A. Branstädt, editor, 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'01), volume 2204 of Lecture Notes in Computer Science, Boltenhagen, Germany, pages 21--31, June 2001. Springer-Verlag. [PDF ] [Abstract] [bibtex-entry]


17. B. Beauquier, K.S. Candan, A. Ferreira, S. Pérennes, and A. Sen. On shortest path problems with ``non-Markovian'' link contribution to path lengths. In Proc. of IFIP/TC6 Networking 2000 Conference, Paris, France, mai 2000. [bibtex-entry]


18. P. Bergé, A. Ferreira, J. Galtier, and S. Petit. A probabilistic study of inter-satellite links load in polar orbit satellite constellations. In $2^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2000), La Rochelle, France, pages 137--142, Mai 2000. [bibtex-entry]


19. A. Clementi, A. Ferreira, P. Penna, S. Pérennes, and R. Silvestri. The Minimum Range Assignment Problem on Linear Radio Networks. In Proc. of ESA-00, 8th Annual European Symposium on Algorithms, volume LNCS, pages 143--154, 2000. [bibtex-entry]


20. D. Coudert, A. Ferreira, and S. Perennes. De Bruijn Isomorphisms and Free Space Optical Networks. In IEEE International Parallel and Distributed Processing Symposium, pages 769-774, 2000. IEEE Press. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


21. A. Ferreira, J. Galtier, P. Mahey, G. Mateus, and A. Oliveira. An Optimization Model for Routing in Low Earth Orbit Satellite Constellations. In Proceedings of ISPAN, Dallas, USA, December 2000. [bibtex-entry]


22. A. Ferreira, J. Galtier, and S. Pérennes. Approximation of a straight line in a bounded lattice. In $2^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2000), La Rochelle, France, pages 53--58, Mai 2000. [bibtex-entry]


23. P. Bergé, A. Ferreira, J. Galtier, and J.-N. Petit. A load study for intersatellite links in satellite constellations. In ECSC 5 - Fifth European Conference on Satellite Communications, Toulouse, France,CDRom, November 1999. [bibtex-entry]


24. R. Corrêa and A. Ferreira. A polynomial-time branching procedure for the multiprocessor scheduling problem. In Proceedings of Europar'99, volume 1685 of Lecture Notes in Computer Science, Toulouse (F), pages 272-279, August 1999. Springer Verlag. [bibtex-entry]


25. D. Coudert, A. Ferreira, and X. Muñoz. OTIS-Based Multi-Hop Multi-OPS Lightwave Networks. In J. Rolim et al., editor, Proceedings of the Workshop on Optics and Computer Science 1999, volume 1586 of Lecture Notes in Computer Science, pages 897-910, April 1999. Springer Verlag. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


26. D. Coudert, A. Ferreira, and S. Perennes. Theoretical Aspects of the Optical Transpose Interconnecting System Architecture. In Première Rencontres Francophones sur les aspects Algorithmiques des Télécommunications -- AlgoTel, Roscoff, France, pages 101-106, 5-7 Mai 1999. [PDF ] [POSTSCRIPT ] [bibtex-entry]


27. A. Ferreira, J. Galtier, J.-N. Petit, and H. Rivano. Algorithmes de reroutage dans une constellation de satellites. In Actes des 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99), Roscoff, France, pages 107-112, May 1999. [WWW ] [PDF ] [POSTSCRIPT ] [bibtex-entry]


28. A. Ferreira and N. Schabanel. A randomized BSP/CGM algorithm for the maximal independent set problem. In Proceedings of ISPAN'99, Fremantle, Australia, pages 284-289, June 1999. IEEE. [bibtex-entry]


29. D. Coudert, A. Ferreira, and X. Muñoz. Multiprocessor Architectures Using Multi-hops Multi-OPS Lightwave Networks and Distributed Control. In IEEE International Parallel Processing Symposium, pages 151-155, 1998. IEEE Press. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]


30. M. Diallo, A. Ferreira, and A. Rau-Chaplin. Communication-efficient deterministic parallel algorithms for planar point location and 2d Voronoi diagram. In Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science -- STACS'98, volume 1373 of Lecture Notes in Computer Science, Paris, France, pages 399--409, February 1998. Springer Verlag. [bibtex-entry]


31. A. Ferreira, I. Guérin-Lassous, K. Marcus, and A. Rau-Chaplin. Parallel Computation on Interval Graphs using PC clusters: Algorithms and Experiments. In D. Pritchard and J. Reeves, editors, Proceedings of Europar'98 (Distinguished Paper), volume 1470 of Lecture Notes in Computer Science, Southampton, UK, pages 875-886, September 1998. Springer Verlag. [bibtex-entry]


32. P. Berthomé, J. Cohen, and A. Ferreira. Embedding tori in Partitioned Optical Passive Star networks. In D. Krizanc and P. Widmayer, editors, Proceedings of 4th International Colloquium on Structural Information and Communication Complexity - Sirocco'97, volume 1 of Proceedings in Informatics, pages 40-52, July 1997. Carleton Scientific. [bibtex-entry]


33. 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. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Proceedings of ICALP'97, volume 1256 of Lecture Notes in Computer Science, pages 390--400, 1997. Springer-Verlag. [bibtex-entry]


34. A. Ferreira, E. Fleury, and M. Grammatikakis. Multicasting Control and Communications on Multihop Stack-Ring OPS Networks. In Proceedings of the 4th IEEE International Conference on Massively Parallel Processing using Optical Interconnections -- MPPOI'97, Montreal (Ca), pages 39--44, 1997. IEEE CS Press. [bibtex-entry]


35. A. Ferreira, C. Kenyon, A. Rau-Chaplin, and S. Ubéda. d-Dimensional Range Search on Multicomputers. In Proceedings of the 11th IEEE International Parallel Processing Symposium, pages 616--620, 1997. IEEE CS Press. [bibtex-entry]


36. P. Berthomé and A. Ferreira. Improved embeddings in POPS networks through stack-graph models. In Proceedings of the 3rd IEEE International Conference on Massively Parallel Processing using Optical Interconnections -- MPPOI'96, pages 130--136, October 1996. IEEE CS Press. [bibtex-entry]


37. H. Bourdin, A. Ferreira, and K. Marcus. On stack-graph OPS-based lightwave networks. In L. Bougé, P. Fraigniaud, A. Mignotte, and Y. Robert, editors, Proceedings of EuroPar'96, volume 1123 of Lecture Notes in Computer Science, Lyon (F), pages 218--221, October 1996. Springer-Verlag. [bibtex-entry]


38. R. Corrêa, A. Ferreira, and P. Rebreyend. Algorithmes génétiques ``intelligents'' pour l'ordonnancement de tâches. In Proceedings of the 8ème Rencontres du Parallélisme, Bordeaux, May 1996. [bibtex-entry]


39. R. Corrêa, A. Ferreira, and P. Rebreyend. Integrating list heuristics in genetic algorithms for multiprocessor scheduling. In Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing -- SPDP'96, New Orleans (USA), pages 462--469, October 1996. IEEE CS Press. [bibtex-entry]


40. T. Duboux and A. Ferreira. Achieving Good Performance for Dictionary Machines: A Scalable Distributed Data Balancing Technique. In Proceedings of Euromicro's 4th Workshop on Parallel and Distributed Processing, Braga, Portugal, 1996. IEEE Press. [bibtex-entry]


41. A. Ferreira and K. Marcus. A theoretical framework for the design of lightwave networks. In F. Dehne and B. Hodson, editors, Proceedings of The 10th IEEE Annual International Symposium on High Performance Computers -- HPCS'96, Ottawa, June 1996. IEEE Press.
    Note: CD-ROM. [bibtex-entry]


42. P. Berthomé and A. Ferreira. Communication Issues in Parallel Systems with Optical Interconnections. In R. A. Cryan, P. N. Fernando, P. Ghiggino, and J. M. Senior, editors, Broadband Networks: Strategies and Technologies, volume 2450 of Proceedings of SPIE, pages 464--473, 1995. SPIE -- The International Society for Optical Engineering. [bibtex-entry]


43. H. Bourdin, A. Ferreira, and K. Marcus. A comparative study of one-to-many WDM lightwave interconnection networks for multiprocessors. In Proceedings of the 2nd IEEE International Workshop on Massively Parallel Processing using Optical Interconnections -- MPPOI'95, San Antonio (USA), pages 257--264, October 1995. IEEE Press. [bibtex-entry]


44. T. Duboux, A. Ferreira, and M. Gastaldo. A scalable design for Dictionary Machines. In Moonen and Cathoor, editors, Algorithms and Parallel VLSI Architectures III, pages 143--154, 1995. Elsevier. [bibtex-entry]


45. A. Ferreira and K. Marcus. Modular multihop WDM--based lightwave networks, and routing. In S. I Najafi and H. Porte, editors, Fiber Optic Network Components, volume 2449 of Proceedings of SPIE, pages 78--86, 1995. SPIE -- The International Society for Optical Engineering. [bibtex-entry]


46. A. Ferreira and N. Qadri. Performance of WDM systems. In IEEE International Conference on High Performance Computing -- HiPC'95, New Delhi, December 1995. IEEE Press. [bibtex-entry]


47. A. Ferreira, A. Rau-Chaplin, and S. Ubeda. Scalable 2d convex hull and triangulation algorithms for coarse-grained multicomputers. In Proceedings of the 7th IEEE Symposium on Parallel and Distributed Processing -- SPDP'95, San Antonio (USA), pages 561--569, October 1995. IEEE Press. [bibtex-entry]


48. A. Ferreira and S. Ubéda. Parallel complexity of the medial axis transform. In Proceedings of the IEEE International Conference on Image Processing -- ICIP'95, volume II, Washington DC, pages 105--107, October 1995. IEEE Press. [bibtex-entry]


49. S. Akl, J. Duprat, and A. Ferreira. Building hamiltonian circuits and paths on star graphs. In I. Dimov and O. Tonev, editors, Advances in Parallel Algorithms -- Proceedings of the Workshop on Parallel Algorithms '92, Sophia (Bul), pages 131--143, 1994. IOS Press. [bibtex-entry]


50. F. Desprez, A. Ferreira, and B. Tourancheau. Efficient communication operations on passive optical star networks. In Proceedings of the First IEEE International Workshop on Massively Parallel Processing Using Optical Interconnections -- MPPOI'94, pages 52--58, 1994. IEEE Press. [bibtex-entry]


51. A. Ferreira, A. Goldman, and S. W. Song. Broadcasting in bus interconnection networks. In B. Buchberger and J. Volkert, editors, Parallel Processing: CONPAR 94 -- VAPP VI, volume 854 of Lecture Notes in Computer Science, pages 797--807, 1994. Springer Verlag. [bibtex-entry]


52. A. Ferreira, A. Goldman, and S.W. Song. Bus based parallel computers: A viable way for massive parallelism. In C. Halatsis, D. Maritsas, G. Philokyprou, and S. Thoedoridis, editors, PARLE '94 -- Parallel Architectures and Languages Europe, volume 817 of Lecture Notes in Computer Science, pages 553--564, 1994. Springer Verlag. [bibtex-entry]


53. A. Ferreira and M. Grammatikakis. Improved probabilistic routing in generalized hypercubes. In C. Halatsis, D. Maritsas, G. Philokyprou, and S. Theodoridis, editors, Proceedings of PARLE, volume 817 of Lecture Notes in Computer Science, pages 1--12, 1994. Springer Verlag. [bibtex-entry]


54. P. Berthomé, A. Ferreira, B. Maggs, S. Perennes, and G. Plaxton. Sorting-based selection algorithms on hypercubic networks. In Proceedings of the 7th IEEE International Parallel Processing Symposium -- IPPS'93, pages 89--95, 1993. IEEE Press. [bibtex-entry]


55. P. Berthomé, A. Ferreira, and S. Perennes. Improved algorithm design and optimal information dissemination in Star and Pancake networks. In Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing -- SPDP'93, pages 720--723, December 1993. IEEE Press. [bibtex-entry]


56. V. Castro-Alves, A. Ferreira, and O. Kebichi. A new class of fault models and test algorithms for dual-port dynamic RAM testing. In Proceedings of the IEEE International Workshop on Memory Testing, San Jose (CA), pages 68--71, August 1993. IEEE Press. [bibtex-entry]


57. T. Duboux, A. Ferreira, and M. Gastaldo. Machine dictionnaire sur architectures à mémoire distribuée. In Proceedings of the 5ème Rencontres du Parallélisme, Brest, pages 213--216, May 1993. [bibtex-entry]


58. A. Ferreira, A. Goldman, and S. Song. Comunicação em hipergrades e hipertoros usando barramentos. In Proceedings of the 5th Simpósio Brasileiro de Arquitetura de Computadores e Proc. de Alto Desempenho, SBC, Florianópolis (Br), pages 17--32, September 1993. Brazilian Society of Computer Science. [bibtex-entry]


59. A. Ferreira and S. Ubéda. Ultra-fast parallel contour tracking, with applications to thinning. In G.R. Joubert, D. Trystram, F.J. Peters, and D.J. Evans, editors, Parallel Computing: Trends and Applications (ParCo'93), volume 9 of Advances in Parallel Computing, pages 97--104, 1993. Elsevier Science B.V., Amsterdam. [bibtex-entry]


60. 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]


61. 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]


62. 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]


63. 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]


64. 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]


65. 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]


66. 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. [bibtex-entry]


67. 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. [bibtex-entry]


68. 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. [bibtex-entry]


69. B. Braschi, A. Ferreira, and J. Zerovnik. On the asymptotic behaviour of parallel simulated annealing. In D.J. Evans, G.R. Joubert, and F.J. Peters, editors, Proceedings of the International Conference on Parallel Computing -- ParCo'89, pages 263--268, 1990. North-Holland. [bibtex-entry]


70. F. Dehne, A. Ferreira, and A. Rau-Chaplin. A massively parallel knowledge-base server using a hypercube multiprocessor. In Proceedings of the IEEE International Conference on Tools for AI, Washington D.C., pages 660--666, 1990. IEEE Press. [bibtex-entry]


71. F. Dehne, A. Ferreira, and A. Rau-Chaplin. Parallel AI algorithms for fine-grained hypercube multiprocessors. In G. Wolf et al., editor, invited paper, Proceedings of the International Workshop on Parallel Processing by Cellular Automata and Arrrays (PARCELLA), volume 2, East-Berlin, pages 51--65, 1990. [bibtex-entry]


72. M. Cosnard and A. Ferreira. Parallel algorithms for searching in X+Y. In F.Ris and P.M.Kogge, editors, Proceedings of the International Conference on Parallel Processing -- ICPP'89, volume 3, pages 16--19, 1989. Penn State University Press. [bibtex-entry]


73. F. Dehne, A. Ferreira, and A. Rau-Chaplin. Parallel branch and bound on fine grained hypercube multiprocessors. In Proceedings of the IEEE Workshop on Tools for AI, Herndon, VA (USA), pages 616--622, 1989. IEEE Press. [bibtex-entry]


74. F. Dehne, A. Ferreira, and A. Rau-Chaplin. Parallel fractional cascading on a hypercube multiprocessor. In Proceedings of the 27th Annual Allerton Conference on Communication, Control and Computing, pages 1084--1093, October 1989. [bibtex-entry]


75. A. Ferreira. The Knapsack Problem on Parallel Architectures. In M. Cosnard et al., editor, Parallel and Distributed Algorithms, pages 145--152, 1989. North-Holland. [bibtex-entry]


76. A. Ferreira and M. Gastaldo. Implementing sorting on a hypercube. In F. André et J.-P. Verjus, editor, Hypercube and Distributed Computers, pages 359--360, 1989. INRIA-North-Holland. [bibtex-entry]


77. M. Cosnard and A. Ferreira. A processor network for generating all the permutations. In E. Chiricozzi and A. D'Amico, editors, Parallel Processing and Applications, pages 141--147, 1988. North-Holland. [bibtex-entry]


78. A. Ferreira. An optimal ${O(n^2)}$ algorithm to fold special PLA's. In H.A.Eiselt and G.Pederzoli, editors, Advances in Optimization and Control, volume 302 of Lecture Notes in Economics and Math. Systems, pages 92--102, 1988. Springer-Verlag. [bibtex-entry]


79. A. Ferreira. Efficient parallel algorithms for the knapsack problem. In M. Cosnard et al., editor, Parallel Processing, pages 169--179, 1988. IFIP-North Holland. [bibtex-entry]


80. A. Ferreira. O problema do dobramento optimal de PLA's: uma nova abordagem e seu algoritmo. In Proceedings of the 6th Brazilian Congress on Computer Science, 1986. University of Pernambuco Press. [bibtex-entry]


81. A. Ferreira. Algoritmos heurìsticos para otimização de PLA's. In Proceedings of the 5th Brazilian Symposium of Microelectronics, 1985. University of São Paulo Press. [bibtex-entry]

1. S. Bhadra and A. Ferreira. Computing multicast trees in dynamic networks using evolving graphs. Research Report 4531, INRIA, 2002. [bibtex-entry]


2. A. Ferreira and L. Viennot. A Note on Models, Algorithms, and Data Structures for Dynamic Communication Networks. Research Report 4403, INRIA, 2002. [bibtex-entry]


3. B. Xuan, A. Ferreira, and A. Jarry. Computing shortest, fastest, and foremost journeys in dynamic networks. Technical report RR-4589, INRIA, Sophia Antipolis, November 2002. [bibtex-entry]


4. A. Ferreira, S. Pérennes, A. Richa, H. Rivano, and N. Stier. On the design of multifiber WDM networks. Research Report, INRIA Research Report 4244, August 2001. [WWW ] [Abstract] [bibtex-entry]


5. A. Ferreira, S. Pérennes, and H. Rivano. Fractional coloring of bounded degree trees. Research Report, INRIA Research Report 4094, January 2001. [WWW ] [Abstract] [bibtex-entry]


6. D. Coudert, A. Ferreira, and S. Perennes. Digraph Isomorphisms and Free Space Optical Networks. Technical report, INRIA Research Report 3817, 1999. [POSTSCRIPT ] [bibtex-entry]


7. A. Ferreira. An optimal ${O(n^2)}$ algorithm to fold special PLA's. Technical report, 1989.
   Note: (abstract). [bibtex-entry]

1. A. Ferreira. O Problema do Dobramento Optimal de PLA's. Internship report, Instituto de Matemática e Estatìstica da Universidade de São Paulo, Brazil, 1986. [bibtex-entry]

This document was translated from BibT_EX by bibtex2html