LATIN 2014 : theoretical informatics : 11th Latin American Symposium, Montevideo, Uruguay, March 31-April 4, 2014, Proceedings / Alberto Pardo, Alfredo Viola (eds.).Material type: TextSeries: Serienbezeichnung | Lecture notes in computer science ; 8392. | LNCS sublibrary. SL 1, Theoretical computer science and general issues.Publisher: Heidelberg : Springer, 2014Description: 1 online resource (xxx, 767 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783642544231; 3642544231; 3642544223; 9783642544224Subject(s): Computer science -- Congresses | Computer scienceGenre/Form: Electronic books. | Ebook. | Conference papers and proceedings. Additional physical formats: Printed edition:: No titleDDC classification: 004 LOC classification: QA75.5Online resources: Click here to access online
|Item type||Current library||Collection||Call number||Status||Date due||Barcode||Item holds|
International conference proceedings.
Includes author index.
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.
Online resource; title from PDF title page (SpringerLink, viewed March 31, 2014).
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.