1 option
Combinatorial Algorithms : 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers / edited by Zsuzsanna Lipták, William F. Smyth.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 9538
- Theoretical Computer Science and General Issues, 2512-2029 ; 9538
- Language:
- English
- Subjects (All):
- Computer science-Mathematics.
- Discrete mathematics.
- Algorithms.
- Machine theory.
- Artificial intelligence-Data processing.
- Bioinformatics.
- Discrete Mathematics in Computer Science.
- Discrete Mathematics.
- Formal Languages and Automata Theory.
- Data Science.
- Computational and Systems Biology.
- Local Subjects:
- Discrete Mathematics in Computer Science.
- Discrete Mathematics.
- Algorithms.
- Formal Languages and Automata Theory.
- Data Science.
- Computational and Systems Biology.
- Physical Description:
- 1 online resource (XIX, 360 pages) : 62 illustrations in color.
- 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 thoroughly refereed post-workshop proceedings for the 26 International Workshop on combinatorial Algorithms, IWOCA 2015, held in Verona, Italy, in October 2015. The 29 revised full papers presented were carefully reviewed and selected from a total of 90 submissions. The topics of the papers include algorithms and data structures (including sequential, parallel, distributed, approximation, probabilistic, randomised, and on-line algorithms), algorithms on strings and graphs; applications (bioinformatics, music analysis, networking, and others); combinatorics on words; combinatorial enumeration; combinatorial optimization; complexity theory; computational biology; compression and information retrieval; cryptography and information security; decompositions and combinatorial designs; discrete and computational geometry; graph drawing and labeling; graph theory. .
- Contents:
- Algorithms and data structures (including sequential, parallel, distributed, approximation, probabilistic, randomised, and on-line algorithms)
- Algorithms on strings and graphs
- Applications (bioinformatics, music analysis, networking, and others)
- Combinatorics on words
- Combinatorial enumeration.-Combinatorial optimization
- Complexity theory
- Computational biology.-Compression and information retrieval
- Cryptography and information security.-Decompositions and combinatorial designs
- Discrete and computational geometry.-Graphy drawing and labeling
- Graph theory.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-29516-9
- 9783319295169
- 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.