On Triangulations of a Set of Points in the Plane - Errol L. Lloyd (FOCS, 1977)

Critical Path Scheduling of Task Systems with Resource and Processor Constraints (Extended Abstract) - Errol L. Lloyd (STOC, 1980)

List Scheduling Bounds for UET Systems With Resources. - Errol L. Lloyd (Inf. Process. Lett., 1980)

Scheduling task systems with resources. - Errol L. Lloyd (1980)

Concurrent Task Systems. - Errol L. Lloyd (Oper. Res., 1981)

Coffman-Graham Scheduling of UET Task Systems with 0-1 Resources. - Errol L. Lloyd (Inf. Process. Lett., 1981)

Critical Path Scheduling with Resource and Processor Constraints. - Errol L. Lloyd (J. ACM, 1982)

On a Simple Deadlock Recovery Problem. - Errol L. Lloyd (Inf. Process. Lett., 1983)

An O(n log m) Algorithm for the Josephus Problem. - Errol L. Lloyd (J. Algorithms, 1983)

One-Layer Routing without Component Constraints. - Errol L. Lloyd; S. S. Ravi (J. Comput. Syst. Sci., 1984)

On the Worst Case Performance of Buddy Systems. - Errol L. Lloyd; Michael C. Loui (Acta Informatica, 1985)

Feedback Vertex Sets and Cyclically Reducible Graphs - Ching-Chy Wang; Errol L. Lloyd; Mary Lou Soffa (J. ACM, 1985)

Generalized River Routing - Algorithms and Performance Bounds (Extended Abstract). - Jean R. S. Blair; Errol L. Lloyd (Aegean Workshop on Computing, 1986)

Two Processor Scheduling with Limited Preemption. - Errol L. Lloyd (Perform. Evaluation, 1986)

Minimizing Channel Density in Standard Cell Layout. - Jean R. S. Blair; Sanjiv Kapoor; Errol L. Lloyd; Kenneth J. Supowit (Algorithmica, 1987)

On Locating Minimum Feedback Vertex Sets. - Errol L. Lloyd; Mary Lou Soffa (J. Comput. Syst. Sci., 1988)

The Complexity of Near-Optimal Programmable Logic Array Folding. - S. S. Ravi; Errol L. Lloyd (SIAM J. Comput., 1988)

A Fast Algorithm for Finding Interlocking Sets. - Errol L. Lloyd (Inf. Process. Lett., 1989)

Minimal Shared Information for Concurrent Reading and Writing. - Prasad Jayanti; Adarshpal S. Sethi; Errol L. Lloyd (WDAG, 1991)

The Benefits of External Wires in Single Row Routing. - Jean R. S. Blair; Errol L. Lloyd (Inf. Process. Lett., 1991)

On the Complexity of Distance-2 Coloring. - Errol L. Lloyd; Subramanian Ramanathan (ICCI, 1992)

A Fine-Grained Approach to Scheduling Asynchronous Multiprocessors. - Brian A. Malloy; Errol L. Lloyd; Mary Lou Soffa (ICCI, 1992)

Scheduling Algorithms for Multi-Hop Radio Networks. - Subramanian Ramanathan; Errol L. Lloyd (SIGCOMM, 1992)

The Impact of wire Topology on Single Row Routing. - Jean R. S. Blair; Errol L. Lloyd (J. Circuits Syst. Comput., 1992)

Minimizing External Wires in Generalized Single-Row Routing. - Jean R. S. Blair; Errol L. Lloyd (IEEE Trans. Computers, 1992)

Fully Dynamic Maintenance of Vertex Cover. - Zoran Ivkovic; Errol L. Lloyd (WG, 1993)

Graph Theoretic Analysis of PLA Folding Heuristics. - S. S. Ravi; Errol L. Lloyd (J. Comput. Syst. Sci., 1993)

Efficient Distributed Algorithms for Channel Assignment in Multihop Radio Networks. - Errol L. Lloyd; Subramanian Ramanathan (J. High Speed Networks, 1993)

Scheduling algorithms for multihop radio networks. - Subramanian Ramanathan; Errol L. Lloyd (IEEE/ACM Trans. Netw., 1993)

Scheduling DAG's for Asynchronous Multiprocessor Execution. - Brian A. Malloy; Errol L. Lloyd; Mary Lou Soffa (IEEE Trans. Parallel Distributed Syst., 1994)

on the K-coloring of Intervals. - Martin C. Carlisle; Errol L. Lloyd (Discret. Appl. Math., 1995)

An Improved Approximation Algorithm for Scheduling Task Trees on Linear Arrays. - Hari Krishna Tadepalli; Errol L. Lloyd (IPPS, 1996)

A Fundamental Restriction on Fully Dynamic Maintenance of Bin Packing. - Zoran Ivkovic; Errol L. Lloyd (Inf. Process. Lett., 1996)

River Routing with a Generalized Model. - Jean R. S. Blair; Errol L. Lloyd (J. Comput. Syst. Sci., 1996)

Partially Dynamic bin Packing can be Solved Within 1 + varepsilon in (Amortized) Polylogarithmic Time. - Zoran Ivkovic; Errol L. Lloyd (Inf. Process. Lett., 1997)

Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps. - Zoran Ivkovic; Errol L. Lloyd (SIAM J. Comput., 1998)

Analysis of Queuing Delay in Multimedia Gateway Call Routing. - Qiwei Huang; Errol L. Lloyd (International Conference on Internet Computing, 2002)

Topology Control Problems under Symmetric and Asymmetric Power Thresholds. - Sven Oliver Krumke; Rui Liu 001; Errol L. Lloyd; Madhav V. Marathe; Ram Ramanathan; S. S. Ravi (ADHOC-NOW, 2003)

Cost Constrained Fixed Job Scheduling. - Qiwei Huang; Errol L. Lloyd (ICTCS, 2003)

A Parameterized Cost Model to Order Classes for Class-based Testing of C++ Applications. - Brian A. Malloy; Peter J. Clarke; Errol L. Lloyd (ISSRE, 2003)

CLTC: A Cluster-Based Topology Control Framework for Ad Hoc Networks. - Chien-Chung Shen; Chavalit Srisathapornphat; Rui Liu 001; Zhuochuan Huang; Chaiporn Jaikaeo; Errol L. Lloyd (IEEE Trans. Mob. Comput., 2004)

A Study of Test Coverage Adequacy In the Presence of Stubs. - Errol L. Lloyd; Brian A. Malloy (J. Object Technol., 2005)

Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks. - Errol L. Lloyd; Rui Liu 001; Madhav V. Marathe; Ram Ramanathan; S. S. Ravi (Mob. Networks Appl., 2005)

The Impact of Clustering in Distributed Topology Control. - Liang Zhao; Errol L. Lloyd (Communications in Computing, 2006)

Topology Control for Constant Rate Mobile Networks. - Liang Zhao; Errol L. Lloyd; S. S. Ravi (GLOBECOM, 2006)

Topology Control for Simple Mobile Networks. - Liang Zhao; Errol L. Lloyd; S. S. Ravi (GLOBECOM, 2006)

Distributed Topology Control for Stationary and Mobile Ad Hoc Networks. - Liang Zhao; Errol L. Lloyd (MASS, 2006)

The implementation of an extensible system for comparison and visualization of class ordering methodologies. - Nicholas A. Kraft; Errol L. Lloyd; Brian A. Malloy; Peter J. Clarke (J. Syst. Softw., 2006)

Approximating the Minimum Number of Maximum Power Users in Ad hoc Networks. - Errol L. Lloyd; Rui Liu 001; S. S. Ravi (Mob. Networks Appl., 2006)

Optimal Relay Node Fault Recovery. - Fei Che; Liang Zhao; Errol L. Lloyd (MobiQuitous, 2007)

A carrier sense multiple access protocol with power backoff (CSMA/PB). - Charles J. Colbourn; Minghao Cui; Errol L. Lloyd; Violet R. Syrotiuk (Ad Hoc Networks, 2007)

Relay Node Placement in Wireless Sensor Networks. - Errol L. Lloyd; Guoliang Xue (IEEE Trans. Computers, 2007)

Topology Control Problems for Wireless Ad Hoc Networks. - S. S. Ravi; Errol L. Lloyd (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Deploying Directional Sensor Networks with Guaranteed Connectivity and Coverage. - Xiaofeng Han; Xiang Cao; Errol L. Lloyd; Chien-Chung Shen (SECON, 2008)

Efficient probe selection algorithms for fault diagnosis. - Maitreya Natu; Adarshpal S. Sethi; Errol L. Lloyd (Telecommun. Syst., 2008)

Improved Topology Control Algorithms for Simple Mobile Networks. - Fei Che; Errol L. Lloyd; Liang Zhao (ADHOCNETS, 2009)

Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks. - Xiaofeng Han; Xiang Cao; Errol L. Lloyd; Chien-Chung Shen (IEEE Trans. Mob. Comput., 2010)

Topology control in constant rate mobile ad hoc networks. - Liang Zhao; Errol L. Lloyd; S. S. Ravi (Wirel. Networks, 2010)

Capturing Interface Protocols to Support Comprehension and Evaluation of C++ Libraries. - Brian A. Malloy; Errol L. Lloyd; Jason O. Hallstrom; Edward B. Duffy (Int. J. Softw. Eng. Knowl. Eng., 2011)

Topology control with a limited number of relays. - Fei Che; Errol L. Lloyd; Jason O. Hallstrom; S. S. Ravi (GLOBECOM, 2012)

Fully Dynamic Bin Packing. - Zoran Ivkovic; Errol L. Lloyd (Fundamental Problems in Computing, 2013)

Topology Control Problems for Wireless Ad hoc Networks. - Gruia Calinescu; Errol L. Lloyd; S. S. Ravi (Handbook of Approximation Algorithms and Metaheuristics (2), 2018)