LATIN 2014: Theoretical Informatics : 11th Latin American Symposium, Montevideo, Uruguay, March 31 -- April 4, 2014. Proceedings

Alberto Pardo

ISBN 10: 3642544223 / ISBN 13: 9783642544224

Published by Springer, Springer, 2014

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9783642544224

Bibliographic Details

• Title: LATIN 2014: Theoretical Informatics : 11th Latin American Symposium, Montevideo, Uruguay, March 31 -- April 4, 2014. Proceedings
• Publisher: Springer, Springer
• Publication Date: 2014
• Language: English
• ISBN 10: 3642544223
• ISBN 13: 9783642544224
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 43D millimeters 235 millimeters width by 155 millimeters height by 43 millimeters depth
• Weight: 1188 grams

About this title

Synopsis

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.