1 option
Computing and Combinatorics : 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings / edited by Thang N. Dinh, My T. Thai.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 9797
- Theoretical Computer Science and General Issues, 2512-2029 ; 9797
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer science-Mathematics.
- Discrete mathematics.
- Computer science.
- Artificial intelligence.
- Computer networks.
- Machine theory.
- Discrete Mathematics in Computer Science.
- Theory of Computation.
- Artificial Intelligence.
- Computer Communication Networks.
- Formal Languages and Automata Theory.
- Local Subjects:
- Algorithms.
- Discrete Mathematics in Computer Science.
- Theory of Computation.
- Artificial Intelligence.
- Computer Communication Networks.
- Formal Languages and Automata Theory.
- Physical Description:
- 1 online resource (XIII, 634 pages) : 98 illustrations
- Edition:
- 1st ed. 2016.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2016.
- System Details:
- text file PDF
- Summary:
- This book constitutes the refereed proceedings of the 22nd International Conference on Computing and Combinatorics, COCOON 2016, held in Ho Chi Minh City, Vietnam, in August 2016. The 50 revised full papers papers presented in this book were carefully reviewed and selected from various submissions. The papers cover various topics including: Theory and Algorithms; Parameterized Complexity and Algorithms; Database and Data Structures; Computational Complexity; Approximation Algorithms; Cryptography; Network and Algorithms; Graph Theory and Algorithms; Computational Geometry; Scheduling Algorithms and Circuit Complexity; Computational Geometry and Computational Biology; and Logic, Algebra and Automata.
- Contents:
- Game Theory and Algorithms
- Parameterized Complexity and Algorithms
- Database and Data Structures
- Computational Complexity
- Approximation Algorithms
- Cryptography
- Network and Algorithms
- Graph Theory and Algorithms.-Computational Geometry
- Scheduling Algorithms and Circuit Complexity
- Computational Geometry and Computational Biology
- Logic, Algebra and Automata.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-42634-1
- 9783319426341
- 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.