On the complexity of designing distributed protocols

On the complexity of designing distributed protocols

"November 1982."

Bibliographic Details
Other Authors:	Papadimitriou, Christos H.
Language:	eng
Published:	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology 2003
Subjects:	TK7855.M41 E3845 no.1263 Electronic data processing Distributed processing Computer network protocols
Online Access:	http://hdl.handle.net/1721.1/2835

Similar Items

A failsafe distributed routing protocol
Published: (2002)

On the complexity of distributed decision problems
Published: (2002)

A recoverable protocol for loop-free distributed routing
Published: (2002)

A reliable broadcast protocol
Published: (2003)

On distributed network protocols for changing topologies
Published: (2003)

On the complexity of designing distributed protocols.
Published: (2002)

On the communication complexity of distributed algebraic computation
Published: (2003)

Distributed network protocols for changing topologies : a counterexample
Published: (2003)

Communication complexity of distributed shortest path algorithms
Published: (2003)

On the average communication complexity of asynchronous distributed algorithms
Published: (2003)

On the average communication complexity of asynchronous distributed algorithms
Published: (2002)

Distributed computation of fixed points
Published: (2002)

On the design of distributed organizational structures
Published: (2003)

Convergence theories of distributed iterative process : a survey
Published: (2003)

An interpolation problem associated with H[infinity] optimal design in systems with distributed input lags
Published: (2003)

A dynamic analysis of variable window size protocols
Published: (2003)

Some simple design problems for distributed organizations Daniel C. Lee, John N. Tsitsiklis.
Published: (2003)

The complexity of Markov decision processes
Published: (2003)

Communication complexity of convex optimization
Published: (2003)

A conflict sense routing protocol and its performance for hypercubes
Published: (2003)

Channel reuse multiple access protocol for bidirectional bus networks
Published: (2003)

Distributed optimization algorithms with communications
Published: (2002)

A failsafe distributed protocol for minimum delay routing
Published: (2002)

The information-based complexity of dynamic programming
Published: (2003)

The complexity of optimal queueing network control
Published: (2003)

On the distributions of optimized multiscale representations
Published: (2003)

On the communication complexity of solving a polynominal equation
Published: (2003)

Complexity of stability and controllability of elementary hybrid systems
Published: (2003)

The time complexity of maximum matching by simulated annealing
Published: (2003)

Complexity theoretic aspects of problems in control theory
Published: (2003)

Space-time characteristics of ALOHA protocols in high speed birdirectional bus networks
Published: (2003)

Generation of architectures for distributed intelligence systems
Published: (2003)

Delays in acyclical distributed decisionmaking organizations
Published: (2003)

Human organizations as distributed intelligence systems
Published: (2003)

DTQDB : a fair and fully utilized media access protocol for dual bus networks
Published: (2003)

Some complexity results about packet radio networks
Published: (2003)

An adaptive distributed Dijkstra shortest path algorithm
Published: (2003)

Synthesis of distributed command and control for the outer air battle
Published: (2003)

Parallel and distributed iterative algorithms : a selective survey
Published: (2003)

Optimum configuration for distributed teams of two decision-makers
Published: (2003)