default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas E. Carroll
- > Home > Persons > Thomas E. Carroll
Publications
- 2012
[j6]Thomas E. Carroll, Daniel Grosu
:
An incentive-based distributed mechanism for scheduling divisible loads in tree networks. J. Parallel Distributed Comput. 72(3): 389-401 (2012)- 2011
- [j5]Thomas E. Carroll, Daniel Grosu:
Distributed algorithmic mechanism design for scheduling on unrelated machines. J. Parallel Distributed Comput. 71(3): 397-406 (2011) - [j4]Thomas E. Carroll, Daniel Grosu:
A game theoretic investigation of deception in network security. Secur. Commun. Networks 4(10): 1162-1172 (2011) - 2010
- [j3]Thomas E. Carroll, Daniel Grosu:
Formation of virtual organizations in grids: a game-theoretic approach. Concurr. Comput. Pract. Exp. 22(14): 1972-1989 (2010) - [c12]Thomas E. Carroll, Daniel Grosu:
Incentive Compatible Online Scheduling of Malleable Parallel Jobs with Individual Deadlines. ICPP 2010: 516-524 - [p1]Thomas E. Carroll, Daniel Grosu:
Formation of Virtual Organizations in Grids: A Game-Theoretic Approach. Economic Models and Algorithms for Distributed Systems 2010: 63-81 - 2009
- [j2]Thomas E. Carroll, Daniel Grosu:
A secure and anonymous voter-controlled election scheme. J. Netw. Comput. Appl. 32(3): 599-606 (2009) - [c11]Thomas E. Carroll, Daniel Grosu:
A Game Theoretic Investigation of Deception in Network Security. ICCCN 2009: 1-6 - 2008
- [j1]Thomas E. Carroll, Daniel Grosu:
Strategyproof Mechanisms for Scheduling Divisible Loads in Bus-Networked Distributed Systems. IEEE Trans. Parallel Distributed Syst. 19(8): 1124-1135 (2008) - [c10]Thomas E. Carroll, Daniel Grosu:
An Incentive-Compatible Mechanism for Scheduling Non-Malleable Parallel Jobs with Individual Deadlines. ICPP 2008: 107-114 - 2007
- [c9]Thomas E. Carroll, Daniel Grosu:
A Strategyproof Mechanism for Scheduling Divisible Loads in Linear Networks. IPDPS 2007: 1-9 - [c8]Thomas E. Carroll, Daniel Grosu:
Divisible Load Scheduling: An Approach Using Coalitional Games. ISPDC 2007: 258-265 - 2006
- [c7]Thomas E. Carroll, Daniel Grosu:
A strategy proof mechanism for scheduling divisible loads in bus networks without control processors. IPDPS 2006 - [c6]Thomas E. Carroll, Daniel Grosu:
A Strategyproof Mechanism for Scheduling Divisible Loads in Bus Networks without Control Processors. IPDPS 2006: 1-8 - [c5]Thomas E. Carroll, Daniel Grosu:
Selfish Multi-User Task Scheduling. ISPDC 2006: 99-106 - 2005
- [c4]Thomas E. Carroll, Daniel Grosu:
Distributed Algorithmic Mechanism Design for Scheduling on Unrelated Machines. ISPAN 2005: 194-201 - [c3]Daniel Grosu, Thomas E. Carroll:
A Strategyproof Mechanism for Scheduling Divisible Loads in Distributed Systems. ISPDC 2005: 83-90 - [c2]Thomas E. Carroll, Daniel Grosu:
A Secure and Efficient Voter-Controlled Anonymous Election Scheme. ITCC (1) 2005: 721-726 - [c1]Thomas E. Carroll, Daniel Grosu:
Brief announcement: distributed algorithmic mechanism design for scheduling. PODC 2005: 128
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-24 22:52 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:
