Algorithms and Computation, Kam W. Ng; Prabhakar Raghavan; N.V. Balasubramania

Автор: Ding-Zhu Du; Xiang-Sun Zhang
Название: Algorithms and Computation
ISBN: 3540583254 ISBN-13(EAN): 9783540583257
Издательство: Springer
Рейтинг:
Цена: 111790.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The 79 research essays contained in this volume were selected from a total of 200 submissions. Presenting the results of Chinese research to the international scientific community for the first time, the volume covers theoretical and applicational aspects of algorithms and computation.

Автор: Sheung-Hung Poon; Md. Saidur Rahman; Hsu-Chun Yen
Название: WALCOM: Algorithms and Computation
ISBN: 3319539248 ISBN-13(EAN): 9783319539249
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the proceedings of the 11th International Workshop on Algorithms and Computation, WALCOM 2017, held in Hsinchu, Taiwan, in March 2017. The 35 full papers presented together with three invited talks were carefully reviewed and selected from 83 submissions. graph algorithms;

Автор: Nancy A. Lynch
Название: Distributed Algorithms,
ISBN: 1558603484 ISBN-13(EAN): 9781558603486
Издательство: Elsevier Science
Рейтинг:
Цена: 136990.00 T
Наличие на складе: Поставка под заказ.
Описание: A guide to designing, implementing and analyzing distributed algorithms. It covers problems including resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election and global snapshots.

Автор: Mertens Stephan, Moore Cristopher
Название: The Nature of Computation
ISBN: 0199233217 ISBN-13(EAN): 9780199233212
Издательство: Oxford Academ
Рейтинг:
Цена: 86590.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Why are some problems easy to solve, while others seem nearly impossible? What can we compute with a given amount of time or memory, and what cannot be computed at all? How will quantum physics change the landscape of computation? This book gives a playful and accessible introduction to the deep ideas of theoretical computer science.

Автор: Gilles Dowek
Название: Proofs and Algorithms: Introduction to Logic and Computability Theory
ISBN: 0857291203 ISBN-13(EAN): 9780857291202
Издательство: Springer
Рейтинг:
Цена: 32560.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation.Proofs and Algorithms: Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, G?del’s incompleteness theorem, the theorem asserting the semi-decidability of provability - that have profoundly changed our vision of reasoning, computation, and finally truth itself.Designed for undergraduate students, this book presents all that philosophers, mathematicians and computer scientists should know about logic.

Автор: Korte, Bernhard, Vygen, Jens
Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.
ISBN: 3642244874 ISBN-13(EAN): 9783642244872
Издательство: Springer
Рейтинг:
Цена: 60510.00 T
Наличие на складе: Невозможна поставка.
Описание: This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.

Автор: Khaled Elbassioni; Kazuhisa Makino
Название: Algorithms and Computation
ISBN: 3662489708 ISBN-13(EAN): 9783662489703
Издательство: Springer
Рейтинг:
Цена: 81990.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 26th InternationalSymposium on Algorithms and Computation, ISAAC 2015, held in Nagoya, Japan, inDecember 2015.The 65 revised full papers presented together with 3 invited talks were carefullyreviewed and selected from 180 submissions for inclusion in the book. graph algorithms and FPT;

Автор: Toshihide Ibaraki; Yasuyoshi Inagaki; Kazuo Iwama;
Название: Algorithms and Computation
ISBN: 3540562796 ISBN-13(EAN): 9783540562795
Издательство: Springer
Рейтинг:
Цена: 74530.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Presents the proceedings of a conference which focused on topics in the design and analysis of algorithms, computational complexity and the theory of computation, including automata and formal languages, computational geometry, data structures and parallel/distributed computing.

Автор: Tetsuo Asano; Yoshihide Igarashi; Hiroshi Nagamoch
Название: Algorithms and Computation
ISBN: 3540620486 ISBN-13(EAN): 9783540620488
Издательство: Springer
Рейтинг:
Цена: 83850.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: These conference proceedings cover such topics as computational geometry, graph theory, graph algorithms, combinatorial optimization, searching and sorting, networking, scheduling, and coding and cryptology.

Автор: Hon Wai Leong; Hiroshi Imai; Sanjay Jain
Название: Algorithms and Computation
ISBN: 3540638903 ISBN-13(EAN): 9783540638902
Издательство: Springer
Рейтинг:
Цена: 69870.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 8th International Symposium on Algorithms and Computation, ISAAC`97, held in Singapore in December 1997. The scope of the volume spans the whole area of algorithms from discrete mathematics and complexity theory to algorithms design and evaluation in a variety of applicational areas.

Автор: Seok-Hee Hong; Hiroshi Nagamochi; Takuro Fukunaga
Название: Algorithms and Computation
ISBN: 3540921818 ISBN-13(EAN): 9783540921813
Издательство: Springer
Рейтинг:
Цена: 139750.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: In the past, it was held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996), Singapore (1997), Daejeon (1998), Chennai (1999), Taipei (2000), Christchurch (2001), Vancouver (2002), Kyoto (2003), Hong Kong (2004), Hainan (2005), Kolkata (2006), and Sendai (2007).

Автор: Sandip Das; Ryuhei Uehara
Название: WALCOM: Algorithms and Computation
ISBN: 3642002013 ISBN-13(EAN): 9783642002014
Издательство: Springer
Рейтинг:
Цена: 81050.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Constitutes the refereed proceedings of the Third International Workshop on Algorithms and Computation, WALCOM 2009, held in Kolkata, India, in February 2009. This book presents the papers that feature original research in the areas of design and analysis of algorithms, computational geometry, graph drawing and graph algorithms.