First Course in Algorithms Through Puzzles

Ryuhei Uehara

ISBN 10: 9819680964 / ISBN 13: 9789819680962

Published by Springer, Springer Jan 2026, 2026

About this Item

This item is printed on demand - Print on Demand Titel. Neuware -This textbook introduces basic algorithms and explains their analytical methods. All algorithms and methods introduced in this book are well known and frequently used in real programs. Intended to be self-contained, the contents start with the basic models, and no prerequisite knowledge is required. This book is appropriate for undergraduate students in computer science, mathematics, and engineering as a textbook, and is also appropriate for self-study by beginners who are interested in the fascinating field of algorithms.More than 40 exercises are distributed throughout the text, and their difficulty levels are indicated. Solutions and comments for all the exercises are provided in the last chapter. These detailed solutions will enable readers to follow the author s steps to solve problems and to gain a better understanding of the contents.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 204 pp. Englisch.

Seller Inventory # 9789819680962

Bibliographic Details

• Title: First Course in Algorithms Through Puzzles
• Publisher: Springer, Springer Jan 2026
• Publication Date: 2026
• Language: English
• ISBN 10: 9819680964
• ISBN 13: 9789819680962
• Binding: Buch
• Edition: 2nd Edition
• Condition: Neu
• Dimensions: 241W x 160H x 17D millimeters 241 millimeters width by 160 millimeters height by 17 millimeters depth
• Weight: 475 grams

About this title

Synopsis

This textbook introduces basic algorithms and explains their analytical methods. All algorithms and methods introduced in this book are well known and frequently used in real programs. Intended to be self-contained, the contents start with the basic models, and no prerequisite knowledge is required. This book is appropriate for undergraduate students in computer science, mathematics, and engineering as a textbook, and is also appropriate for self-study by beginners who are interested in the fascinating field of algorithms.

More than 40 exercises are distributed throughout the text, and their difficulty levels are indicated. Solutions and comments for all the exercises are provided in the last chapter. These detailed solutions will enable readers to follow the author’s steps to solve problems and to gain a better understanding of the contents.

 

About the Author

Ryuhei Uehara is a professor in the School of Information Science at the Japan Advanced Institute of Science and Technology. He was a researcher at CANON Inc. Later, he joined Tokyo Woman's Christian University as an assistant professor and was later also a lecturer and associate professor at Komazawa University. He had been a visiting scholar at the University of Waterloo (Canada), the Massachusetts Institute of Technology (USA), Simon Fraser University (Canada), the Université libre de Bruxelles (Belgium), ETH Zürich (Switzerland), and the Universitat Politècnica de Catalunya (Spain).  His research interests include computational complexity, algorithms and data structures, and graph algorithms. He is especially engrossed in computational origami, games, and puzzles from the viewpoints of theoretical computer science. He is one of two translators of the New Martin Gardner Mathematical Library into Japanese.