# Errol L. Lloyd

According to our database

Collaborative distances:

^{1}, Errol L. Lloyd authored at least 65 papers between 1977 and 2012.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2012

Topology control with a limited number of relays.

Proceedings of the 2012 IEEE Global Communications Conference, 2012

2011

Capturing Interface Protocols to Support Comprehension and Evaluation of C++ Libraries.

International Journal of Software Engineering and Knowledge Engineering, 2011

2010

Topology control in constant rate mobile ad hoc networks.

Wireless Networks, 2010

Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks.

IEEE Trans. Mob. Comput., 2010

2009

Improved Topology Control Algorithms for Simple Mobile Networks.

Proceedings of the Ad Hoc Networks, First International Conference, 2009

2008

Efficient probe selection algorithms for fault diagnosis.

Telecommunication Systems, 2008

Deploying Directional Sensor Networks with Guaranteed Connectivity and Coverage.

Proceedings of the Fifth Annual IEEE Communications Society Conference on Sensor, 2008

2007

Topology Control Problems for Wireless Ad Hoc Networks.

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Relay Node Placement in Wireless Sensor Networks.

IEEE Trans. Computers, 2007

A carrier sense multiple access protocol with power backoff (CSMA/PB).

Ad Hoc Networks, 2007

Optimal Relay Node Fault Recovery.

Proceedings of the 4th Annual International Conference on Mobile and Ubiquitous Systems (MobiQuitous 2007), 2007

Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks.

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006

Approximating the Minimum Number of Maximum Power Users in Ad hoc Networks.

MONET, 2006

The implementation of an extensible system for comparison and visualization of class ordering methodologies.

Journal of Systems and Software, 2006

Distributed Topology Control for Stationary and Mobile Ad Hoc Networks.

Proceedings of the IEEE 3rd International Conference on Mobile Adhoc and Sensor Systems, 2006

Topology Control for Simple Mobile Networks.

Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

Topology Control for Constant Rate Mobile Networks.

Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

The Impact of Clustering in Distributed Topology Control.

Proceedings of the 2006 International Conference on Communications in Computing, 2006

2005

Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks.

MONET, 2005

A Study of Test Coverage Adequacy In the Presence of Stubs.

Journal of Object Technology, 2005

2004

CLTC: A Cluster-Based Topology Control Framework for Ad Hoc Networks.

IEEE Trans. Mob. Comput., 2004

Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks.

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004

2003

A Parameterized Cost Model to Order Classes for Class-based Testing of C++ Applications.

Proceedings of the 14th International Symposium on Software Reliability Engineering (ISSRE 2003), 2003

Cost Constrained Fixed Job Scheduling.

Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

Topology Control Problems under Symmetric and Asymmetric Power Thresholds.

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, Second International Conference, 2003

2002

Algorithmic aspects of topology control problems for ad hoc networks.

Proceedings of the 3rd ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2002

Analysis of Queuing Delay in Multimedia Gateway Call Routing.

Proceedings of the International Conference on Internet Computing, 2002

1998

Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps.

SIAM J. Comput., 1998

1997

Partially Dynamic bin Packing can be Solved Within 1 + \varepsilon in (Amortized) Polylogarithmic Time.

Inf. Process. Lett., 1997

1996

River Routing with a Generalized Model.

J. Comput. Syst. Sci., 1996

A Fundamental Restriction on Fully Dynamic Maintenance of Bin Packing.

Inf. Process. Lett., 1996

An Improved Approximation Algorithm for Scheduling Task Trees on Linear Arrays.

Proceedings of IPPS '96, 1996

1995

on the K-coloring of Intervals.

Discrete Applied Mathematics, 1995

1994

Scheduling DAG's for Asynchronous Multiprocessor Execution.

IEEE Trans. Parallel Distrib. Syst., 1994

1993

Scheduling algorithms for multihop radio networks.

IEEE/ACM Trans. Netw., 1993

Efficient Distributed Algorithms for Channel Assignment in Multihop Radio Networks.

J. High Speed Networks, 1993

Graph Theoretic Analysis of PLA Folding Heuristics.

J. Comput. Syst. Sci., 1993

Fully Dynamic Maintenance of Vertex Cover.

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

Fully Dynamic Algorithms for Bin Packing: Being (mostly) Myopic Helps.

Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992

Minimizing External Wires in Generalized Single-Row Routing.

IEEE Trans. Computers, 1992

The Impact of wire Topology on Single Row Routing.

Journal of Circuits, Systems, and Computers, 1992

Scheduling Algorithms for Multi-Hop Radio Networks.

Proceedings of the SIGCOMM '92, 1992

A Fine-Grained Approach to Scheduling Asynchronous Multiprocessors.

Proceedings of the Computing and Information, 1992

On the Complexity of Distance-2 Coloring.

Proceedings of the Computing and Information, 1992

1991

The Benefits of External Wires in Single Row Routing.

Inf. Process. Lett., 1991

Minimal Shared Information for Concurrent Reading and Writing.

Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

On the k-Coloring of Intervals.

Proceedings of the Advances in Computing and Information, 1991

1989

A Fast Algorithm for Finding Interlocking Sets.

Inf. Process. Lett., 1989

1988

The Complexity of Near-Optimal Programmable Logic Array Folding.

SIAM J. Comput., 1988

On Locating Minimum Feedback Vertex Sets.

J. Comput. Syst. Sci., 1988

1987

Minimizing Channel Density in Standard Cell Layout.

Algorithmica, 1987

1986

Two Processor Scheduling with Limited Preemption.

Perform. Eval., 1986

Generalized River Routing - Algorithms and Performance Bounds (Extended Abstract).

Proceedings of the VLSI Algorithms and Architectures, 1986

1985

Feedback Vertex Sets and Cyclically Reducible Graphs

J. ACM, April, 1985

On the Worst Case Performance of Buddy Systems.

Acta Inf., 1985

1984

One-Layer Routing without Component Constraints.

J. Comput. Syst. Sci., 1984

1983

An O(n log m) Algorithm for the Josephus Problem.

J. Algorithms, 1983

On a Simple Deadlock Recovery Problem.

Inf. Process. Lett., 1983

1982

Critical Path Scheduling with Resource and Processor Constraints.

J. ACM, 1982

1981

Coffman-Graham Scheduling of UET Task Systems with 0-1 Resources.

Inf. Process. Lett., 1981

Concurrent Task Systems.

Operations Research, 1981

1980

Scheduling task systems with resources.

PhD thesis, 1980

List Scheduling Bounds for UET Systems With Resources.

Inf. Process. Lett., 1980

Critical Path Scheduling of Task Systems with Resource and Processor Constraints (Extended Abstract)

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1977

On Triangulations of a Set of Points in the Plane

Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977