1 option
LATIN 2014: Theoretical Informatics : 11th Latin American Symposium, Montevideo, Uruguay, March 31 -- April 4, 2014. Proceedings / edited by Alberto Pardo, Alfredo Viola.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Theoretical computer science and general issues 2512-2029 ; SL 1, 8392
- Theoretical Computer Science and General Issues, 2512-2029 ; 8392
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer science-Mathematics.
- Discrete mathematics.
- Computer science.
- Artificial intelligence-Data processing.
- Discrete Mathematics in Computer Science.
- Theory of Computation.
- Data Science.
- Local Subjects:
- Algorithms.
- Discrete Mathematics in Computer Science.
- Theory of Computation.
- Data Science.
- Physical Description:
- 1 online resource (XXX, 767 pages) : 137 illustrations
- Edition:
- 1st ed. 2014.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2014.
- System Details:
- text file PDF
- Summary:
- This book constitutes the refereed proceedings of the 11th Latin American Symposium on Theoretical Informatics, LATIN 2014, held in Montevideo, Uruguay, in March/April 2014. The 65 papers presented together with 5 abstracts were carefully reviewed and selected from 192 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on complexity, computational geometry, graph drawing, automata, computability, algorithms on graphs, algorithms, random structures, complexity on graphs, analytic combinatorics, analytic and enumerative combinatorics, approximation algorithms, analysis of algorithms, computational algebra, applications to bioinformatics, budget problems, and algorithms and data structures.
- Contents:
- Complexity
- Computational geometry
- Graph drawing
- Automata
- Computability
- Algorithms on graphs
- Algorithms
- Random structures
- Complexity on graphs
- Analytic combinatorics
- Analytic and enumerative combinatorics
- Approximation algorithms
- Analysis of algorithms
- Computational algebra
- Applications to bioinformatics
- Budget problems.- Algorithms and data structures.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-642-54423-1
- 9783642544231
- 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.