Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA,

Computing and Combinatorics

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

Fu, Bin, Du, Ding-Zhu (Eds.)

2011, XIII, 650p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$99.00

(net) price for USA

ISBN 978-3-642-22685-4

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$129.00

(net) price for USA

ISBN 978-3-642-22684-7

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • <p>Up-to-date results </p><p>Fast-track conference proceedings </p><p>State-of-the-art research</p>
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.

Content Level » Research

Keywords » algorithmic geometry - algorithmic learning - combinatorial optimization - discrete mathematics - graph algorithms - graph computation - network computation

Related subjects » Artificial Intelligence - Communication Networks - Image Processing - Theoretical Computer Science

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Algorithm Analysis and Problem Complexity.