ENGLISH

Computing and Combinatorics: 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings

By Binay Bhattacharya , Tsunehiko Kameda (auth.) , Joachim Gudmundsson , Julián Mestre , Taso Viglas (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2012
ISBN
9783642322402, 3642322409, 9783642322419, 3642322417
DOI
10.1007/978-3-642-32241-9
Language
english
Format
PDF
Filesize
8 MB (8485937 bytes)
Series
Lecture Notes in Computer Science 7434
Edition
1
Pages
606\617
Time added
2013-04-24 17:00:00
Algorithm Analysis and Problem Complexity; Discret

Description

This book constitutes the refereed proceedings of the 18th Annual International Conference on Computing and Combinatorics, held in Sydney, Australia, in August 2012. The 50 revised full papers presented were carefully reviewed and selected from 121 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.

Similar books