Latin 2016 Theoretical Informatics

Author : Evangelos Kranakis,Gonzalo Navarro,Edgar Chávez
Publisher : Springer
Page : 714 pages
File Size : 50,7 Mb
Release : 2016-03-21
Category : Computers
ISBN : 9783662495292

Get Book

LATIN 2016: Theoretical Informatics by Evangelos Kranakis,Gonzalo Navarro,Edgar Chávez Pdf

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.

Author : Michael A. Bender,Martín Farach-Colton,Miguel A. Mosteiro
Publisher : Springer
Page : 904 pages
File Size : 42,6 Mb
Release : 2018-04-05
Category : Computers
ISBN : 9783319774046

Get Book

LATIN 2018: Theoretical Informatics by Michael A. Bender,Martín Farach-Colton,Miguel A. Mosteiro Pdf

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.

Author : Armando Castañeda,Francisco Rodríguez-Henríquez
Publisher : Springer Nature
Page : 782 pages
File Size : 47,9 Mb
Release : 2022-10-28
Category : Computers
ISBN : 9783031206245

Get Book

LATIN 2022: Theoretical Informatics by Armando Castañeda,Francisco Rodríguez-Henríquez Pdf

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.

Author : Yoshiharu Kohayakawa,Flávio Keidi Miyazawa
Publisher : Springer Nature
Page : 653 pages
File Size : 46,9 Mb
Release : 2020-12-02
Category : Computers
ISBN : 9783030617929

Get Book

LATIN 2020: Theoretical Informatics by Yoshiharu Kohayakawa,Flávio Keidi Miyazawa Pdf

This book constitutes the refereed proceedings of the 14th Latin American Symposium on Theoretical Informatics, LATIN 2020, held in Sao Paulo, Brazil, in January 2021. The 50 full papers presented in this book were carefully reviewed and selected from 136 submissions. The papers are grouped into these topics: approximation algorithms; parameterized algorithms; algorithms and data structures; computational geometry; complexity theory; quantum computing; neural networks and biologically inspired computing; randomization; combinatorics; analytic and enumerative combinatorics; graph theory. Due to the Corona pandemic the event was postponed from May 2020 to January 2021.

Author : José A. Soto
Publisher : Springer Nature
Page : 363 pages
File Size : 42,7 Mb
Release : 2024-06-26
Category : Electronic
ISBN : 9783031555985

Get Book

LATIN 2024: Theoretical Informatics by José A. Soto Pdf

Author : Alexander S. Kulikov,Gerhard J. Woeginger
Publisher : Springer
Page : 443 pages
File Size : 43,6 Mb
Release : 2016-06-02
Category : Computers
ISBN : 9783319341712

Get Book

Computer Science – Theory and Applications by Alexander S. Kulikov,Gerhard J. Woeginger Pdf

This book constitutes the proceedings of the 11th International Computer Science Symposium in Russia, CSR 2016, held in St. Petersburg, Russia, in June 2016. The 28 full papers presented in this volume were carefully reviewed and selected from 71 submissions. In addition the book contains 4 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas such as: include, but are not limited to: algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; computational models and concepts; algorithms for concurrent and distributed systems, networks; proof theory and applications of logic to computer science; model checking; automated reasoning; and deductive methods.

Author : Gaston H. Gonnet,Daniel Panario,Alfredo Viola
Publisher : Unknown
Page : 500 pages
File Size : 43,6 Mb
Release : 2014-01-15
Category : Electronic
ISBN : 3662199238

Get Book

Latin 2000 by Gaston H. Gonnet,Daniel Panario,Alfredo Viola Pdf

Author : W. Cary Huffman,Jon-Lark Kim,Patrick Solé
Publisher : CRC Press
Page : 998 pages
File Size : 53,5 Mb
Release : 2021-03-26
Category : Computers
ISBN : 9781351375108

Get Book

Concise Encyclopedia of Coding Theory by W. Cary Huffman,Jon-Lark Kim,Patrick Solé Pdf

Most coding theory experts date the origin of the subject with the 1948 publication of A Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has grown into a discipline with many practical applications (antennas, networks, memories), requiring various mathematical techniques, from commutative algebra, to semi-definite programming, to algebraic geometry. Most topics covered in the Concise Encyclopedia of Coding Theory are presented in short sections at an introductory level and progress from basic to advanced level, with definitions, examples, and many references. The book is divided into three parts: Part I fundamentals: cyclic codes, skew cyclic codes, quasi-cyclic codes, self-dual codes, codes and designs, codes over rings, convolutional codes, performance bounds Part II families: AG codes, group algebra codes, few-weight codes, Boolean function codes, codes over graphs Part III applications: alternative metrics, algorithmic techniques, interpolation decoding, pseudo-random sequences, lattices, quantum coding, space-time codes, network coding, distributed storage, secret-sharing, and code-based-cryptography. Features Suitable for students and researchers in a wide range of mathematical disciplines Contains many examples and references Most topics take the reader to the frontiers of research

Author : Claudio L. Lucchesi,Arnaldo V. Moura
Publisher : Unknown
Page : 412 pages
File Size : 40,9 Mb
Release : 2014-01-15
Category : Electronic
ISBN : 3662177889

Get Book

Latin'98 by Claudio L. Lucchesi,Arnaldo V. Moura Pdf

Author : Imre Simon
Publisher : Springer Science & Business Media
Page : 564 pages
File Size : 53,6 Mb
Release : 1992-03-11
Category : Computers
ISBN : 3540552847

Get Book

LATIN '92 by Imre Simon Pdf

This volume contains the proceedings of LATIN '92, a theoretical computer science symposium (Latin American Theoretical Informatics) held in S o Paulo, Brazil in April 1992. LATIN is intended to be a comprehensive symposium in the theory of computing, but for this first meeting the following areas were chosen for preferential coverage: algorithms and data structures, automata and formal languages, computability and complexity theory, computational geometry, cryptography, parallel and distributed computation, symbolic and algebraic computation, and combinatorial and algebraic aspects of computer science. The volume includesfull versions of the invited papers by 11 distinguished guest lecturers as well as 32 contributed papers selected from 66 submissions from authors with affiliations in 26 countries.

Author : Alejandro Lopez-Ortiz
Publisher : Unknown
Page : 730 pages
File Size : 44,8 Mb
Release : 2011-03-13
Category : Electronic
ISBN : 3642122019

Get Book

Latin 2010 by Alejandro Lopez-Ortiz Pdf

Author : Andrey O. Matveev
Publisher : CRC Press
Page : 338 pages
File Size : 42,5 Mb
Release : 2023-10-06
Category : Mathematics
ISBN : 9781000959352

Get Book

Symmetric Cycles by Andrey O. Matveev Pdf

This original research monograph concerns various aspects of how (based on the decompositions of vertices of hypercube graphs with respect to their symmetric cycles) the vertex sets of related discrete hypercubes, as well as the power sets of the corresponding ground sets, emerge from rank 2 oriented matroids, from underlying rank 2 systems of linear inequalities, and thus literally from arrangements of straight lines crossing a common point on a piece of paper. It reveals some beautiful and earlier-hidden fragments in the true foundations of discrete mathematics. The central observation made and discussed in the book from various viewpoints consists in that 2t subsets of a finite t-element set Et, which form in a natural way a cyclic structure (well, just t subsets that are the vertices of a path in the cycle suffice), allow us to construct any of 2t subsets of the set Et by means of a more than elementary voting procedure expressed in basic linear algebraic terms. The monograph will be of interest to researchers, students, and readers in the fields of discrete mathematics, theoretical computer science, Boolean function theory, enumerative combinatorics and combinatorics on words, combinatorial optimization, coding theory, and discrete and computational geometry.

Author : Dittmann, Christoph
Publisher : Universitätsverlag der TU Berlin
Page : 295 pages
File Size : 45,9 Mb
Release : 2017-03-08
Category : Computers
ISBN : 9783798328877

Get Book

Parity games, separations, and the modal μ-calculus by Dittmann, Christoph Pdf

The topics of this thesis are the modal μ-calculus and parity games. The modal μ-calculus is a common logic for model-checking in computer science. The model-checking problem of the modal μ-calculus is polynomial time equivalent to solving parity games, a 2-player game on labeled directed graphs. We present the first FPT algorithms (fixed-parameter tractable) for the model-checking problem of the modal μ-calculus on restricted classes of graphs, specifically on classes of bounded Kelly-width or bounded DAG-width. In this process we also prove a general decomposition theorem for the modal μ-calculus and define a useful notion of type for this logic. Then, assuming a class of parity games has a polynomial time algorithm solving it, we consider the problem of extending this algorithm to larger classes of parity games. In particular, we show that joining games, pasting games, or adding single vertices preserves polynomial-time solvability. It follows that parity games can be solved in polynomial time if their underlying undirected graph is a tournament, a complete bipartite graph, or a block graph. In the last chapter we present the first non-trivial formal proof about parity games. We explain a formal proof of positional determinacy of parity games in the proof assistant Isabelle/HOL. Die Themen dieser Dissertation sind der modale μ-Kalkül und Paritätsspiele. Der modale μ-Kalkül ist eine häufig eingesetzte Logik im Bereich des Model-Checkings in der Informatik. Das Model-Checking-Problem des modalen μ-Kalküls ist polynomialzeitäquivalent zum Lösen von Paritätsspielen, einem 2-Spielerspiel auf beschrifteten, gerichteten Graphen. Wir präsentieren die ersten FPT-Algorithmen (fixed-parameter tractable) für das Model-Checking-Problem des modalen μ-Kalküls auf Klassen von Graphen mit beschränkter Kelly-Weite oder beschränkter DAG-Weite. Für diesen Zweck beweisen wir einen allgemeineren Zerlegungssatz für den modalen μ-Kalkül und stellen eine nützliche Definition von Typen für diese Logik vor. Angenommen, eine Klasse von Paritätsspielen hat einen Polynomialzeit-Lösungs-Algorithmus, betrachten wir danach das Problem, diese Klassen zu erweitern auf eine Weise, sodass Polynomialzeit-Lösbarkeit erhalten bleibt. Wir zeigen, dass dies beim Join von Paritätsspielen, beim Pasting und beim Hinzufügen einzelner Knoten der Fall ist. Wir folgern daraus, dass das Lösen von Paritätsspielen in Polynomialzeit möglich ist, falls der unterliegende ungerichtete Graph ein Tournament, ein vollständiger bipartiter Graph oder ein Blockgraph ist. Im letzten Kapitel präsentieren wir den ersten nicht-trivialen formalen Beweis über Paritätsspiele. Wir stellen einen formalen Beweis für die positionale Determiniertheit von Paritätsspielen im Beweis-Assistenten Isabelle/HOL vor.

Author : José A. Soto
Publisher : Springer Nature
Page : 362 pages
File Size : 40,5 Mb
Release : 2024-06-26
Category : Electronic
ISBN : 9783031556012

Get Book

LATIN 2024: Theoretical Informatics by José A. Soto Pdf

Author : Alejandro López-Ortiz
Publisher : Springer Science & Business Media
Page : 726 pages
File Size : 40,7 Mb
Release : 2010-04-09
Category : Computers
ISBN : 9783642121999

Get Book

LATIN 2010: Theoretical Informatics by Alejandro López-Ortiz Pdf

This book constitutes the refereed proceedings of the 9th International Latin American Symposium on Theoretical Informatics, LATIN 2010, held in Oaxaca, Mexico; in April 2010. The 56 revised full papers presented together with the abstracts of 4 invited plenary talks were carefully reviewed and selected from 155 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.