Computing and Combinatorics

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

Bin Fu, Ding-Zhu Du (Herausgeber)

Buch | Softcover

XIII, 650 Seiten

2011 | 2011
Springer Berlin (Verlag)
978-3-642-22684-7 (ISBN)

Infos

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.

Produkt-Details

• Erscheint lt. Verlag: 18.7.2011
• Reihe/Serie: Lecture Notes in Computer Science
• Reihe/Serie: Theoretical Computer Science and General Issues
• Zusatzinfo: XIII, 650 p. 107 illus., 5 illus. in color.
• Verlagsort: Berlin
• Sprache: englisch
• Maße: 155 x 235 mm
• Gewicht: 928 g
• Themenwelt: Informatik ► Theorie / Studium ► Algorithmen
• Themenwelt: Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
• Schlagworte: Algorithm analysis and problem complexity • algorithmic geometry • Algorithmic Learning • combinatorial optimization • Discrete Mathematics • Graph Algorithms • graph computation • network computation
• ISBN-10: 3-642-22684-1 / 3642226841
• ISBN-13: 978-3-642-22684-7 / 9783642226847
• Zustand: Neuware