Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March

LATIN 2014: Theoretical Informatics

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

Pardo, Alberto, Viola, Alfredo (Eds.)

2014, XXX, 767 p. 137 illus.

Available Formats:
eBook
Information

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.

 
$99.00

(net) price for USA

ISBN 978-3-642-54423-1

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$131.00

(net) price for USA

ISBN 978-3-642-54422-4

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

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

Related subjects » Theoretical Computer Science

Table of 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.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Algorithm Analysis and Problem Complexity.