Description
LATIN 2014: Theoretical Informatics, 2014
11th Latin American Symposium, Montevideo, Uruguay, March 31 -- April 4, 2014. Proceedings
Theoretical Computer Science and General Issues Series
Coordinators: Pardo Alberto, Viola Alfredo
Language: EnglishSubjects for LATIN 2014: Theoretical Informatics:
Keywords
algorithms; approximation algorithms; automata; budget problems; combinatorics; complexity on graphs; computability; computational complexity; computational geometry; data structures; discrete mathematics; game theory; graph algorithms; graph coloring; graph drawing; planar graphs; random structures; theoretical computer science; theory of computation; algorithm analysis and problem complexity
Publication date: 03-2014
767 p. · 15.5x23.5 cm · Paperback
767 p. · 15.5x23.5 cm · Paperback
Description
/li>Contents
/li>
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.
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.
© 2024 LAVOISIER S.A.S.