View Document Preview and Link Document Date: 2008-07-29 05:34:16 Open Document File Size: 99,93 KB Share Result on Facebook
City Nicosia / Zurich / / Country Switzerland / Cyprus / / / Facility Negev University of Ioannina Beer-Sheva / University of Cyprus / Computer Science Ben-Gurion University / Engineering University of Cyprus / / IndustryTerm elegant algorithm / synchronous crash-prone processors / distributed search / faster protocol / packet scheduling algorithms / oblivious algorithm / synchronous processors / immediate solution / deterministic asynchronous algorithm / distributed algorithms / polynomial-time algorithm / distributed computing / work-optimal solutions / wireless networks / deterministic algorithms / oblivious routing algorithms / partitionable networks / example bounded-growth networks / polynomial-time wait-free consensus protocols / counter-example network / non-cooperative systems / oblivious routing algorithm / subquadratic protocols / asynchronous processors / computing / non-cooperative networks / multi-hop network / consensus protocol / typical distributed computing environment / / Organization University of Connecticut CY-1678 Nicosia / European Association / Yale University / Department of Computer Science / Rensselaer Polytechnic Institute / Ben-Gurion University of the Negev University / University of Cyprus / EATCS COLUMNS Paul Spirakis Roger Wattenhofer RACTI Computer Engineering and Networks Lab. / University of Ioannina / / Person Nash Equilibrium / Alex Shvartsman / Nash Equilibria / James Aspnes Costas Busch / / / Position model / adversary scheduler / / ProgrammingLanguage C / / ProvinceOrState Nebraska / / PublishedMedium Theoretical Computer Science / The Bulletin / / Technology packet scheduling algorithms / deterministic asynchronous algorithm / Polynomial-time algorithms / oblivious routing algorithms / oblivious routing algorithm / known polynomial-time wait-free consensus protocols / synchronous crash-prone processors / consensus protocol / distributed algorithm / faster protocol / elegant algorithm / polynomial-time algorithm / oblivious algorithm / five processors / simulation / routing algorithm / at least one processor / / SocialTag 
T D C C M M Department of Computer Science, University of Cyprus 75 Kallipoleos St., CY-1678