Librería:
GreatBookPricesUK, Woodford Green, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Vendedor de AbeBooks desde 28 de enero de 2020
Unread book in perfect condition. N° de ref. del artículo 47912356
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:
Fully 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.
Acerca del autor:
Dr. Antti Laaksonen has worked as a teacher and researcher at the University of Helsinki and Aalto University, Finland. He has served as one of the organizers of the Finnish Olympiad in Informatics since 2008, and as the Scientific Chair of the Baltic Olympiad in Informatics in 2016. He has also coached and led the Finnish team at several international programming contests, including the International Olympiad in Informatics 2009–2016, and has established experience in teaching programming and algorithms.
Título: Guide to Competitive Programming : Learning ...
Editorial: Springer
Año de publicación: 2024
Encuadernación: Encuadernación de tapa blanda
Condición: As New
Edición: 3ª Edición
Librería: Brook Bookstore, Milano, MI, Italia
Condición: new. Nº de ref. del artículo: RVYCVWED3Y
Cantidad disponible: 20 disponibles
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
Condición: new. Nº de ref. del artículo: RVYCVWED3Y
Cantidad disponible: 20 disponibles
Librería: moluna, Greven, Alemania
Condición: 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. Nº de ref. del artículo: 1602275958
Cantidad disponible: 2 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: S0-9783031617935
Cantidad disponible: 15 disponibles
Librería: preigu, Osnabrück, Alemania
Taschenbuch. Condición: Neu. Guide to Competitive Programming | Learning and Improving Algorithms Through Contests | Antti Laaksonen | Taschenbuch | xviii | Englisch | 2024 | Springer | EAN 9783031617935 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Nº de ref. del artículo: 129292468
Cantidad disponible: 1 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 3rd edition. 367 pages. 9.25x6.10x9.25 inches. In Stock. Nº de ref. del artículo: __3031617932
Cantidad disponible: 2 disponibles
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. 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 Nature c/o IBS, Benzstrasse 21, 48619 Heek 368 pp. Englisch. Nº de ref. del artículo: 9783031617935
Cantidad disponible: 1 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783031617935
Cantidad disponible: 1 disponibles
Librería: Rheinberg-Buch Andreas Meier eK, Bergisch Gladbach, Alemania
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783031617935
Cantidad disponible: 2 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783031617935
Cantidad disponible: 2 disponibles