1.

Record Nr.

UNISA996203273303316

Titolo

LATIN 2014: Theoretical Informatics [[electronic resource] ] : 11th Latin American Symposium, Montevideo, Uruguay, March 31 -- April 4, 2014. Proceedings / / edited by Alberto Pardo, Alfredo Viola

Pubbl/distr/stampa

Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014

ISBN

3-642-54423-1

Edizione

[1st ed. 2014.]

Descrizione fisica

1 online resource (XXX, 767 p. 137 illus.)

Collana

Theoretical Computer Science and General Issues, , 2512-2029 ; ; 8392

Classificazione

SS 4800

DAT 500f

Disciplina

005.1

Soggetti

Algorithms

Computer science—Mathematics

Discrete mathematics

Computer science

Artificial intelligence—Data processing

Discrete Mathematics in Computer Science

Theory of Computation

Data Science

Kongress2014.Montevideo

Conference papers and proceedings.

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Bibliographic Level Mode of Issuance: Monograph

Nota di contenuto

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.

Sommario/riassunto

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.