laaksonen antti (31 résultats)

Paperback. Etat : Very Good. Second Edition 2020. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported.

Etat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Etat : New. pp. 320.

Etat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Etat : New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.

Etat : New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.

Etat : New. pp. 320.

Etat : New. pp. 320.

PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000.

Kartoniert / Broschiert. Etat : New. This textbook features new material on advanced topics, such as calculating Fourier transforms, finding minimum cost flows in graphs, and using automata in string problems. Critically, the text accessibly describes and shows how competitive programming i.

Taschenbuch. Etat : Neu. Neuware -This textbook features new material on advanced topics, such as calculating Fourier transforms, finding minimum cost flows in graphs, and using automata in string problems. Critically, the text accessibly describes and shows how competitive programming is a proven method of implementing and testing algorithms, as well as developing computational thinking and improving both programming and debugging skills.Topics and features:Introduces dynamic programming and other fundamental algorithm design techniques, and investigates a wide selection of graph algorithmsCompatible with the IOI Syllabus, yet also covering more advanced topics, such as maximum flows, Nim theory, and suffix structuresProvides advice for students aiming for the IOI contestSurveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programmingExamines the use of the Python language in competitive programmingDiscusses sorting algorithms and binary search, and examines a selection of data structures of the C++ standard libraryExplores how GenAI will impact on the future of the fieldCovers such advanced algorithm design topics as bit-parallelism and amortized analysis, and presents a focus on efficiently processing array range queriesDescribes a selection of more advanced topics, including square-root algorithms and dynamic programming optimizationFully updated, expanded and easy to follow, this core textbook/guide is an ideal reference for all students needing to learn algorithms and to practice for programming contests. Knowledge of programming basics is assumed, but previous background in algorithm design or programming contests is not necessary. With its breadth of topics, examples and references, the book is eminently suitable for both beginners and more experienced readers alike.

Etat : Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc.

Taschenbuch. Etat : Neu. Neuware -This textbook features new material on advanced topics, such as calculating Fourier transforms, finding minimum cost flows in graphs, and using automata in string problems. Critically, the text accessibly describes and shows how competitive programming is a proven method of implementing and testing algorithms, as well as developing computational thinking and improving both programming and debugging skills.Topics and features:Introduces dynamic programming and other fundamental algorithm design techniques, and investigates a wide selection of graph algorithmsCompatible with the IOI Syllabus, yet also covering more advanced topics, such as maximum flows, Nim theory, and suffix structuresProvidesadvice for students aiming for the IOI contestSurveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programmingExamines the use of the Python language in competitive programmingDiscusses sorting algorithms and binary search, and examines a selection of data structures of the C++ standard libraryExplores how GenAI will impact on the future of the fieldCovers such advanced algorithm design topics as bit-parallelism and amortized analysis, and presents a focus on efficiently processing array range queriesDescribes a selection of more advanced topics, including square-root algorithms and dynamic programming optimizationFully updated, expanded and easy to follow, this core textbook/guide is an ideal reference for all students needing to learn algorithms and to practice for programming contests. Knowledge of programming basics is assumed, but previous background in algorithm design or programming contests is not necessary. With its breadth of topics, examples and references, the book is eminently suitable for both beginners and more experienced readers alike. 368 pp. Englisch.

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This textbook features new material on advanced topics, such as calculating Fourier transforms, finding minimum cost flows in graphs, and using automata in string problems. Critically, the text accessibly describes and shows how competitive programming is a proven method of implementing and testing algorithms, as well as developing computational thinking and improving both programming and debugging skills.Topics and features:Introduces dynamic programming and other fundamental algorithm design techniques, and investigates a wide selection of graph algorithmsCompatible with the IOI Syllabus, yet also covering more advanced topics, such as maximum flows, Nim theory, and suffix structuresProvidesadvice for students aiming for the IOI contestSurveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programmingExamines the use of the Python language in competitive programmingDiscusses sorting algorithms and binary search, and examines a selection of data structures of the C++ standard libraryExplores how GenAI will impact on the future of the fieldCovers such advanced algorithm design topics as bit-parallelism and amortized analysis, and presents a focus on efficiently processing array range queriesDescribes a selection of more advanced topics, including square-root algorithms and dynamic programming optimizationFully updated, expanded and easy to follow, this core textbook/guide is an ideal reference for all students needing to learn algorithms and to practice for programming contests. Knowledge of programming basics is assumed, but previous background in algorithm design or programming contests is not necessary. With its breadth of topics, examples and references, the book is eminently suitable for both beginners and more experienced readers alike.

Etat : New.

Paperback. Etat : Brand New. 3rd edition. 367 pages. 9.25x6.10x9.25 inches. In Stock.

Etat : As New. Unread book in perfect condition.

Taschenbuch. Etat : Neu. Neuware -This textbook features new material on advanced topics, such as calculating Fourier transforms, finding minimum cost flows in graphs, and using automata in string problems. Critically, the text accessibly describes and shows how competitive programming is a proven method of implementing and testing algorithms, as well as developing computational thinking and improving both programming and debugging skills.Topics and features:Introduces dynamic programming and other fundamental algorithm design techniques, and investigates a wide selection of graph algorithmsCompatible with the IOI Syllabus, yet also covering more advanced topics, such as maximum flows, Nim theory, and suffix structuresProvides advice for students aiming for the IOI contestSurveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programmingExamines the use of the Python language in competitive programmingDiscusses sorting algorithms and binary search, and examines a selection of data structures of the C++ standard libraryExplores how GenAI will impact on the future of the fieldCovers such advanced algorithm design topics as bit-parallelism and amortized analysis, and presents a focus on efficiently processing array range queriesDescribes a selection of more advanced topics, including square-root algorithms and dynamic programming optimizationFully updated, expanded and easy to follow, this core textbook/guide is an ideal reference for all students needing to learn algorithms and to practice for programming contests. Knowledge of programming basics is assumed, but previous background in algorithm design or programming contests is not necessary. With its breadth of topics, examples and references, the book is eminently suitable for both beginners and more experienced readers alike.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 368 pp. Englisch.

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : New. Third Edition 2024 NO-PA16APR2015-KAP.

Papeback. Etat : New. Brand New! Fast Delivery US Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 7-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.

Etat : New.

Papeback. Etat : Brand New. Brand New! Fast Delivery, Delivery within 7-12 working Day Only, USA Edition Original Edition. Excellent Quality, Printing in English Language, Quick delivery by FEDEX & DHL. USPS & UPS Act. Our courier service is not available at PO BOX& APO BOX. Ship from India & United States.

paperback. Etat : Very good condition. Second Edition 2020. very clean,fast ship.

4°. 245 S. m. zahlr. Abb. Ppbd.

Paperback. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!

paperback. Etat : New. New. SHIPS FROM MULTIPLE LOCATIONS. book.

Etat : new. Pages: 328 Language: Russian. 9785970608784.

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This textbook features new material on advanced topics, such as calculating Fourier transforms, finding minimum cost flows in graphs, and using automata in string problems. Critically, the text accessibly describes and shows how competitive programming is a proven method of implementing and testing algorithms, as well as developing computational thinking and improving both programming and debugging skills.Topics and features:Introduces dynamic programming and other fundamental algorithm design techniques, and investigates a wide selection of graph algorithmsCompatible with the IOI Syllabus, yet also covering more advanced topics, such as maximum flows, Nim theory, and suffix structuresProvidesadvice for students aiming for the IOI contestSurveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programmingExamines the use of the Python language in competitive programmingDiscusses sorting algorithms and binary search, and examines a selection of data structures of the C++ standard libraryExplores how GenAI will impact on the future of the fieldCovers such advanced algorithm design topics as bit-parallelism and amortized analysis, and presents a focus on efficiently processing array range queriesDescribes a selection of more advanced topics, including square-root algorithms and dynamic programming optimizationFully updated, expanded and easy to follow, this core textbook/guide is an ideal reference for all students needing to learn algorithms and to practice for programming contests. Knowledge of programming basics is assumed, but previous background in algorithm design or programming contests is not necessary. With its breadth of topics, examples and references, the book is eminently suitable for both beginners and more experienced readers alike. 368 pp. Englisch.