The following pages link to (Q4283457):
Displaying 17 items.
- An axiomatic treatment of SIMD assignment (Q583875) (← links)
- Towards auction algorithms for large dense assignment problems (Q839685) (← links)
- Algorithms for assignment problems on an array processor (Q1124328) (← links)
- Parallel synchronous and asynchronous implementations of the auction algorithm (Q1179221) (← links)
- A note on an orthogonal systolic design for the assignment problem (Q1179253) (← links)
- The auction algorithm: A distributed relaxation method for the assignment problem (Q1320412) (← links)
- Massively parallel augmenting path algorithms for the assignment problem (Q1365535) (← links)
- Efficient massively parallel implementation of some combinatorial algorithms (Q1365935) (← links)
- Design of parallel algorithms for the single resource allocation problem (Q1584827) (← links)
- The allocation problem in hardware design (Q1801667) (← links)
- A comparison of two algorithms for the assignment problem (Q1804373) (← links)
- A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem (Q1814992) (← links)
- Reasoning about data-parallel array assignment (Q1898214) (← links)
- A Multistage Linear Array Assignment Problem (Q3210145) (← links)
- On finding and detecting efficient assignments in the case of multiple inputs and outputs (Q3568413) (← links)
- A systolic array for the assignment problem (Q3802894) (← links)
- Parallel Asynchronous Hungarian Methods for the Assignment Problem (Q4282279) (← links)