Errol L. Lloyd

Available identifiers

zbMath Open lloyd.errol-lMaRDI QIDQ287128

List of research outcomes

Publication	Date of Publication	Type
Fully dynamic maintenance of vertex cover	2024-01-05	Paper
Relay Node Placement in Wireless Sensor Networks	2018-06-12	Paper
Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time	2016-05-26	Paper
Theoretical Computer Science	2010-02-23	Paper
Fully Dynamic Bin Packing	2009-08-05	Paper
Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps	1998-09-21	Paper
River routing with a generalized model	1997-08-07	Paper
A fundamental restriction on fully dynamic maintenance of bin packing	1997-02-27	Paper
On the \(k\)-coloring of intervals	1995-11-20	Paper
Graph theoretic analysis of PLA folding heuristics	1993-08-18	Paper
The benefits of external wires in single row routing	1992-06-28	Paper
A fast algorithm for finding interlocking sets	1989-01-01	Paper
On locating minimum feedback vertex sets	1988-01-01	Paper
The Complexity of Near-Optimal Programmable Logic Array Folding	1988-01-01	Paper
Scheduling with semaphore constraints	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3727400	1986-01-01	Paper
Two processor scheduling with limited preemption	1986-01-01	Paper
Feedback vertex sets and cyclically reducible graphs	1985-01-01	Paper
On the worst case performance of buddy systems	1985-01-01	Paper
One-layer routing without component constraints	1984-01-01	Paper
An O(n log m) algorithm for the Josephus Problem	1983-01-01	Paper
On a simple deadlock recovery problem	1983-01-01	Paper
Critical Path Scheduling with Resource and Processor Constraints	1982-01-01	Paper
Concurrent Task Systems	1981-01-01	Paper
Coffman-Graham scheduling of UET task systems with 0-1 resources	1981-01-01	Paper
List scheduling bounds for UET systems with resources	1980-01-01	Paper

Research outcomes over time

This page was built for person: Errol L. Lloyd