ENGLISH

LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings

By Evangelos Kranakis , Gonzalo Navarro , Edgar Chávez (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2016
ISBN
978-3-662-49528-5, 978-3-662-49529-2
DOI
10.1007/978-3-662-49529-2
Language
english
Format
PDF
Filesize
15 MB (15343609 bytes)
Series
Lecture Notes in Computer Science 9644
Edition
1
Pages
XXVI, 714\736
Time added
2016-07-20 04:00:00
Algorithm Analysis and Problem Complexity; Discret

Description

This book constitutes the refereed proceedings of the 12th Latin American Symposium on Theoretical Informatics, LATIN 2016, held in Ensenada, Mexico, in April 2016. The 52 papers presented together with 5 abstracts were carefully reviewed and selected from 131 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on algorithms (approximation, online, randomized, algorithmic game theory, etc.), analytic combinatorics and analysis of algorithms, automata theory and formal languages, coding theory and data compression, combinatorial algorithms, combinatorial optimization, combinatorics and graph theory, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptology, databases and information retrieval, data structures, formal methods and security, Internet and the web, parallel and distributed computing, pattern matching, programming language theory, and random structures.

Similar books