Narrow your search

Library

AP (4)

KDG (4)


Resource type

digital (4)


Language

English (4)


Year
From To Submit

2021 (1)

2020 (1)

2019 (1)

2009 (1)

Listing 1 - 4 of 4
Sort by

Digital
First Course in Algorithms Through Puzzles
Author:
ISBN: 9789811331886 Year: 2019 Publisher: Singapore Springer Singapore, Imprint: Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

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. Although details of the proofs and the analyses of algorithms are also provided, the mathematical descriptions in this book are not beyond the range of high school mathematics. Some famous real puzzles are also used to describe the algorithms. These puzzles are quite suitable for explaining the basic techniques of algorithms, which show how to solve these puzzles.


Digital
Introduction to Computational Origami : The World of New Computational Geometry
Author:
ISBN: 9789811544705 Year: 2020 Publisher: Singapore Springer Singapore, Imprint: Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book focuses on origami from the point of view of computer science. Ranging from basic theorems to the latest research results, the book introduces the considerably new and fertile research field of computational origami as computer science. Part I introduces basic knowledge of the geometry of development, also called a net, of a solid. Part II further details the topic of nets. In the science of nets, there are numerous unresolved issues, and mathematical characterization and the development of efficient algorithms by computer are closely connected with each other. Part III discusses folding models and their computational complexity. When a folding model is fixed, to find efficient ways of folding is to propose efficient algorithms. If this is difficult, it is intractable in terms of computational complexity. This is, precisely, an area for computer science research. Part IV presents some of the latest research topics as advanced problems. Commentaries on all exercises included in the last chapter. The contents are organized in a self-contained way, and no previous knowledge is required. This book is suitable for undergraduate, graduate, and even high school students, as well as researchers and engineers interested in origami.


Digital
WALCOM: Algorithms and Computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceedings
Authors: --- ---
ISBN: 9783030682118 9783030682125 9783030682101 Year: 2021 Publisher: Cham Springer International Publishing

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the proceedings of the 15th International Conference on Algorithms and Computation, WALCOM 2021, which was planned to take place in Yangon, Myanmar in February/March 2021. The conference changed to an online format due to the COVID-19 pandemic. The 24 full papers included in this volume were carefully reviewed and selected from a total of 60 submissions. They cover diverse areas of algorithms and computation, such as approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms, parameterized complexity, network optimization, online algorithms, randomized algorithms, and string algorithms. .


Digital
WALCOM: Algorithms and Computation : Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings
Authors: --- --- --- --- --- et al.
ISBN: 9783642002021 Year: 2009 Publisher: Berlin, Heidelberg Springer Berlin Heidelberg

Listing 1 - 4 of 4
Sort by