Algorithms Unplugged

Algorithms specify the way computers process information and how they execute tasks. Many recent technological innovations and achievements rely on algorithmic ideas – they facilitate new applications in science, medicine, production, logistics, traffic, communi¬cation and entertainment. Efficient a...

Mô tả đầy đủ

Đã lưu trong:

Chi tiết về thư mục
Những tác giả chính:	V¨ocking, Berthold, Alt, Helmut, Dietzfelbinger, Martin, Reischuk, R¨udiger, Scheideler, Christian, Vollmer, Heribert, Wagner, Dorothea
Định dạng:	Sách
Ngôn ngữ:	English
Được phát hành:	Springer 2011
Những chủ đề:	Arithmetic Algorithms Computer simulations Cryptography
Truy cập trực tuyến:	https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/26076
Các nhãn:	Thêm thẻ Không có thẻ, Là người đầu tiên thẻ bản ghi này!

Thư viện lưu trữ:	Thư viện Trường Đại học Đà Lạt

id	oai:scholar.dlu.edu.vn:DLU123456789-26076
record_format	dspace
spelling	oai:scholar.dlu.edu.vn:DLU123456789-260762012-03-03T05:08:40Z Algorithms Unplugged V¨ocking, Berthold Alt, Helmut Dietzfelbinger, Martin Reischuk, R¨udiger Scheideler, Christian Vollmer, Heribert Wagner, Dorothea Arithmetic Algorithms Computer simulations Cryptography Algorithms specify the way computers process information and how they execute tasks. Many recent technological innovations and achievements rely on algorithmic ideas – they facilitate new applications in science, medicine, production, logistics, traffic, communi¬cation and entertainment. Efficient algorithms not only enable your personal computer to execute the newest generation of games with features unimaginable only a few years ago, they are also key to several recent scientific breakthroughs – for example, the sequencing of the human genome would not have been possible without the invention of new algorithmic ideas that speed up computations by several orders of magnitude. The greatest improvements in the area of algorithms rely on beautiful ideas for tackling computational tasks more efficiently. The problems solved are not restricted to arithmetic tasks in a narrow sense but often relate to exciting questions of nonmathematical flavor, such as: How can I find the exit out of a maze? How can I partition a treasure map so that the treasure can only be found if all parts of the map are recombined? How should I plan my trip to minimize cost? Solving these challenging problems requires logical reasoning, geometric and combinatorial imagination, and, last but not least, creativity – the skills needed for the design and analysis of algorithms. In this book we present some of the most beautiful algorithmic ideas in 41 articles written in colloquial, nontechnical language. Most of the articles arose out of an initiative among German-language universities to communicate the fascination of algorithms and computer science to high-school students. The book can be understood without any prior knowledge of algorithms and computing, and it will be an enlightening and fun read for students and interested adults. 2011-09-29T07:47:39Z 2011-09-29T07:47:39Z 2011 Book 978-3-642-15327-3 978-3-642-15328-0 https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/26076 en application/pdf Springer
institution	Thư viện Trường Đại học Đà Lạt
collection	Thư viện số
language	English
topic	Arithmetic Algorithms Computer simulations Cryptography
spellingShingle	Arithmetic Algorithms Computer simulations Cryptography V¨ocking, Berthold Alt, Helmut Dietzfelbinger, Martin Reischuk, R¨udiger Scheideler, Christian Vollmer, Heribert Wagner, Dorothea Algorithms Unplugged
description	Algorithms specify the way computers process information and how they execute tasks. Many recent technological innovations and achievements rely on algorithmic ideas – they facilitate new applications in science, medicine, production, logistics, traffic, communi¬cation and entertainment. Efficient algorithms not only enable your personal computer to execute the newest generation of games with features unimaginable only a few years ago, they are also key to several recent scientific breakthroughs – for example, the sequencing of the human genome would not have been possible without the invention of new algorithmic ideas that speed up computations by several orders of magnitude. The greatest improvements in the area of algorithms rely on beautiful ideas for tackling computational tasks more efficiently. The problems solved are not restricted to arithmetic tasks in a narrow sense but often relate to exciting questions of nonmathematical flavor, such as: How can I find the exit out of a maze? How can I partition a treasure map so that the treasure can only be found if all parts of the map are recombined? How should I plan my trip to minimize cost? Solving these challenging problems requires logical reasoning, geometric and combinatorial imagination, and, last but not least, creativity – the skills needed for the design and analysis of algorithms. In this book we present some of the most beautiful algorithmic ideas in 41 articles written in colloquial, nontechnical language. Most of the articles arose out of an initiative among German-language universities to communicate the fascination of algorithms and computer science to high-school students. The book can be understood without any prior knowledge of algorithms and computing, and it will be an enlightening and fun read for students and interested adults.
format	Book
author	V¨ocking, Berthold Alt, Helmut Dietzfelbinger, Martin Reischuk, R¨udiger Scheideler, Christian Vollmer, Heribert Wagner, Dorothea
author_facet	V¨ocking, Berthold Alt, Helmut Dietzfelbinger, Martin Reischuk, R¨udiger Scheideler, Christian Vollmer, Heribert Wagner, Dorothea
author_sort	V¨ocking, Berthold
title	Algorithms Unplugged
title_short	Algorithms Unplugged
title_full	Algorithms Unplugged
title_fullStr	Algorithms Unplugged
title_full_unstemmed	Algorithms Unplugged
title_sort	algorithms unplugged
publisher	Springer
publishDate	2011
url	https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/26076
_version_	1819779294007656448

Algorithms Unplugged

Những quyển sách tương tự