000			00590nam a2200169Ia 4500
999			_c4612 _d4612
008			161214s9999 xx 000 0 und d
020			_a0898714648 _c(hbk)
082			_a004.36 _bPEL
100			_aPeleg, David
245		0	_aDistributed computing : a locality-sensitive approach
260			_aPhiladelphia: _bSociety for Industrial and Applied Mathematics, _c2000
300			_axvi, 337 p.; _b: _c26 cm.
365			_aINR _b5221.00
490			_aSIAM monographs on discrete mathematics and applications
520			_aPresents the locality-sensitive approach to distributed network algorithms-the utilization of locality to simplify control structures and algorithms and reduce their costs. The author begins with an introductory exposition of distributed network algorithms focusing on topics that illustrate the role of locality in distributed algorithmic techniques. He then introduces locality-preserving network representations and describes sequential and distributed techniques for their construction. Finally, the applicability of the locality-sensitive approach is demonstrated through several applications. Gives a thorough exposition of network spanners and other locality-preserving network representations such as sparse covers and partitions. The book is useful for computer scientists interested in distributed computing, electrical engineers interested in network architectures and protocols, and for discrete mathematicians and graph theorists.
650			_aElectronic data processing
650			_aDistributed processing
650			_aDistributed network algorithms
650			_aApplied Sciences
650			_aVertex coloring
942			_2ddc _cBK