Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
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.
Content Level »Research
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
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.