Errol L. Lloyd

From MaRDI portal
Person:287128

Available identifiers

zbMath Open lloyd.errol-lMaRDI QIDQ287128

List of research outcomes





PublicationDate of PublicationType
Fully dynamic maintenance of vertex cover2024-01-05Paper
Relay Node Placement in Wireless Sensor Networks2018-06-12Paper
Partially dynamic bin packing can be solved within \(1 + \varepsilon\) in (amortized) polylogarithmic time2016-05-26Paper
Theoretical Computer Science2010-02-23Paper
Fully Dynamic Bin Packing2009-08-05Paper
Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps1998-09-21Paper
River routing with a generalized model1997-08-07Paper
A fundamental restriction on fully dynamic maintenance of bin packing1997-02-27Paper
On the \(k\)-coloring of intervals1995-11-20Paper
Graph theoretic analysis of PLA folding heuristics1993-08-18Paper
The benefits of external wires in single row routing1992-06-28Paper
A fast algorithm for finding interlocking sets1989-01-01Paper
On locating minimum feedback vertex sets1988-01-01Paper
The Complexity of Near-Optimal Programmable Logic Array Folding1988-01-01Paper
Scheduling with semaphore constraints1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37274001986-01-01Paper
Two processor scheduling with limited preemption1986-01-01Paper
Feedback vertex sets and cyclically reducible graphs1985-01-01Paper
On the worst case performance of buddy systems1985-01-01Paper
One-layer routing without component constraints1984-01-01Paper
An O(n log m) algorithm for the Josephus Problem1983-01-01Paper
On a simple deadlock recovery problem1983-01-01Paper
Critical Path Scheduling with Resource and Processor Constraints1982-01-01Paper
Concurrent Task Systems1981-01-01Paper
Coffman-Graham scheduling of UET task systems with 0-1 resources1981-01-01Paper
List scheduling bounds for UET systems with resources1980-01-01Paper

Research outcomes over time

This page was built for person: Errol L. Lloyd