Afonso Ferreira

According to our database1, Afonso Ferreira authored at least 94 papers between 1989 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
Two Low Complexity MRC and EGC Based Receivers for SC-FDE Modulations with Massive MIMO Schemes.
J. Signal Process. Syst., 2018

2017
A Power Efficient Technique for Double Layer Massive MIMO Schemes.
Proceedings of the 86th IEEE Vehicular Technology Conference, 2017

A low complexity channel estimation scheme for Massive MIMO systems.
Proceedings of the 13th International Wireless Communications and Mobile Computing Conference, 2017

2012
Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphs.
J. Internet Serv. Appl., 2012

2011
On the Assumptions about Network Dynamics in Distributed Computing
CoRR, 2011

2010
Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs.
Wirel. Networks, 2010

Fractional Path Coloring in Bounded Degree Trees with Applications.
Algorithmica, 2010

2009
Parallel Computing: Models.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

A Filtering Algorithm for Highly Noisy Images of Brazilian ATM Bank Checks.
Proceedings of the IEEE International Conference on Systems, 2009

Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks.
Proceedings of the Structural Information and Communication Complexity, 2009

2007
Neighborhood Broadcasting in Hypercubes.
SIAM J. Discret. Math., 2007

On the Evaluation of Shortest Journeys in Dynamic Networks.
Proceedings of the Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007), 12, 2007

2006
Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations.
Discret. Optim., 2006

Performance Evaluation of Dynamic Networks using an Evolving Graph Combinatorial Model.
Proceedings of the 2006 IEEE International Conference on Wireless and Mobile Computing, 2006

2004
Building a reference combinatorial model for MANETs.
IEEE Netw., 2004

Approximate constrained bipartite edge coloring.
Discret. Appl. Math., 2004

2003
Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks.
Telecommun. Syst., 2003

Computing Shortest, Fastest, and Foremost Journeys in Dynamic Networks.
Int. J. Found. Comput. Sci., 2003

The Minimum Range Assignment Problem on Linear Radio Networks.
Algorithmica, 2003

Generalized Parametric Multi-terminal Flows Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, Second International Conference, 2003

2002
Isomorphisms of the De Bruijn digraph and free-space optical networks.
Networks, 2002

Parallel computation on interval graphs: algorithms and experiments.
Concurr. Comput. Pract. Exp., 2002

Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP.
Algorithmica, 2002

2001
A Probabilistic Study of Inter-Satellite Links Load in Polar Orbit Satellite Constellations.
Telecommun. Syst., 2001

A Note on Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2D Voronoï Diagram.
Parallel Process. Lett., 2001

DIAL M for Mobility: Discrete Algorithms and Methods for Mobile Computing and Communications.
Mob. Networks Appl., 2001

Re-routing algorithms in a meshed satellite constellation.
Ann. des Télécommunications, 2001

Fractional Path Coloring with Applications to WDM Networks.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000
Broadcasting in Bus Interconnection Networks.
J. Interconnect. Networks, 2000

Sorting-Based Selection Algorithms for Hypercubic Networks.
Algorithmica, 2000

On Shortest Path Problems with "Non-Markovian" Link Contribution to Path Lengths.
Proceedings of the NETWORKING 2000, 2000

An Optimization Model for Routing in Low Earth Orbit Satellite Constellations.
Proceedings of the 5th International Symposium on Parallel Architectures, 2000

Workshop on Optics and Computer Science (WOCS 2000).
Proceedings of the Parallel and Distributed Processing, 2000

De Bruijn Isomorphisms and Free Space Optical Networks.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1999
Scheduling Multiprocessor Tasks with Genetic Algorithms.
IEEE Trans. Parallel Distributed Syst., 1999

A Randomized BSP/CGM Algorithm for the Maximal Independent Set Problem.
Parallel Process. Lett., 1999

Computing the Medial Axis Transform in Parallel With Eight Scan Operations.
IEEE Trans. Pattern Anal. Mach. Intell., 1999

Scalable 2D Convex Hull and Triangulation Algorithms for Coarse Grained Multicomputers.
J. Parallel Distributed Comput., 1999

<i>d</i>-Dimensional Range Search on Multicomputers.
Algorithmica, 1999

OTIS-Based Multi-Hop Multi-OPS Lightwave Networks.
Proceedings of the Parallel and Distributed Processing, 1999

A Polynomial-Time Branching Procedure for the Multiprocessor Scheduling Problem.
Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

1998
Special Issue on Irregular Problems in Supercomputing Applications: Guest Editors' Introduction.
J. Parallel Distributed Comput., 1998

A Performance Comparison Between Graph and Hypergraph Topologies for Passive Star WDM Lightwave Networks.
Comput. Networks, 1998

Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi Diagram.
Proceedings of the STACS 98, 1998

Multiprocessor Architectures Using Multi-Hop Multi-OPS Lightwave Networks and Distributed Control.
Proceedings of the 12th International Parallel Processing Symposium / 9th Symposium on Parallel and Distributed Processing (IPPS/SPDP '98), March 30, 1998

Parallel Computation on Interval Graphs Using PC CLusters: Algorithms and Experiments.
Proceedings of the Euro-Par '98 Parallel Processing, 1998

1997
Communication Issues in Parallel Systems with Optical Interconnections.
Int. J. Found. Comput. Sci., 1997

Embedding Tori in Partitioned Optical Passive Star Networks.
Proceedings of the SIROCCO'97, 1997

d-Dimensional Range Search on Multicomputers.
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996
Optimal Information Dissemination in Star and Pancake Networks.
IEEE Trans. Parallel Distributed Syst., 1996

Foreword to the Special Issue on Parallelism.
Theor. Comput. Sci., 1996

Randomized Routing on Generalized Hypercubes.
Theor. Comput. Sci., 1996

Gossiping in Bus Interconnection Networks.
Parallel Algorithms Appl., 1996

Fast and Scalable Parallel Algorithms for Knapsack-like Problems.
J. Parallel Distributed Comput., 1996

Integrating list heuristics into genetic algorithms for multiprocessor scheduling.
Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, 1996

SCOOP: Solving Combinatorial Optimization Problems in Parallel.
Proceedings of the Solving Combinatorial Optimization Problems in Parallel, 1996

Parallel best-first branch-and-bound in discrete optimization: a framework.
Proceedings of the Solving Combinatorial Optimization Problems in Parallel, 1996

Achieving Good Performance for Dictionary Machines: A Scalable Distributed Data Balancing Technique.
Proceedings of the 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96), 1996

On Stack-Graph OPS-Based Lightwave Networks.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995
On the Effectiveness of Synchronous Parallel Branch-and-Bound Algorithms.
Parallel Process. Lett., 1995

A scalable design for VLSI dictionary machines.
Microprocess. Microprogramming, 1995

Work and Memory-Efficient Parallel Algorithms for the Knapsack Problem.
Int. J. High Speed Comput., 1995

Hypercube Algorithms for Parallel Processing of Pointer-Based Quadtrees.
Comput. Vis. Image Underst., 1995

Scalable 2d convex hull and triangulation algorithms for coarse grained multicomputers.
Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

Parallel complexity of the medial axis computation.
Proceedings of the Proceedings 1995 International Conference on Image Processing, 1995

1994
Ultra-fast parallel contour tracking, with applications to thinning.
Pattern Recognit., 1994

A Massively Parallel Knowledge-Base Server Using a Hypercube Multiprocessor.
Parallel Comput., 1994

Time-optimal Geometric Algorithms in Hypercubic Networks.
Parallel Algorithms Appl., 1994

Bus-Based Parallel Computers: A Viable Way for Massive Parallelism.
Proceedings of the PARLE '94: Parallel Architectures and Languages Europe, 1994

Improved Probabilistic Routing on Generalized Hypercubes.
Proceedings of the PARLE '94: Parallel Architectures and Languages Europe, 1994

Modeling Parallel Branch-and-Bound for Asynchronous Implementations.
Proceedings of the Workshop on Parallel Processing of Discrete Optimization Problems, 1994

On broadcasting schemes in restricted optical passive star systems.
Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994

1993
On Space-Efficient Algorithms for Certain NP-Complete Problems.
Theor. Comput. Sci., 1993

Ultra-Fast Parallel Contour Tracking and Thinning.
Proceedings of the Parallel Computing: Trends and Applications, 1993

Sorting-Based Selection Algorithms for Hypercube Networks.
Proceedings of the Seventh International Parallel Processing Symposium, 1993

1992
Data-Movement-Intensive Problems: Two Folk Theorems in Parallel Computation Revisited.
Theor. Comput. Sci., 1992

Achieving optimality for gate matrix layout and PLA folding: a graph theoretic approach.
Integr., 1992

Parallel Fractional Cascading on Hypercube Multiprocessors.
Comput. Geom., 1992

Revisiting Parallel Speedup Complexity.
Proceedings of the Computing and Information, 1992

MIMD Dictionary Machines: From Theory to Practice.
Proceedings of the Parallel Processing: CONPAR 92, 1992

1991
A Parallel Time/Hardware Tradeoff T . H = O(2^{n/2}) for the Knapsack Problem.
IEEE Trans. Computers, 1991

On the Real Power of Loosely Coupled Parallel Architectures.
Parallel Process. Lett., 1991

Efficient Parallel Construction and Manipulation of Quadtrees.
Proceedings of the International Conference on Parallel Processing, 1991

A Tight Lower Bound for Selection in Sorted X+Y.
Proceedings of the Advances in Computing and Information, 1991

1990
Contributions à la recherche dans des ensembles ordonnés : du séquentiel au parallèle. (Contributions to searching in sorted sets: from sequential to parallel models).
PhD thesis, 1990

A. G. Ferreira Parallel branch and bound on fine-grained hypercube multiprocessors.
Parallel Comput., 1990

The Complexity of Searching in X+Y and Other Multisets.
Inf. Process. Lett., 1990

1989
Complexity of Selection in X + Y.
Theor. Comput. Sci., 1989

The two list algorithm for the knapsack problem on a FPS T20.
Parallel Comput., 1989

Generating Permutations on a VLSI Suitable Linear Network.
Comput. J., 1989

Parallel branch and bound on fine-grained hypercube multiprocessors.
Proceedings of the IEEE International Workshop on Tools for Artificial Intelligence: Architectures, 1989

Parallel Algorithms for Searching In X+Y.
Proceedings of the International Conference on Parallel Processing, 1989


  Loading...