FIRST CALL FOR PAPERS
LATIN 2016
The 12th Latin American Theoretical Informatics
Symposium (LATIN 2016) will be held in Ensenada
from April 11-15, 2016.
(Sorry for duplicates)
Previous editions of LATIN took place in
Sao Paulo, Brazil (1992),
Valparaiso, Chile (1995),
Campinas, Brazil (1998),
Punta del Este, Uruguay (2000),
Cancun, Mexico (2002),
Buenos Aires, Argentina (2004),
Valdivia, Chile (2006),
Buzios, Brazil (2008),
Oaxaca, Mexico (2010),
Arequipa, Peru (2012),
Montevideo, Uruguay (2014).
Important Dates
Submission deadline:
Sep. 20, 2015 (abstract)
Sep. 27, 2015 (full paper)
Author notification:
Nov. 29, 2015
Final version due:
Dec. 13, 2015
Scope:
The Symposium is devoted to different areas
in theoretical computer science, including,
but not limited to: algorithms (approximation,
online, randomized, algorithmic game theory),
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.
Papers are to be submitted electronically,
following the guidelines on the conference
web page
Additional Details can be found in:
http://latin2016.natix.org/
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************