default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErrol L. Lloyd
Person information
- affiliation: University of Delaware, Newark, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[p1]Gruia Calinescu, Errol L. Lloyd, S. S. Ravi:
Topology Control Problems for Wireless Ad hoc Networks. Handbook of Approximation Algorithms and Metaheuristics (2) 2018- 2013
- [c27]Zoran Ivkovic, Errol L. Lloyd:
Fully Dynamic Bin Packing. Fundamental Problems in Computing 2013: 407-434 - 2012
- [c26]Fei Che, Errol L. Lloyd, Jason O. Hallstrom, S. S. Ravi:
Topology control with a limited number of relays. GLOBECOM 2012: 645-651 - 2011
- [j37]Brian A. Malloy, Errol L. Lloyd, Jason O. Hallstrom, Edward B. Duffy:
Capturing Interface Protocols to Support Comprehension and Evaluation of C++ Libraries. Int. J. Softw. Eng. Knowl. Eng. 21(8): 1123-1146 (2011) - 2010
- [j36]Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chung Shen:
Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks. IEEE Trans. Mob. Comput. 9(5): 643-656 (2010) - [j35]Liang Zhao, Errol L. Lloyd, S. S. Ravi:
Topology control in constant rate mobile ad hoc networks. Wirel. Networks 16(2): 467-480 (2010)
2000 – 2009
- 2009
- [c25]Fei Che, Errol L. Lloyd, Liang Zhao:
Improved Topology Control Algorithms for Simple Mobile Networks. ADHOCNETS 2009: 450-465 - 2008
- [j34]Maitreya Natu, Adarshpal S. Sethi, Errol L. Lloyd:
Efficient probe selection algorithms for fault diagnosis. Telecommun. Syst. 37(1-3): 109-125 (2008) - [c24]Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chung Shen:
Deploying Directional Sensor Networks with Guaranteed Connectivity and Coverage. SECON 2008: 153-160 - 2007
- [j33]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) - [j32]Errol L. Lloyd, Guoliang Xue:
Relay Node Placement in Wireless Sensor Networks. IEEE Trans. Computers 56(1): 134-138 (2007) - [c23]Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chung Shen:
Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks. INFOCOM 2007: 1667-1675 - [c22]Fei Che, Liang Zhao, Errol L. Lloyd:
Optimal Relay Node Fault Recovery. MobiQuitous 2007: 1-8 - [r1]S. S. Ravi, Errol L. Lloyd:
Topology Control Problems for Wireless Ad Hoc Networks. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j31]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. J. Syst. Softw. 79(8): 1092-1109 (2006) - [j30]Errol L. Lloyd, Rui Liu, S. S. Ravi:
Approximating the Minimum Number of Maximum Power Users in Ad hoc Networks. Mob. Networks Appl. 11(2): 129-142 (2006) - [c21]Liang Zhao, Errol L. Lloyd:
The Impact of Clustering in Distributed Topology Control. Communications in Computing 2006: 21-27 - [c20]Liang Zhao, Errol L. Lloyd, S. S. Ravi:
Topology Control for Constant Rate Mobile Networks. GLOBECOM 2006 - [c19]Liang Zhao, Errol L. Lloyd, S. S. Ravi:
Topology Control for Simple Mobile Networks. GLOBECOM 2006 - [c18]Liang Zhao, Errol L. Lloyd:
Distributed Topology Control for Stationary and Mobile Ad Hoc Networks. MASS 2006: 521-524 - 2005
- [j29]Errol L. Lloyd, Brian A. Malloy:
A Study of Test Coverage Adequacy In the Presence of Stubs. J. Object Technol. 4(5): 117-137 (2005) - [j28]Errol L. Lloyd, Rui Liu, Madhav V. Marathe, Ram Ramanathan, S. S. Ravi:
Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks. Mob. Networks Appl. 10(1-2): 19-34 (2005) - 2004
- [j27]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) - [c17]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 - 2003
- [c16]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 - [c15]Qiwei Huang, Errol L. Lloyd:
Cost Constrained Fixed Job Scheduling. ICTCS 2003: 111-124 - [c14]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
- [c13]Qiwei Huang, Errol L. Lloyd:
Analysis of Queuing Delay in Multimedia Gateway Call Routing. International Conference on Internet Computing 2002: 193-200 - [c12]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
1990 – 1999
- 1998
- [j26]Zoran Ivkovic, Errol L. Lloyd:
Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps. SIAM J. Comput. 28(2): 574-611 (1998) - 1997
- [j25]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
- [j24]Zoran Ivkovic, Errol L. Lloyd:
A Fundamental Restriction on Fully Dynamic Maintenance of Bin Packing. Inf. Process. Lett. 59(4): 229-232 (1996) - [j23]Jean R. S. Blair, Errol L. Lloyd:
River Routing with a Generalized Model. J. Comput. Syst. Sci. 53(3): 525-544 (1996) - [c11]Hari Krishna Tadepalli, Errol L. Lloyd:
An Improved Approximation Algorithm for Scheduling Task Trees on Linear Arrays. IPPS 1996: 584-590 - 1995
- [j22]Martin C. Carlisle, Errol L. Lloyd:
on the K-coloring of Intervals. Discret. Appl. Math. 59(3): 225-235 (1995) - 1994
- [j21]Brian A. Malloy, Errol L. Lloyd, Mary Lou Soffa:
Scheduling DAG's for Asynchronous Multiprocessor Execution. IEEE Trans. Parallel Distributed Syst. 5(5): 498-508 (1994) - 1993
- [j20]S. S. Ravi, Errol L. Lloyd:
Graph Theoretic Analysis of PLA Folding Heuristics. J. Comput. Syst. Sci. 46(3): 326-348 (1993) - [j19]Errol L. Lloyd, Subramanian Ramanathan:
Efficient Distributed Algorithms for Channel Assignment in Multihop Radio Networks. J. High Speed Networks 2(4): 405-428 (1993) - [j18]Subramanian Ramanathan, Errol L. Lloyd:
Scheduling algorithms for multihop radio networks. IEEE/ACM Trans. Netw. 1(2): 166-177 (1993) - [c10]Zoran Ivkovic, Errol L. Lloyd:
Fully Dynamic Algorithms for Bin Packing: Being (mostly) Myopic Helps. ESA 1993: 224-235 - [c9]Zoran Ivkovic, Errol L. Lloyd:
Fully Dynamic Maintenance of Vertex Cover. WG 1993: 99-111 - 1992
- [j17]Jean R. S. Blair, Errol L. Lloyd:
The Impact of wire Topology on Single Row Routing. J. Circuits Syst. Comput. 2(2): 101-112 (1992) - [j16]Jean R. S. Blair, Errol L. Lloyd:
Minimizing External Wires in Generalized Single-Row Routing. IEEE Trans. Computers 41(6): 771-776 (1992) - [c8]Errol L. Lloyd, Subramanian Ramanathan:
On the Complexity of Distance-2 Coloring. ICCI 1992: 71-74 - [c7]Brian A. Malloy, Errol L. Lloyd, Mary Lou Soffa:
A Fine-Grained Approach to Scheduling Asynchronous Multiprocessors. ICCI 1992: 139-142 - [c6]Subramanian Ramanathan, Errol L. Lloyd:
Scheduling Algorithms for Multi-Hop Radio Networks. SIGCOMM 1992: 211-222 - 1991
- [j15]Jean R. S. Blair, Errol L. Lloyd:
The Benefits of External Wires in Single Row Routing. Inf. Process. Lett. 40(1): 43-49 (1991) - [c5]Martin C. Carlisle, Errol L. Lloyd:
On the k-Coloring of Intervals. ICCI 1991: 90-101 - [c4]Prasad Jayanti, Adarshpal S. Sethi, Errol L. Lloyd:
Minimal Shared Information for Concurrent Reading and Writing. WDAG 1991: 212-228
1980 – 1989
- 1989
- [j14]Errol L. Lloyd:
A Fast Algorithm for Finding Interlocking Sets. Inf. Process. Lett. 32(1): 47-50 (1989) - 1988
- [j13]Errol L. Lloyd, Mary Lou Soffa:
On Locating Minimum Feedback Vertex Sets. J. Comput. Syst. Sci. 37(3): 292-311 (1988) - [j12]S. S. Ravi, Errol L. Lloyd:
The Complexity of Near-Optimal Programmable Logic Array Folding. SIAM J. Comput. 17(4): 696-710 (1988) - 1987
- [j11]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
- [j10]Errol L. Lloyd:
Two Processor Scheduling with Limited Preemption. Perform. Evaluation 6(4): 307-312 (1986) - [c3]Jean R. S. Blair, Errol L. Lloyd:
Generalized River Routing - Algorithms and Performance Bounds (Extended Abstract). Aegean Workshop on Computing 1986: 317-328 - 1985
- [j9]Errol L. Lloyd, Michael C. Loui:
On the Worst Case Performance of Buddy Systems. Acta Informatica 22(4): 451-473 (1985) - [j8]Ching-Chy Wang, Errol L. Lloyd, Mary Lou Soffa:
Feedback Vertex Sets and Cyclically Reducible Graphs. J. ACM 32(2): 296-313 (1985) - 1984
- [j7]Errol L. Lloyd, S. S. Ravi:
One-Layer Routing without Component Constraints. J. Comput. Syst. Sci. 28(3): 420-438 (1984) - 1983
- [j6]Errol L. Lloyd:
On a Simple Deadlock Recovery Problem. Inf. Process. Lett. 16(4): 175-178 (1983) - [j5]Errol L. Lloyd:
An O(n log m) Algorithm for the Josephus Problem. J. Algorithms 4(3): 262-270 (1983) - 1982
- [j4]Errol L. Lloyd:
Critical Path Scheduling with Resource and Processor Constraints. J. ACM 29(3): 781-811 (1982) - 1981
- [j3]Errol L. Lloyd:
Concurrent Task Systems. Oper. Res. 29(1): 189-201 (1981) - [j2]Errol L. Lloyd:
Coffman-Graham Scheduling of UET Task Systems with 0-1 Resources. Inf. Process. Lett. 12(1): 40-45 (1981) - 1980
- [b1]Errol L. Lloyd:
Scheduling task systems with resources. Massachusetts Institute of Technology, Cambridge, MA, USA, 1980 - [j1]Errol L. Lloyd:
List Scheduling Bounds for UET Systems With Resources. Inf. Process. Lett. 10(1): 28-31 (1980) - [c2]Errol L. Lloyd:
Critical Path Scheduling of Task Systems with Resource and Processor Constraints (Extended Abstract). STOC 1980: 436-446
1970 – 1979
- 1977
- [c1]Errol L. Lloyd:
On Triangulations of a Set of Points in the Plane. FOCS 1977: 228-240
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
