1 option
Combinatorial Algorithms : 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013. Revised Selected Papers / edited by Thierry Lecroq, Laurent Mouchard.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 8288.
- Theoretical Computer Science and General Issues ; 8288
- Language:
- English
- Subjects (All):
- Computer science--Mathematics.
- Computer science.
- Combinatorial analysis.
- Algorithms.
- Logic, Symbolic and mathematical.
- Data structures (Computer science).
- Discrete Mathematics in Computer Science.
- Combinatorics.
- Algorithm Analysis and Problem Complexity.
- Mathematical Logic and Formal Languages.
- Data Structures.
- Symbolic and Algebraic Manipulation.
- Local Subjects:
- Discrete Mathematics in Computer Science.
- Combinatorics.
- Algorithm Analysis and Problem Complexity.
- Mathematical Logic and Formal Languages.
- Data Structures.
- Symbolic and Algebraic Manipulation.
- Physical Description:
- 1 online resource (XXII, 474 pages) : 135 illustrations.
- Edition:
- First edition 2013.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.
- System Details:
- text file PDF
- Summary:
- This book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Combinatorial Algorithms, IWOCA 2013, held in Rouen, France, in July 2013. The 33 revised full papers presented together with 10 short papers and 5 invited talks were carefully reviewed and selected from a total of 91 submissions. The papers are organized in topical sections on algorithms on graphs; algorithms on strings; discrete geometry; and satisfiability.
- Contents:
- Algorithms on graphs
- Algorithms on strings
- Discrete geometry
- Satisfiability.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-642-45278-9
- 9783642452789
- 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.