Back to Results
First PageMeta Content
PP / Logic / Information theory / Probabilistic method / Algorithm / Ε-net / Proofs of convergence of random variables / Mathematics / Applied mathematics / Chernoff bound


Reliably Executing Tasks in the Presence of Untrusted Entities∗ Chryssis Georgiou ‡ Dept. of Computer Science, University of Cyprus, 75 Kallipoleos Str., P.O. Box 20537, CY-1678,
Add to Reading List

Document Date: 2006-07-09 03:18:46


Open Document

File Size: 204,69 KB

Share Result on Facebook

City

Santos / Madrid / Nicosia / /

Company

Siam Journal / Grid Technologies / J. Wiley and Sons Inc. / Reliable Distributed Systems / /

Country

Cyprus / /

Currency

pence / /

/

Event

Product Issues / /

Facility

University of Cyprus / /

IndustryTerm

malicious processor / untrustworthy processors / selected processors / fault-tolerant distributed systems / non-trivial algorithms / fail-free processor / publicresource computing / worker processors / natural algorithm / faulty processor / trivial solution / fail-free master processor / realistic systems / unreliable and slow communications / faulty processors / broadcast networks / computing / malicious processors / volunteer computing / worker processor / /

Organization

Paper Organization / Universidad Rey / University of Cyprus / European Union / /

Person

Eric Korpela / Antonio Fern / David P. Anderson / Rey Juan Carlos / /

Position

malicious worker / given worker / faulty worker / /

Product

entities / voters / worker / processor / workers / processors / entity / /

PublishedMedium

Siam Journal on Computing / IEEE Transactions on Information Theory / Theoretical Computer Science / /

Technology

4 Proposed Algorithms / fail-free processor / faulty processor / majority algorithm / malicious processor / worker processors / 4.2 Algorithm / MBA algorithm / selected processors / second algorithm / simulation / two non-trivial algorithms / two algorithms / faulty processors / worker processor / /

SocialTag