Back to Results
First PageMeta Content
Complexity classes / Analysis of algorithms / Network theory / Shortest path problem / Algorithm / Parallel computing / Distributed computing / SL / P / Theoretical computer science / Computational complexity theory / Applied mathematics


doi:[removed]j.tcs[removed]
Add to Reading List

Document Date: 2007-11-27 04:57:32

Open Document

File Size: 359,22 KB

Share Result on Facebook

City

Nicosia / Warszawa / Cambridge / Storrs / /

Company

Elsevier B.V. / CCP / /

Country

Cyprus / Poland / United States / /

Currency

pence / /

/

Event

Product Issues / /

Facility

University of Connecticut / Artificial Intelligence Laboratory / University of Cyprus / Massachusetts Institute of Technology / /

IndustryTerm

oblivious algorithms / crash-prone processors / non-faulty processors / synchronous processors / Trivial solutions / efficient synchronous algorithm / multiprocessor systems / fault-tolerant algorithms / efficient solutions / exhaustive search / algorithmic solutions / deterministic solution / synchronous message-passing processors / deterministic algorithms / efficient deterministic gossip algorithm / partitionable networks / p-processor algorithm / combinatorial tools / trivial solution / non-faulty processor / deterministic algorithm / communication network / p-processor / gossip algorithm / /

Organization

National Science Foundation / University of Connecticut / Massachusetts Institute of Technology / Department of Computer Science and Engineering / Computer Science and Artificial Intelligence Laboratory / North Atlantic Treaty Organization / Department of Computer Science / University of Cyprus / /

Person

Chung / Alexander A. Shvartsmanc / Alon / Dariusz R. Kowalskib / /

Position

rst author / second author / Corresponding author / author / coordinator / /

Product

Galil / processor / processors changes / processors / /

ProgrammingLanguage

R / /

ProvinceOrState

Connecticut / Massachusetts / /

PublishedMedium

Theoretical Computer Science / /

Technology

The processors / fault-tolerant algorithms / non-faulty processor / Do-All algorithms / crashed processor / gossip algorithm / p-processor algorithm / one processor / All non-faulty processors / deterministic algorithms / crash-prone processors / efficient deterministic gossip algorithm / at least one non-faulty processor / synchronous message-passing processors / non-faulty processors / deterministic algorithm / idling processors / Do-All algorithm / at least one processor / efficient synchronous algorithm / /

URL

www.elsevier.com/locate/tcs / /

SocialTag