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.
Reihe
Sprache
Verlagsort
Verlagsgruppe
Illustrationen
137
137 s/w Abbildungen
XXX, 767 p. 137 illus.
Dateigröße
ISBN-13
978-3-642-54423-1 (9783642544231)
DOI
10.1007/978-3-642-54423-1
Schweitzer Klassifikation
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.
