LATIN 2000: Theoretical Informatics

LATIN 2000: Theoretical Informatics

Author: Gaston H. Gonnet

Publisher: Springer Science & Business Media

Published: 2000-03-23

Total Pages: 497

ISBN-13: 3540673067

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 4th International Conference, Latin American Theoretical Informatics, LATIN 2000, held in Punta del Est, Uruguay, in April 2000. The 42 revised papers presented were carefully reviewed and selected from a total of 87 submissions from 26 countries. Also included are abstracts or full papers of several invited talks. The papers are organized in topical sections on random structures and algorithms, complexity, computational number theory and cryptography, algebraic algorithms, computability, automata and formal languages, and logic and programming theory.


LATIN 2002: Theoretical Informatics

LATIN 2002: Theoretical Informatics

Author: Sergio Rajsbaum

Publisher: Springer Science & Business Media

Published: 2002

Total Pages: 643

ISBN-13: 3540434003

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 5th International Symposium, Latin American Theoretical Informatics, LATIN 2002, held in Cancun, Mexico, in April 2002. The 44 revised full papers presented together with a tutorial and 7 abstracts of invited contributions were carefully reviewed and selected from a total of 104 submissions. The papers presented are devoted to a broad range of topics from theoretical computer science and mathematical foundations, with a certain focus on algorithmics and computations related to discrete structures.


LATIN 2012: Theoretical Informatics

LATIN 2012: Theoretical Informatics

Author: David Fernández-Baca

Publisher: Springer Science & Business Media

Published: 2012-03-30

Total Pages: 685

ISBN-13: 3642293433

DOWNLOAD EBOOK

This book constitutes the proceedings of the 10th Latin American Symposium on Theoretical Informatics, LATIN 2012, held in Arequipa, Peru, in April 2012. The 55 papers presented in this volume were carefully reviewed and selected from 153 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on algorithms, automata theory and formal languages, coding theory and data compression, algorithmic graph theory and combinatorics, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptography, theoretical aspects of databases and information retrieval, data structures, networks, logic in computer science, machine learning, mathematical programming, parallel and distributed computing, pattern matching, quantum computing and random structures.


LATIN 2004: Theoretical Informatics

LATIN 2004: Theoretical Informatics

Author: Martin Farach-Colton

Publisher: Springer Science & Business Media

Published: 2004-03-19

Total Pages: 642

ISBN-13: 3540212582

DOWNLOAD EBOOK

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.


LATIN 2022: Theoretical Informatics

LATIN 2022: Theoretical Informatics

Author: Armando Castañeda

Publisher: Springer Nature

Published: 2022-10-28

Total Pages: 782

ISBN-13: 303120624X

DOWNLOAD EBOOK

This book constitutes the proceedings of the 15th Latin American Symposium on Theoretical Informatics, LATIN 2022, which took place in Guanajuato, Mexico, in November 2022. The 46 papers presented in this volume were carefully reviewed and selected from 114 submissions. They were organized in topical sections as follows: Algorithms and Data Structures; Approximation Algorithms; Cryptography; Social Choice Theory; Theoretical Machine Learning; Automata Theory and Formal Languages; Combinatorics and Graph Theory; Complexity Theory; Computational Geometry. Chapter “Klee’s Measure Problem Made Oblivious” is available open access under a CC BY 4.0 license.


LATIN 2008: Theoretical Informatics

LATIN 2008: Theoretical Informatics

Author: Eduardo Sany Laber

Publisher: Springer Science & Business Media

Published: 2008-03-17

Total Pages: 808

ISBN-13: 3540787720

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 8th International Latin American Symposium on Theoretical Informatics, LATIN 2008, held in Búzios, Brazil, in April 2008. The 66 revised full papers presented together with the extended abstract of 1 invited paper were carefully reviewed and selected from 242 submissions. The papers address a veriety of topics in theoretical computer science with a certain focus on algorithms, automata theory and formal languages, coding theory and data compression, algorithmic graph theory and combinatorics, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptography, theoretical aspects of databases and information retrieval, data structures, networks, logic in computer science, machine learning, mathematical programming, parallel and distributed computing, pattern matching, quantum computing and random structures.


Developments in Language Theory

Developments in Language Theory

Author: Masami Ito

Publisher: Springer Science & Business Media

Published: 2003-06-20

Total Pages: 438

ISBN-13: 3540404317

DOWNLOAD EBOOK

The refereed proceedings of the 6th International Conference on Developments in Language Theory, DLT 2002, held in Kyoto, Japan in September 2002. The 28 revised full papers presented together with 8 invited papers were carefully reviewed and selected from 63 submissions. Among the topics addressed are grammars and acceptors for strings, graphs, arrays, etc; efficient algorithms for languages; combinatorial and algebraic properties of languages; decision problems; relations to complexity theory, logic picture description and analysis, DNA computing, cryptography, concurrency, quantum computing, and algebraic systems.


Validation of Stochastic Systems

Validation of Stochastic Systems

Author: Christel Baier

Publisher: Springer

Published: 2004-08-26

Total Pages: 473

ISBN-13: 3540246118

DOWNLOAD EBOOK

This tutorial volume presents a coherent and well-balanced introduction to the validation of stochastic systems; it is based on a GI/Dagstuhl research seminar. Supervised by the seminar organizers and volume editors, established researchers in the area as well as graduate students put together a collection of articles competently covering all relevant issues in the area. The lectures are organized in topical sections on: modeling stochastic systems, model checking of stochastic systems, representing large state spaces, deductive verification of stochastic systems.


Algorithms and Data Structures

Algorithms and Data Structures

Author: Frank Dehne

Publisher: Springer

Published: 2003-05-15

Total Pages: 496

ISBN-13: 3540446346

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and Data Structures, WADS 2001, held in Providence, RI, USA in August 2001. The 40 revised full papers presented were carefully reviewed and selected from a total of 89 submissions. Among the topics addressed are multiobjective optimization, computational graph theory, approximation, optimization, combinatorics, scheduling, Varanoi diagrams, packings, multi-party computation, polygons, searching, etc.