The following pages link to Afonso G. Ferreira (Q911275):
Displayed 33 items.
- (Q229337) (redirect page) (← links)
- (Q1118987) (redirect page) (← links)
- Fast and scalable parallel algorithms for knapsack-like problems. (Q676636) (← links)
- The complexity of searching in \(X+Y\) and other multisets (Q911276) (← links)
- Parallel branch and bound on fine-grained hypercube multiprocessors (Q916373) (← links)
- The two list algorithm for the knapsack problem on an FPS T20 (Q1118989) (← links)
- Data-movement-intensive problems: Two folk theorems in parallel computation revisited (Q1184985) (← links)
- Parallel fractional cascading on hypercube multiprocessors (Q1196294) (← links)
- Scalable 2D convex hull and triangulation algorithms for coarse grained multicomputers (Q1284136) (← links)
- Randomized routing on generalized hypercubes (Q1351447) (← links)
- The minimum range assignment problem on linear radio networks (Q1566370) (← links)
- (Q1601009) (redirect page) (← links)
- Efficient parallel graph algorithms for coarse-grained multicomputers and BSP (Q1601013) (← links)
- Bounding the probability of success of stochastic methods for global optimization (Q1802488) (← links)
- Approximate constrained bipartite edge coloring (Q1887041) (← links)
- (Q2753931) (← links)
- Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks (Q3408165) (← links)
- Neighborhood Broadcasting in Hypercubes (Q3544237) (← links)
- (Q3789088) (← links)
- (Q3802866) (← links)
- (Q4247464) (← links)
- (Q4251077) (← links)
- (Q4394580) (← links)
- (Q4448743) (← links)
- (Q4535060) (← links)
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP (Q4571970) (← links)
- Isomorphisms of the De Bruijn digraph and free‐space optical networks (Q4785231) (← links)
- Parallel computation on interval graphs: algorithms and experiments (Q4790934) (← links)
- (Q4888753) (← links)
- (Q4895234) (← links)
- A parallel time/hardware tradeoff T.H=O(2/sup n/2/) for the knapsack problem (Q5375394) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902511) (← links)
- A probabilistic study of inter-satellite links load in polar orbit satellite constellations (Q5955440) (← links)
- Fractional path coloring in bounded degree trees with applications (Q5961980) (← links)