The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Afonso Ferreira: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sandeep Bhadra, Afonso Ferreira
    Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2003, pp:259-270 [Conf]
  2. Thibault Duboux, Afonso Ferreira, Michel Gastaldo
    MIMD Dictionary Machines: From Theory to Practice. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1992, pp:545-550 [Conf]
  3. Afonso Ferreira, Alfredo Goldman vel Lejbman, Siang W. Song
    Broadcasting in Bus Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    CONPAR, 1994, pp:797-807 [Conf]
  4. Andrea E. F. Clementi, Afonso Ferreira, Paolo Penna, Stephane Perennes, Riccardo Silvestri
    The Minimum Range Assignment Problem on Linear Radio Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:143-154 [Conf]
  5. H. Bourdin, Afonso Ferreira, K. Marcus
    On Stack-Graph OPS-Based Lightwave Networks. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. I, 1996, pp:218-221 [Conf]
  6. Ricardo C. Corrêa, Afonso Ferreira
    A Polynomial-Time Branching Procedure for the Multiprocessor Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1999, pp:272-279 [Conf]
  7. Afonso Ferreira, Isabelle Guérin Lassous, K. Marcus, Andrew Rau-Chaplin
    Parallel Computation on Interval Graphs Using PC CLusters: Algorithms and Experiments. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1998, pp:875-886 [Conf]
  8. Edson Cáceres, Frank K. H. A. Dehne, Afonso Ferreira, Paola Flocchini, Ingo Rieping, Alessandro Roncato, Nicola Santoro, Siang W. Song
    Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:390-400 [Conf]
  9. Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Hervé Rivano
    Fractional Path Coloring with Applications to WDM Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:732-743 [Conf]
  10. Selim G. Akl, Michel Cosnard, Afonso Ferreira
    Revisiting Parallel Speedup Complexity. [Citation Graph (0, 0)][DBLP]
    ICCI, 1992, pp:179-182 [Conf]
  11. Michel Cosnard, Afonso Ferreira
    A Tight Lower Bound for Selection in Sorted X+Y. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:134-138 [Conf]
  12. Afonso Ferreira, Stéphane Ubéda
    Parallel complexity of the medial axis computation. [Citation Graph (0, 0)][DBLP]
    ICIP, 1995, pp:2105-2108 [Conf]
  13. Michel Cosnard, Afonso Ferreira
    Parallel Algorithms for Searching In X+Y. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1989, pp:16-19 [Conf]
  14. Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin
    Efficient Parallel Construction and Manipulation of Quadtrees. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1991, pp:255-262 [Conf]
  15. Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton
    Sorting-Based Selection Algorithms for Hypercube Networks. [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:89-95 [Conf]
  16. David Coudert, Afonso Ferreira, Xavier Muñoz
    Multiprocessor Architectures Using Multi-Hop Multi-OPS Lightwave Networks and Distributed Control. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1998, pp:151-155 [Conf]
  17. David Coudert, Afonso Ferreira, Xavier Muñoz
    OTIS-Based Multi-Hop Multi-OPS Lightwave Networks. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP Workshops, 1999, pp:897-910 [Conf]
  18. David Coudert, Afonso Ferreira, Stephane Perennes
    De Bruijn Isomorphisms and Free Space Optical Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2000, pp:769-0 [Conf]
  19. Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda
    d-Dimensional Range Search on Multicomputers. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:616-620 [Conf]
  20. Fouad E. Kiamilev, Jeremy Ekman, Afonso Ferreira, Sadik C. Esener, Yi Pan, Keqin Li
    Workshop on Optics and Computer Science (WOCS 2000). [Citation Graph (0, 0)][DBLP]
    IPDPS Workshops, 2000, pp:1042-1043 [Conf]
  21. Afonso Ferreira, Jérôme Galtier, P. Mahey, G. Mateus, A. Oliveira, M. Pichereau
    An Optimization Model for Routing in Low Earth Orbit Satellite Constellations. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2000, pp:161-166 [Conf]
  22. Afonso Ferreira, Nicolas Schabanel
    A Randomized BSP/CGM Algorithm for the Maximal Independent Set Problem. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1999, pp:284-289 [Conf]
  23. Afonso Ferreira, Siang W. Song
    Achieving Optimality for Gate Matrix Layout and PLA Folding: a Graph Theoretic Approach. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:139-153 [Conf]
  24. Arunabha Sen, K. Selçuk Candan, Afonso Ferreira, Bruno Beauquier, Stephane Perennes
    On Shortest Path Problems with "Non-Markovian" Link Contribution to Path Lengths. [Citation Graph (0, 0)][DBLP]
    NETWORKING, 2000, pp:859-870 [Conf]
  25. Afonso Ferreira, Stéphane Ubéda
    Ultra-Fast Parallel Contour Tracking and Thinning. [Citation Graph (0, 0)][DBLP]
    PARCO, 1993, pp:97-104 [Conf]
  26. Afonso Ferreira, Miltos D. Grammatikakis
    Improved Probabilistic Routing on Generalized Hypercubes. [Citation Graph (0, 0)][DBLP]
    PARLE, 1994, pp:1-12 [Conf]
  27. Afonso Ferreira, Alfredo Goldman vel Lejbman, Siang W. Song
    Bus-Based Parallel Computers: A Viable Way for Massive Parallelism. [Citation Graph (0, 0)][DBLP]
    PARLE, 1994, pp:553-564 [Conf]
  28. Thibault Duboux, Afonso Ferreira
    Achieving Good Performance for Dictionary Machines: A Scalable Distributed Data Balancing Technique. [Citation Graph (0, 0)][DBLP]
    PDP, 1996, pp:266-273 [Conf]
  29. Ricardo C. Corrêa, Afonso Ferreira
    Parallel best-first branch-and-bound in discrete optimization: a framework. [Citation Graph (0, 0)][DBLP]
    Solving Combinatorial Optimization Problems in Parallel, 1996, pp:171-200 [Conf]
  30. Afonso Ferreira, Panos M. Pardalos
    SCOOP: Solving Combinatorial Optimization Problems in Parallel. [Citation Graph (0, 0)][DBLP]
    Solving Combinatorial Optimization Problems in Parallel, 1996, pp:1-6 [Conf]
  31. Pascal Berthomé, Johanne Cohen, Afonso Ferreira
    Embedding Tori in Partitioned Optical Passive Star Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1997, pp:40-52 [Conf]
  32. Afonso Ferreira, Pascal Berthomé, Stephane Perennes
    Optimal Information Dissemination in Star and Pancake Networks. [Citation Graph (0, 0)][DBLP]
    SPDP, 1993, pp:720-725 [Conf]
  33. Mohamadou Diallo, Afonso Ferreira, Andrew Rau-Chaplin
    Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi Diagram. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:399-409 [Conf]
  34. Pascal Berthomé, Madiagne Diallo, Afonso Ferreira
    Generalized Parametric Multi-terminal Flows Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:71-80 [Conf]
  35. Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano
    Approximate Constrained Bipartite Edge Coloring. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:21-31 [Conf]
  36. Pascal Berthomé, Afonso Ferreira, Bruce M. Maggs, Stephane Perennes, C. Greg Plaxton
    Sorting-Based Selection Algorithms for Hypercubic Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:26, n:2, pp:237-254 [Journal]
  37. Andrea E. F. Clementi, Paolo Penna, Afonso Ferreira, Stephane Perennes, Riccardo Silvestri
    The Minimum Range Assignment Problem on Linear Radio Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:35, n:2, pp:95-110 [Journal]
  38. Frank K. H. A. Dehne, Afonso Ferreira, Edson Cáceres, Siang W. Song, Alessandro Roncato
    Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:2, pp:183-200 [Journal]
  39. Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin, Stéphane Ubéda
    d-Dimensional Range Search on Multicomputers. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:24, n:3-4, pp:195-208 [Journal]
  40. Michel Cosnard, Afonso Ferreira
    Generating Permutations on a VLSI Suitable Linear Network. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1989, v:32, n:6, pp:571-573 [Journal]
  41. H. Bourdin, Afonso Ferreira, K. Marcus
    A Performance Comparison Between Graph and Hypergraph Topologies for Passive Star WDM Lightwave Networks. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 1998, v:30, n:8, pp:805-819 [Journal]
  42. Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin
    Parallel Fractional Cascading on Hypercube Multiprocessors. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:141-167 [Journal]
  43. Afonso Ferreira, Isabelle Guérin Lassous, K. Marcus, Andrew Rau-Chaplin
    Parallel computation on interval graphs: algorithms and experiments. [Citation Graph (0, 0)][DBLP]
    Concurrency and Computation: Practice and Experience, 2002, v:14, n:11, pp:885-910 [Journal]
  44. Frank K. H. A. Dehne, Andrew Rau-Chaplin, Afonso Ferreira
    Hypercube Algorithms for Parallel Processing of Pointer-Based Quadtrees. [Citation Graph (0, 0)][DBLP]
    Computer Vision and Image Understanding, 1995, v:62, n:1, pp:1-10 [Journal]
  45. Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano
    Approximate constrained bipartite edge coloring. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:54-61 [Journal]
  46. Pascal Berthomé, Afonso Ferreira
    Communication Issues in Parallel Systems with Optical Interconnections. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1997, v:8, n:2, pp:143-0 [Journal]
  47. Binh-Minh Bui-Xuan, Afonso Ferreira, Aubin Jarry
    Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:2, pp:267-285 [Journal]
  48. Michel Cosnard, Jean Duprat, Afonso Ferreira
    The Complexity of Searching in X+Y and Other Multisets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:2, pp:103-109 [Journal]
  49. Afonso Ferreira, Alfredo Goldman, Siang W. Song
    Broadcasting in Bus Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2000, v:1, n:2, pp:73-94 [Journal]
  50. Mohamadou Diallo, Afonso Ferreira, Andrew Rau-Chaplin, Stéphane Ubéda
    Scalable 2D Convex Hull and Triangulation Algorithms for Coarse Grained Multicomputers. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1999, v:56, n:1, pp:47-70 [Journal]
  51. Afonso Ferreira, John Michael Robson
    Fast and Scalable Parallel Algorithms for Knapsack-like Problems. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:39, n:1, pp:1-13 [Journal]
  52. Afonso Ferreira, José D. P. Rolim
    Special Issue on Irregular Problems in Supercomputing Applications: Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:50, n:1/2, pp:1-2 [Journal]
  53. Afonso Ferreira, Daniel Krob
    DIAL M for Mobility: Discrete Algorithms and Methods for Mobile Computing and Communications. [Citation Graph (0, 0)][DBLP]
    MONET, 2001, v:6, n:6, pp:491-492 [Journal]
  54. Afonso Ferreira
    Building a reference combinatorial model for MANETs. [Citation Graph (0, 0)][DBLP]
    IEEE Network, 2004, v:18, n:5, pp:24-29 [Journal]
  55. David Coudert, Afonso Ferreira, Stephane Perennes
    Isomorphisms of the De Bruijn digraph and free-space optical networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:40, n:3, pp:155-164 [Journal]
  56. Afonso Ferreira, Stéphane Ubéda
    Computing the Medial Axis Transform in Parallel With Eight Scan Operations. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1999, v:21, n:3, pp:277-282 [Journal]
  57. Michel Cosnard, Afonso Ferreira, Hugo Herbelin
    The two list algorithm for the knapsack problem on a FPS T20. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1989, v:9, n:3, pp:385-388 [Journal]
  58. Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin
    A. G. Ferreira Parallel branch and bound on fine-grained hypercube multiprocessors. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1990, v:15, n:1-3, pp:201-209 [Journal]
  59. Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin
    A Massively Parallel Knowledge-Base Server Using a Hypercube Multiprocessor. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1994, v:20, n:9, pp:1369-1382 [Journal]
  60. Ricardo C. Corrêa, Afonso Ferreira
    On the Effectiveness of Synchronous Parallel Branch-and-Bound Algorithms. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1995, v:5, n:, pp:375-386 [Journal]
  61. Michel Cosnard, Afonso Ferreira
    On the Real Power of Loosely Coupled Parallel Architectures. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1991, v:1, n:, pp:103-111 [Journal]
  62. Mohamadou Diallo, Afonso Ferreira, Andrew Rau-Chaplin
    A Note on Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2D Voronoï Diagram. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2001, v:11, n:2/3, pp:327-340 [Journal]
  63. Afonso Ferreira, Nicolas Schabanel
    A Randomized BSP/CGM Algorithm for the Maximal Independent Set Problem. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1999, v:9, n:3, pp:411-422 [Journal]
  64. Afonso Ferreira, Stéphane Ubéda
    Ultra-fast parallel contour tracking, with applications to thinning. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1994, v:27, n:7, pp:867-878 [Journal]
  65. Afonso Ferreira
    A Parallel Time/Hardware Tradeoff T . H = O(2^{n/2}) for the Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1991, v:40, n:2, pp:221-225 [Journal]
  66. Selim G. Akl, Michel Cosnard, Afonso Ferreira
    Data-Movement-Intensive Problems: Two Folk Theorems in Parallel Computation Revisited. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:95, n:2, pp:323-337 [Journal]
  67. Michel Cosnard, Jean Duprat, Afonso Ferreira
    Complexity of Selection in X + Y. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:67, n:1, pp:105-120 [Journal]
  68. Afonso Ferreira
    On Space-Efficient Algorithms for Certain NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:120, n:2, pp:311-315 [Journal]
  69. Afonso Ferreira, Miltos D. Grammatikakis
    Randomized Routing on Generalized Hypercubes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:158, n:1&2, pp:53-64 [Journal]
  70. Afonso Ferreira, José D. P. Rolim
    Foreword to the Special Issue on Parallelism. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:162, n:2, pp:171-172 [Journal]
  71. Patrick Bergé, Afonso Ferreira, Jérôme Galtier, Jean-Noël Petit
    A Probabilistic Study of Inter-Satellite Links Load in Polar Orbit Satellite Constellations. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 2001, v:18, n:1-3, pp:123-135 [Journal]
  72. Afonso Ferreira, Stephane Perennes, Hervé Rivano, Andréa W. Richa, Nicolás E. Stier Moses
    Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 2003, v:24, n:2-4, pp:123-138 [Journal]
  73. Pascal Berthomé, Afonso Ferreira, Stephane Perennes
    Optimal Information Dissemination in Star and Pancake Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1996, v:7, n:12, pp:1292-1300 [Journal]
  74. Ricardo C. Corrêa, Afonso Ferreira, Pascal Rebreyend
    Scheduling Multiprocessor Tasks with Genetic Algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1999, v:10, n:8, pp:825-837 [Journal]
  75. Afonso Ferreira, Alfredo Goldman, Julian Monteiro
    On the Evaluation of Shortest Journeys in Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    NCA, 2007, pp:3-10 [Conf]

  76. Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks. [Citation Graph (, )][DBLP]


  77. A Filtering Algorithm for Highly Noisy Images of Brazilian ATM Bank Checks. [Citation Graph (, )][DBLP]


Search in 0.080secs, Finished in 0.084secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002