Fr. 69.00

Computing and Combinatorics - 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014, Proceedings

English · Paperback / Softback

Shipping usually within 1 to 2 weeks (title will be printed to order)

Description

Read more

This book constitutes the refereed proceedings of the 20th International Conference on Computing and Combinatorics, COCOON 2014, held in Atlanta, GA, USA, in August 2014. The 51 revised full papers presented were carefully reviewed and selected from 110 submissions. There was a co-organized workshop on computational social networks (CSoNet 2014) where 8 papers were accepted. The papers cover the following topics: sampling and randomized methods; logic, algebra and automata; database and data structures; parameterized complexity and algorithms; computational complexity; computational biology and computational geometry; approximation algorithm; graph theory and algorithms; game theory and cryptography; scheduling algorithms and circuit complexity and CSoNet.

List of contents

Sampling and Randomized Methods.- Logic, Algebra and Automata.- Database and Data Structures.- Parameterized Complexity and Algorithms.- Computational Complexity.-Computational Biology and Computational Geometry.- Approximation Algorithm.- Graph Theory and Algorithms.- Theory and Cryptography.- Scheduling Algorithms and Circuit Complexity.- CSoNet.

Summary

This book constitutes the refereed proceedings of the 20th International Conference on Computing and Combinatorics, COCOON 2014, held in Atlanta, GA, USA, in August 2014. The 51 revised full papers presented were carefully reviewed and selected from 110 submissions. There was a co-organized workshop on computational social networks (CSoNet 2014) where 8 papers were accepted. The papers cover the following topics: sampling and randomized methods; logic, algebra and automata; database and data structures; parameterized complexity and algorithms; computational complexity; computational biology and computational geometry; approximation algorithm; graph theory and algorithms; game theory and cryptography; scheduling algorithms and circuit complexity and CSoNet.

Product details

Assisted by Anu Bourgeois (Editor), Anu G. Bourgeois (Editor), Zhipeng Cai (Editor), Alexande Zelikovsky (Editor), Alexander Zelikovsky (Editor)
Publisher Springer, Berlin
 
Languages English
Product format Paperback / Softback
Released 04.06.2014
 
EAN 9783319087825
ISBN 978-3-31-908782-5
No. of pages 692
Dimensions 157 mm x 236 mm x 38 mm
Weight 1054 g
Illustrations XVI, 692 p. 126 illus.
Series Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Lecture Notes in Computer Science / Theoretical Computer Science and General Issues
Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Subject Natural sciences, medicine, IT, technology > Mathematics > Probability theory, stochastic theory, mathematical statistics

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.