Cantitate/Preț
Produs

Computing and Combinatorics: 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings: Lecture Notes in Computer Science, cartea 6842

Editat de Bin Fu, Ding-Zhu Du
en Limba Engleză Paperback – 18 iul 2011
This book constitutes the refereed proceedings of the 17th Annual International Conference on Computing and Combinatorics, held in Dallas, TX, USA, in August 2011. The 54 revised full papers presented were carefully reviewed and selected from 136 submissions. Topics covered are algorithms and data structures; algorithmic game theory and online algorithms; automata, languages, logic, and computability; combinatorics related to algorithms and complexity; complexity theory; computational learning theory and knowledge discovery; cryptography, reliability and security, and database theory; computational biology and bioinformatics; computational algebra, geometry, and number theory; graph drawing and information visualization; graph theory, communication networks, and optimization; parallel and distributed computing.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 34055 lei

Preț vechi: 42568 lei
-20% Nou

Puncte Express: 511

Preț estimativ în valută:
6518 6793$ 5426£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642226847
ISBN-10: 3642226841
Pagini: 663
Ilustrații: XIII, 650 p. 107 illus., 5 illus. in color.
Dimensiuni: 155 x 235 x 37 mm
Greutate: 0.92 kg
Ediția:2011
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Textul de pe ultima copertă

This book constitutes the refereed proceedings of the 16th Annual International Conference on Computing and Combinatorics, held in Dallas, TX, USA, in August 2011. The 54 revised full papers presented were carefully reviewed and selected from 136 submissions. Topics covered are algorithms and data structures; algorithmic game theory and online algorithms; automata, languages, logic, and computability; combinatorics related to algorithms and complexity; complexity theory; computational learning theory and knowledge discovery; cryptography, reliability and security, and database theory; computational biology and bioinformatics; computational algebra, geometry, and number theory; graph drawing and information visualization; graph theory, communication networks, and optimization; parallel and distributed computing.

Caracteristici

Up-to-date results Fast-track conference proceedings State-of-the-art research