Pages that link to "Item:Q1123807"
From MaRDI portal
The following pages link to Parallel approximation algorithms for bin packing (Q1123807):
Displaying 13 items.
- Optimal merging and sorting on the EREW PRAM (Q582111) (← links)
- A fundamental restriction on fully dynamic maintenance of bin packing (Q671611) (← links)
- A parallel algorithm to construct a dominance graph on nonoverlapping rectangles (Q688835) (← links)
- Parallel multiple search (Q750158) (← links)
- The iterated mod problem (Q1119390) (← links)
- Matching parentheses in parallel (Q1208458) (← links)
- An optimal parallel algorithm for merging using multiselection (Q1322118) (← links)
- A theory of strict P-completeness (Q1337145) (← links)
- Almost fully-parallel parentheses matching (Q1345960) (← links)
- A 5/4 linear time bin packing algorithm (Q1975969) (← links)
- Space-efficient parallel merging (Q3142264) (← links)
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps (Q4210166) (← links)
- A theory of strict P-completeness (Q5096767) (← links)
