ENGLISH

Computing and Combinatorics: 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings

By Ding-Zhu Du (eds.) , Kazuhisa Makino , Suguru Tamaki , Masaki Yamamoto (auth.) , Bin Fu

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2011
ISBN
3642226841, 9783642226847
DOI
10.1007/978-3-642-22685-4
Language
english
Format
PDF
Filesize
5 MB (5748516 bytes)
Series
Lecture Notes in Computer Science 6842 Theoretical Computer Science and General Issues
Edition
1
Pages
650\665
Library
Kolxo3
Time added
2012-08-21 20:00:00
Algorithm Analysis and Problem Complexity; Discret

Description

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.

Similar books