| 2008 |
|---|
| 54 | EE | Xiaofeng Han,
Xiang Cao,
Errol L. Lloyd,
Chien-Chung Shen:
Deploying Directional Sensor Networks with Guaranteed Connectivity and Coverage.
SECON 2008: 153-160 |
| 53 | EE | Maitreya Natu,
Adarshpal S. Sethi,
Errol L. Lloyd:
Efficient probe selection algorithms for fault diagnosis.
Telecommunication Systems 37(1-3): 109-125 (2008) |
| 2007 |
|---|
| 52 | EE | Xiaofeng Han,
Xiang Cao,
Errol L. Lloyd,
Chien-Chung Shen:
Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks.
INFOCOM 2007: 1667-1675 |
| 51 | EE | Fei Che,
Liang Zhao,
Errol L. Lloyd:
Optimal Relay Node Fault Recovery.
MobiQuitous 2007: 1-8 |
| 50 | EE | Charles J. Colbourn,
Minghao Cui,
Errol L. Lloyd,
Violet R. Syrotiuk:
A carrier sense multiple access protocol with power backoff (CSMA/PB).
Ad Hoc Networks 5(8): 1233-1250 (2007) |
| 49 | EE | Errol L. Lloyd,
Guoliang Xue:
Relay Node Placement in Wireless Sensor Networks.
IEEE Trans. Computers 56(1): 134-138 (2007) |
| 2006 |
|---|
| 48 | | Liang Zhao,
Errol L. Lloyd:
The Impact of Clustering in Distributed Topology Control.
Communications in Computing 2006: 21-27 |
| 47 | EE | Liang Zhao,
Errol L. Lloyd,
S. S. Ravi:
Topology Control for Constant Rate Mobile Networks.
GLOBECOM 2006 |
| 46 | EE | Liang Zhao,
Errol L. Lloyd,
S. S. Ravi:
Topology Control for Simple Mobile Networks.
GLOBECOM 2006 |
| 45 | EE | Nicholas A. Kraft,
Errol L. Lloyd,
Brian A. Malloy,
Peter J. Clarke:
The implementation of an extensible system for comparison and visualization of class ordering methodologies.
Journal of Systems and Software 79(8): 1092-1109 (2006) |
| 44 | EE | Errol L. Lloyd,
Rui Liu,
S. S. Ravi:
Approximating the Minimum Number of Maximum Power Users in Ad hoc Networks.
MONET 11(2): 129-142 (2006) |
| 2005 |
|---|
| 43 | EE | Errol L. Lloyd,
Brian A. Malloy:
A Study of Test Coverage Adequacy In the Presence of Stubs.
Journal of Object Technology 4(5): 117-137 (2005) |
| 42 | EE | Errol L. Lloyd,
Rui Liu,
Madhav V. Marathe,
Ram Ramanathan,
S. S. Ravi:
Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks.
MONET 10(1-2): 19-34 (2005) |
| 2004 |
|---|
| 41 | EE | Errol L. Lloyd,
Rui Liu,
S. S. Ravi:
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks.
ADHOC-NOW 2004: 1-13 |
| 40 | EE | Chien-Chung Shen,
Chavalit Srisathapornphat,
Rui Liu,
Zhuochuan Huang,
Chaiporn Jaikaeo,
Errol L. Lloyd:
CLTC: A Cluster-Based Topology Control Framework for Ad Hoc Networks.
IEEE Trans. Mob. Comput. 3(1): 18-32 (2004) |
| 2003 |
|---|
| 39 | EE | Sven Oliver Krumke,
Rui Liu,
Errol L. Lloyd,
Madhav V. Marathe,
Ram Ramanathan,
S. S. Ravi:
Topology Control Problems under Symmetric and Asymmetric Power Thresholds.
ADHOC-NOW 2003: 187-198 |
| 38 | EE | Qiwei Huang,
Errol L. Lloyd:
Cost Constrained Fixed Job Scheduling.
ICTCS 2003: 111-124 |
| 37 | EE | Brian A. Malloy,
Peter J. Clarke,
Errol L. Lloyd:
A Parameterized Cost Model to Order Classes for Class-based Testing of C++ Applications.
ISSRE 2003: 353-364 |
| 2002 |
|---|
| 36 | | Qiwei Huang,
Errol L. Lloyd:
Analysis of Queuing Delay in Multimedia Gateway Call Routing.
International Conference on Internet Computing 2002: 193-200 |
| 35 | EE | Errol L. Lloyd,
Rui Liu,
Madhav V. Marathe,
Ram Ramanathan,
S. S. Ravi:
Algorithmic aspects of topology control problems for ad hoc networks.
MobiHoc 2002: 123-134 |
| 1998 |
|---|
| 34 | | Zoran Ivkovic,
Errol L. Lloyd:
Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps.
SIAM J. Comput. 28(2): 574-611 (1998) |
| 1997 |
|---|
| 33 | EE | Zoran Ivkovic,
Errol L. Lloyd:
Partially Dynamic bin Packing can be Solved Within 1 + \varepsilon in (Amortized) Polylogarithmic Time.
Inf. Process. Lett. 63(1): 45-50 (1997) |
| 1996 |
|---|
| 32 | EE | Hari Krishna Tadepalli,
Errol L. Lloyd:
An Improved Approximation Algorithm for Scheduling Task Trees on Linear Arrays.
IPPS 1996: 584-590 |
| 31 | EE | Zoran Ivkovic,
Errol L. Lloyd:
A Fundamental Restriction on Fully Dynamic Maintenance of Bin Packing.
Inf. Process. Lett. 59(4): 229-232 (1996) |
| 30 | | Jean R. S. Blair,
Errol L. Lloyd:
River Routing with a Generalized Model.
J. Comput. Syst. Sci. 53(3): 525-544 (1996) |
| 1995 |
|---|
| 29 | EE | Martin C. Carlisle,
Errol L. Lloyd:
on the K-coloring of Intervals.
Discrete Applied Mathematics 59(3): 225-235 (1995) |
| 1994 |
|---|
| 28 | EE | Brian A. Malloy,
Errol L. Lloyd,
Mary Lou Soffa:
Scheduling DAG's for Asynchronous Multiprocessor Execution.
IEEE Trans. Parallel Distrib. Syst. 5(5): 498-508 (1994) |
| 1993 |
|---|
| 27 | | Zoran Ivkovic,
Errol L. Lloyd:
Fully Dynamic Algorithms for Bin Packing: Being (mostly) Myopic Helps.
ESA 1993: 224-235 |
| 26 | | Zoran Ivkovic,
Errol L. Lloyd:
Fully Dynamic Maintenance of Vertex Cover.
WG 1993: 99-111 |
| 25 | EE | Subramanian Ramanathan,
Errol L. Lloyd:
Scheduling algorithms for multihop radio networks.
IEEE/ACM Trans. Netw. 1(2): 166-177 (1993) |
| 24 | | S. S. Ravi,
Errol L. Lloyd:
Graph Theoretic Analysis of PLA Folding Heuristics.
J. Comput. Syst. Sci. 46(3): 326-348 (1993) |
| 1992 |
|---|
| 23 | | Brian A. Malloy,
Errol L. Lloyd,
Mary Lou Soffa:
A Fine-Grained Approach to Scheduling Asynchronous Multiprocessors.
ICCI 1992: 139-142 |
| 22 | | Errol L. Lloyd,
Subramanian Ramanathan:
On the Complexity of Distance-2 Coloring.
ICCI 1992: 71-74 |
| 21 | EE | Subramanian Ramanathan,
Errol L. Lloyd:
Scheduling Algorithms for Multi-Hop Radio Networks.
SIGCOMM 1992: 211-222 |
| 20 | | Jean R. S. Blair,
Errol L. Lloyd:
Minimizing External Wires in Generalized Single-Row Routing.
IEEE Trans. Computers 41(6): 771-776 (1992) |
| 1991 |
|---|
| 19 | | Martin C. Carlisle,
Errol L. Lloyd:
On the k-Coloring of Intervals.
ICCI 1991: 90-101 |
| 18 | | Prasad Jayanti,
Adarshpal S. Sethi,
Errol L. Lloyd:
Minimal Shared Information for Concurrent Reading and Writing.
WDAG 1991: 212-228 |
| 17 | | Jean R. S. Blair,
Errol L. Lloyd:
The Benefits of External Wires in Single Row Routing.
Inf. Process. Lett. 40(1): 43-49 (1991) |
| 1989 |
|---|
| 16 | | Errol L. Lloyd:
A Fast Algorithm for Finding Interlocking Sets.
Inf. Process. Lett. 32(1): 47-50 (1989) |
| 1988 |
|---|
| 15 | | Errol L. Lloyd,
Mary Lou Soffa:
On Locating Minimum Feedback Vertex Sets.
J. Comput. Syst. Sci. 37(3): 292-311 (1988) |
| 14 | | S. S. Ravi,
Errol L. Lloyd:
The Complexity of Near-Optimal Programmable Logic Array Folding.
SIAM J. Comput. 17(4): 696-710 (1988) |
| 1987 |
|---|
| 13 | | Jean R. S. Blair,
Sanjiv Kapoor,
Errol L. Lloyd,
Kenneth J. Supowit:
Minimizing Channel Density in Standard Cell Layout.
Algorithmica 2: 267-282 (1987) |
| 1986 |
|---|
| 12 | | Jean R. S. Blair,
Errol L. Lloyd:
Generalized River Routing - Algorithms and Performance Bounds (Extended Abstract).
Aegean Workshop on Computing 1986: 317-328 |
| 11 | | Errol L. Lloyd:
Two Processor Scheduling with Limited Preemption.
Perform. Eval. 6(4): 307-312 (1986) |
| 1985 |
|---|
| 10 | | Errol L. Lloyd,
Michael C. Loui:
On the Worst Case Performance of Buddy Systems.
Acta Inf. 22(4): 451-473 (1985) |
| 9 | EE | Ching-Chy Wang,
Errol L. Lloyd,
Mary Lou Soffa:
Feedback Vertex Sets and Cyclically Reducible Graphs
J. ACM 32(2): 296-313 (1985) |
| 1984 |
|---|
| 8 | | Errol L. Lloyd,
S. S. Ravi:
One-Layer Routing without Component Constraints.
J. Comput. Syst. Sci. 28(3): 420-438 (1984) |
| 1983 |
|---|
| 7 | | Errol L. Lloyd:
On a Simple Deadlock Recovery Problem.
Inf. Process. Lett. 16(4): 175-178 (1983) |
| 6 | | Errol L. Lloyd:
An O(n log m) Algorithm for the Josephus Problem.
J. Algorithms 4(3): 262-270 (1983) |
| 1982 |
|---|
| 5 | EE | Errol L. Lloyd:
Critical Path Scheduling with Resource and Processor Constraints.
J. ACM 29(3): 781-811 (1982) |
| 1981 |
|---|
| 4 | | Errol L. Lloyd:
Coffman-Graham Scheduling of UET Task Systems with 0-1 Resources.
Inf. Process. Lett. 12(1): 40-45 (1981) |
| 1980 |
|---|
| 3 | | Errol L. Lloyd:
Critical Path Scheduling of Task Systems with Resource and Processor Constraints (Extended Abstract)
STOC 1980: 436-446 |
| 2 | | Errol L. Lloyd:
List Scheduling Bounds for UET Systems With Resources.
Inf. Process. Lett. 10(1): 28-31 (1980) |
| 1977 |
|---|
| 1 | | Errol L. Lloyd:
On Triangulations of a Set of Points in the Plane
FOCS 1977: 228-240 |
