|
Showing 1 - 3 of
3 matches in All Departments
This volume contains the proceedings of the Latin American
Theoretical Inf- matics (LATIN) conference that was held in Buenos
Aires, Argentina, April 5 8, 2004. The LATIN series of symposia was
launched in 1992 to foster interactions between the Latin American
community and computer scientists around the world. This was the
sixth event in the series, following S ao Paulo, Brazil (1992),
Valparaiso, Chile (1995), Campinas, Brazil (1998), Punta del Este,
Uruguay (2000), and Cancun, Mexico (2002). The proceedings of these
conferences were also published by Springer-Verlag in the Lecture
Notes in Computer Science series: Volumes 583, 911, 1380, 1776, and
2286, respectively. Also, as before, we published a selection of
the papers in a special issue of a prestigious journal. We received
178 submissions. Each paper was assigned to four program c- mittee
members, and 59 papers were selected. This was 80% more than the
previous record for the number of submissions. We feel lucky to
have been able to build on the solid foundation provided by the
increasingly successful previous LATINs. And we are very grateful
for the tireless work of Pablo Mart ?nez L opez, the Local
Arrangements Chair. Finally, we thank Springer-Verlag for
publishing these proceedings in its LNCS series."
This book constitutes the refereed proceedings of the 9th Annual
Symposium on Combinatorial Pattern Matching, CPM 98, held in
Piscataway, NJ, USA, in July 1998. The 17 revised full papers
presented were carefully reviewed and selected for inclusion in the
book. The papers address all current issues in combinatorial
pattern matching dealing with a variety of classical objects to be
matched as well as with DNA coding.
This book constitutes the proceedings of the 13th Latin American
Symposium on Theoretical Informatics, LATIN 2018, held in Buenos
Aires, Argentina, in April 2018. The 63 papers presented in this
volume were carefully reviewed and selected from 161 submissions.
The Symposium is devoted to different areas in theoretical computer
science, including, but not limited to: 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.
|
You may like...
Midnights
Taylor Swift
CD
R425
Discovery Miles 4 250
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
|