The following pages link to Errol L. Lloyd (Q287128):
Displayed 26 items.
- Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time (Q287129) (← links)
- A fundamental restriction on fully dynamic maintenance of bin packing (Q671611) (← links)
- River routing with a generalized model (Q676455) (← links)
- On a simple deadlock recovery problem (Q1051555) (← links)
- On the worst case performance of buddy systems (Q1060010) (← links)
- One-layer routing without component constraints (Q1065762) (← links)
- Scheduling with semaphore constraints (Q1096534) (← links)
- On locating minimum feedback vertex sets (Q1113681) (← links)
- List scheduling bounds for UET systems with resources (Q1139371) (← links)
- Coffman-Graham scheduling of UET task systems with 0-1 resources (Q1149763) (← links)
- The benefits of external wires in single row routing (Q1183431) (← links)
- A fast algorithm for finding interlocking sets (Q1263973) (← links)
- On the \(k\)-coloring of intervals (Q1893157) (← links)
- Graph theoretic analysis of PLA folding heuristics (Q2366688) (← links)
- An O(n log m) algorithm for the Josephus Problem (Q3670552) (← links)
- (Q3727400) (← links)
- Two processor scheduling with limited preemption (Q3771601) (← links)
- Feedback vertex sets and cyclically reducible graphs (Q3771642) (← links)
- The Complexity of Near-Optimal Programmable Logic Array Folding (Q3796745) (← links)
- Concurrent Task Systems (Q3914443) (← links)
- Critical Path Scheduling with Resource and Processor Constraints (Q3957934) (← links)
- Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps (Q4210166) (← links)
- Relay Node Placement in Wireless Sensor Networks (Q4564106) (← links)
- Fully Dynamic Bin Packing (Q5192367) (← links)
- Theoretical Computer Science (Q5897354) (← links)
- Fully dynamic maintenance of vertex cover (Q6184397) (← links)