My Account Log in

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.

SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online

View online
Format:
Book
Contributor:
Liptak, Zsuzsanna, editor.
Smyth, William F., editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 9538.
Theoretical Computer Science and General Issues ; 9538
Language:
English
Subjects (All):
Computer science--Mathematics.
Computer science.
Combinatorial analysis.
Algorithms.
Logic, Symbolic and mathematical.
Data structures (Computer science).
Bioinformatics.
Discrete Mathematics in Computer Science.
Combinatorics.
Algorithm Analysis and Problem Complexity.
Mathematical Logic and Formal Languages.
Data Structures.
Computational Biology/Bioinformatics.
Local Subjects:
Discrete Mathematics in Computer Science.
Combinatorics.
Algorithm Analysis and Problem Complexity.
Mathematical Logic and Formal Languages.
Data Structures.
Computational Biology/Bioinformatics.
Physical Description:
1 online resource (XIX, 360 pages) : 62 illustrations in color.
Edition:
First edition 2016.
Contained In:
Springer eBooks
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.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account