000			03797cmm a22004215i 4500
003			EG-CaNGU
005			20250106134914.0
008			250105t2011 gw fo d eng d
020			_a9783642153273 _qpaperback.
020			_a9783642153280 _qonline resource.
040			_aBTCTA _beng _cBTCTA _erda _dYDXCP _dELW _dCDX _dG7G _dWRM _dMCW _dOHX _dN5L _dOCLCF _dDLC _dEG-CaNGU
041	1		_aeng _hger
245	0	0	_aAlgorithms unplugged /
250			_aFirst edition.
264		1	_aBerlin, Germany : _bSpringer-Verlag, _c[2011]
264		4	_c©2011
300			_a1 online resource (x, 406 pages) : _billustrations
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
504			_aIncludes bibliographical references.
505	0	0	_aPart I: Searching and sorting. -- Overview -- Binary search -- Insertion sort -- Fast sorting algorithms -- Parallel sorting - the need for speed -- Topological sorting - how should I begin to complete my to do list? -- Searching texts - but fast! The Boyer-Moore-Horspool Algorithm -- Depth-first search (Ariadne & Co.) -- Pledge's Algorithm -- Cycles in graphs -- PageRank - what is really relevant in the world-wide web? -- Part II: Arithmetic and encryption. -- Overview -- Multiplication of long integers - faster than long multiplication -- The Euclidean Algorithm -- The Sieve of Eratosthenes - how fast can we compute a prime number table? -- One-way functions. Mind the trap - escape only for the initiated -- The one-time pad algorithm - the simplest and most secure way to keep secrets -- Public-key cryptography -- How to share a secret -- Playing poker by email -- Fingerprinting -- Hashing -- Codes - protecting data against errors and loss -- Part III: Planning, coordination and simulation. -- Overview -- Broadcasting - how can I quickly disseminate information? -- Converting numbers into English words -- Majority - who gets elected class rep? -- Random numbers - how fast can we create randomness in computers? -- Winning strategies for a matchstick game -- Scheduling of tournaments or sports leagues -- Eulerian Circuits -- High-speed circles -- Gauss-Seidel Iterative Method for computation of physical problems -- Dynamic programming - evolutionary distance -- Part IV: Optimization. -- Overview -- Shortest paths -- Minimum spanning trees (sometimes greed pays off...) -- Maximum flows - towards the stadium during rush hour -- Marriage broker -- The smallest enclosing circle - a contribution to democracy from Switzerland -- Online algorithms - what is it worth to know the future? -- Bin packing or "how do I get my stuff into the boxes?" -- The knapsack problem -- The travelling salesman problem -- Simulated annealing.
506			_aAvailable on-campus and off-campus with authorized login.
546			_aTranslated into English from German.
650		7	_aComputer algorithms. _2NGU-sh _93907
650		7	_aComputer algorithms. _2NGU-sh _93907
650		7	_aComputer science _xmathematics. _2NGU-sh _94787
650		7	_aProblem solving. _2NGU-sh _92688
655		7	_aElectronic books. _2NGU-sh _91203
700	1		_aVöcking, Berthold, _eeditor. _94788
700	1		_aAlt, Helmut, _d1950-, _eeditor. _94789
700	1		_aDietzfelbinger, Martin, _eeditor. _94790
700	1		_aReischuk, Rüdiger, _eeditor. _94791
700	1		_aScheideler, Christian, _eeditor. _94792
700	1		_aVollmer, Heribert, _d1964-, _eeditor. _94793
700	1		_aWagner, Dorothea, _d1957-, _eeditor. _94794
856	4	0	_aOnline resource. _uhttps://mplbci.ekb.eg/EKBResearchers?url=https://link.springer.com/book/10.1007/978-3-642-15328-0 _zSign in EKB is required.
999			_c1615 _d1615