1 option
Computing and Combinatorics : 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014, Proceedings / edited by Zhipeng Cai, Alexander Zelikovsky, Anu Bourgeois.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 8591
- Theoretical Computer Science and General Issues, 2512-2029 ; 8591
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer science-Mathematics.
- Discrete mathematics.
- Computer networks.
- Computer science.
- Artificial intelligence.
- Discrete Mathematics in Computer Science.
- Computer Communication Networks.
- Theory of Computation.
- Computer Science Logic and Foundations of Programming.
- Artificial Intelligence.
- Local Subjects:
- Algorithms.
- Discrete Mathematics in Computer Science.
- Computer Communication Networks.
- Theory of Computation.
- Computer Science Logic and Foundations of Programming.
- Artificial Intelligence.
- Physical Description:
- 1 online resource (XVI, 692 pages) : 126 illustrations
- Edition:
- 1st ed. 2014.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2014.
- System Details:
- text file PDF
- 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.
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-08783-2
- 9783319087832
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.