Back to Results
First PageMeta Content
Network theory / Search algorithms / Graph theory / Communication / Communication complexity / Quantum complexity theory / Shortest path problem / Randomized algorithm / Breadth-first search / Theoretical computer science / Mathematics / Applied mathematics


114 Chapter 11 Hard Problems This chapter is on “hard” problems in distributed computing. In sequential computing, there are NP-hard problems which are conjectured to take exponential
Add to Reading List

Document Date: 2014-09-26 08:28:48


Open Document

File Size: 343,08 KB

Share Result on Facebook

City

San Francisco / Yorktown / /

Company

IBM / SIAM Journal / Cambridge University Press / Morgan Kaufmann Publishers Inc. / /

Country

United States / /

Facility

IBM TJ Watson Research Center / /

IndustryTerm

deterministic algorithms / path algorithms / decentralized shortest path algorithm / linear time algorithm / randomized algorithm / distributive computing / distributed computing / distributed computer network / failsafe distributed routing protocol / computing / above algorithm / distributed message passing algorithms / sequential algorithms / sequential computing / topology information maintenance protocol / computer communication networks / randomized distributed algorithm / /

Movie

All of a sudden / /

Organization

Cambridge University / IEEE Computer Society / /

Person

Now Alice / David Peleg / Bob / Nancy A. Lynch / Elad Tal / Liam Roditty / Alice / Roger Wattenhofer / Andy Yao / G.E. Blelloch / V / Stephan Holzer / /

Position

message passing model / it still feels like cheating / /

Product

Archos TV+ Portable Video Player (PVP) / Galil / /

ProvinceOrState

New York / /

PublishedMedium

SIAM Journal on Computing / IEEE Transactions on Communications / Communications of the ACM / Theory of Computing / IEEE Transactions on Computers / /

Technology

above algorithm / distributed algorithm / distributed message passing algorithms / decentralized shortest path algorithm / randomized distributed algorithm / Shortest path algorithms / linear time algorithm / failsafe distributed routing protocol / topology information maintenance protocol / /

SocialTag