000			02972nam a22005175i 4500
001			978-3-540-27903-7
003			DE-He213
005			20161121230527.0
007			cr nn 008mamaa
008			100301s2005 gw | s |||| 0|eng d
020			_a9783540279037 _9978-3-540-27903-7
024	7		_a10.1007/3-540-27903-2 _2doi
050		4	_aQA76.6-76.66
072		7	_aUM _2bicssc
072		7	_aCOM051000 _2bisacsh
082	0	4	_a005.11 _223
100	1		_aHromkoviČ, Juraj. _eauthor.
245	1	0	_aDesign and Analysis of Randomized Algorithms _h[electronic resource] : _bIntroduction to Design Paradigms / _cby Juraj HromkoviČ.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2005.
300			_aXII, 277 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aTexts in Theoretical Computer Science An EATCS Series, _x1862-4499
505	0		_aFundamentals -- Foiling the Adversary -- Fingerprinting -- Success Amplification and Random Sampling -- Abundance of Witnesses -- Optimization and Random Rounding.
520			_aRandomness is a powerful phenomenon that can be harnessed to solve various problems in all areas of computer science. Randomized algorithms are often more efficient, simpler and, surprisingly, also more reliable than their deterministic counterparts. Computing tasks exist that require billions of years of computer work when solved using the fastest known deterministic algorithms, but they can be solved using randomized algorithms in a few minutes with negligible error probabilities. Introducing the fascinating world of randomness, this book systematically teaches the main algorithm design paradigms – foiling an adversary, abundance of witnesses, fingerprinting, amplification, and random sampling, etc. – while also providing a deep insight into the nature of success in randomization. Taking sufficient time to present motivations and to develop the reader's intuition, while being rigorous throughout, this text is a very effective and efficient introduction to this exciting field.
650		0	_aComputer science.
650		0	_aComputer programming.
650		0	_aComputers.
650		0	_aAlgorithms.
650		0	_aComputer science _xMathematics.
650	1	4	_aComputer Science.
650	2	4	_aProgramming Techniques.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aComputation by Abstract Devices.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aAlgorithms.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540239499
830		0	_aTexts in Theoretical Computer Science An EATCS Series, _x1862-4499
856	4	0	_uhttp://dx.doi.org/10.1007/3-540-27903-2
912			_aZDB-2-SCS
950			_aComputer Science (Springer-11645)
999			_c500107 _d500107