Computing and Combinatorics, Zhipeng Cai; Alexander Zelikovsky; Anu Bourgeois

Автор: Stanley
Название: Enumerative Combinatorics
ISBN: 1107602629 ISBN-13(EAN): 9781107602625
Издательство: Cambridge Academ
Рейтинг:
Цена: 39920.00 T
Наличие на складе: Есть
Описание: Richard Stanley`s two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of Volume 1 includes more than 300 new exercises, many with solutions, updated and expanded chapter bibliographies and substantial new material on permutation statistics.

Автор: Hung Q. Ngo
Название: Computing and Combinatorics
ISBN: 3642028810 ISBN-13(EAN): 9783642028816
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 15th Annual International Conference COCOON 2009 Niagara Falls NY USA July 1315 2009 Proceedings. .

Автор: Xiaodong Hu; Jie Wang
Название: Computing and Combinatorics
ISBN: 3540697322 ISBN-13(EAN): 9783540697329
Издательство: Springer
Рейтинг:
Цена: 107130.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Contains the refereed proceedings of the 14th Annual International Computing and Combinatorics Conference, COCOON 2008, held in Dalian, China, in June 2008. This work includes papers that are organized in topical sections on algorithms and data structures, algorithmic game theory and online algorithms, and computational biology and bioinformatics.

Автор: Dinh
Название: Computing and Combinatorics
ISBN: 3319426338 ISBN-13(EAN): 9783319426334
Издательство: Springer
Рейтинг:
Цена: 76400.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 22nd International Conference on Computing and Combinatorics, COCOON 2016, held in Ho Chi Minh City, Vietnam, in August 2016. The papers cover various topics including: Theory and Algorithms; Parameterized Complexity and Algorithms; Scheduling Algorithms and Circuit Complexity;

Автор: Yixin Cao; Jianer Chen
Название: Computing and Combinatorics
ISBN: 3319623885 ISBN-13(EAN): 9783319623887
Издательство: Springer
Рейтинг:
Цена: 83850.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The papers cover various topics, including algorithms and data structures, complexity theory and computability, algorithmic game theory, computational learning theory, cryptography, computationalbiology, computational geometry and number theory, graph theory, and parallel and distributed computing.

Автор: Dachuan Xu; Donglei Du; Dingzhu Du
Название: Computing and Combinatorics
ISBN: 3319213970 ISBN-13(EAN): 9783319213972
Издательство: Springer
Рейтинг:
Цена: 81990.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 21st International Conference on Computing and Combinatorics, COCOON 2015, held in Beijing, China, in August 2015. database theory, computational biology and bioinformatics; computational algebra, geometry, number theory, graph drawing and information visualization;

Автор: Ding-Zhu Du; Peter Eades; Vladimir Estivill-Castro
Название: Computing and Combinatorics
ISBN: 3540677879 ISBN-13(EAN): 9783540677871
Издательство: Springer
Рейтинг:
Цена: 83850.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This text constitutes the refereed proceedings of the 6th Annual International Conference on Computing and Combinatorics, COCOON 2000, held in Sydney, Australia in July 2000.

Автор: Ding-Zhu Du; Guochuan Zhang
Название: Computing and Combinatorics
ISBN: 3642387675 ISBN-13(EAN): 9783642387678
Издательство: Springer
Рейтинг:
Цена: 46570.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: There was a co-organized workshop on discrete algorithms of which 8 short papers were accepted and a workshop on computational social networks where 12 papers out of 25 submissions were accepted.

Автор: Takao Asano; Hiroshi Imai; D.T. Lee; Shin-ichi Nak
Название: Computing and Combinatorics
ISBN: 3540662006 ISBN-13(EAN): 9783540662006
Издательство: Springer
Рейтинг:
Цена: 83850.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume constitutes the proceedings of the 5th Annual International Conference on Computing and Combinatorics held in July 1999. The papers are organized in topical sections including data structures, computational biology, graph drawing, discrete mathematics and graph algorithms.

Автор: Martin Charles Golumbic; Irith Ben-Arroyo Hartman
Название: Graph Theory, Combinatorics and Algorithms
ISBN: 1441937234 ISBN-13(EAN): 9781441937230
Издательство: Springer
Рейтинг:
Цена: 121110.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering.

Автор: Daniel Krob; Alexander A. Mikhalev; Alexander V. M
Название: Formal Power Series and Algebraic Combinatorics
ISBN: 3642086624 ISBN-13(EAN): 9783642086625
Издательство: Springer
Рейтинг:
Цена: 222670.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: SFCA/FPSAC (Series Formelles et Combinatoire Algebrique/Formal Power Se- ries and Algebraic Combinatorics) is a series of international conferences that are held annually since 1988, alternating between Europe and North America. They usually take place at the end of the academic year, between June and July depending on the local organizing constraints. SFCA/FPSAC has now become one of the most important annual inter- national meetings for the algebraic and bijective combinatorics community. The conference is indeed one of the key international exchange place of ideas between all researchers involved in this emerging exciting area. SFCA/FPSAC'OO is the 12th in the series. It will take place in Moscow (Russia) from June 26 to June 30, 2000. Previous SFCA/FPSAC conferences were organized in Lille (88), Paris (90), Bordeaux (91), Montreal (92), Florence (93), Rutgers (94), Marne-la-Vallee (95), Minneapolis (96), Vienna (97), Toronto (98) and Barcelona (99). SFCA/FPSAC'OO is co-organized by the Center of New Information Tech- nologies (CNIT) of Moscow State University, the Laboratoire d'Informatique AI- gorithmique: Fondements et Applications (LIAFA) of University Paris 7 and the Maison de l'Informatique et des Mathematiques Discretes (MIMD). The SFCA/FPSAC'OO conference covers all main areas of algebraic combi- natorics and bijective combinatorics (including asymptotic analysis, all sorts of enumeration, representation theory of classical groups and classical Lie algebras, symmetric functions, etc). A special stress was also put this year on combinato- rial and computer algebra.

Автор: Gyula O.H. Katona; Alexander Schrijver; Tam?s Sz?n
Название: Fete of Combinatorics and Computer Science
ISBN: 3662506424 ISBN-13(EAN): 9783662506424
Издательство: Springer
Рейтинг:
Цена: 125770.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Based on the contributions to Laszlo Lovasz`s 60th anniversary, Fete of Combinatorics and Computer Science provides a collection of articles on discrete mathematics and theoretical computer science. Readers will find a discussion of the state-of-the-art in the field.