Latin 2014 Theoretical Informatics
Download Latin 2014 Theoretical Informatics full books in PDF, epub, and Kindle. Read online free Latin 2014 Theoretical Informatics ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
| Author | : Alberto Pardo |
| Publisher | : Springer |
| Total Pages | : 793 |
| Release | : 2014-03-24 |
| Genre | : Computers |
| ISBN | : 3642544231 |
This book constitutes the refereed proceedings of the 11th Latin American Symposium on Theoretical Informatics, LATIN 2014, held in Montevideo, Uruguay, in March/April 2014. The 65 papers presented together with 5 abstracts were carefully reviewed and selected from 192 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on complexity, computational geometry, graph drawing, automata, computability, algorithms on graphs, algorithms, random structures, complexity on graphs, analytic combinatorics, analytic and enumerative combinatorics, approximation algorithms, analysis of algorithms, computational algebra, applications to bioinformatics, budget problems and algorithms and data structures.
| Author | : Evangelos Kranakis |
| Publisher | : Springer |
| Total Pages | : 736 |
| Release | : 2016-03-21 |
| Genre | : Computers |
| ISBN | : 3662495295 |
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 | : Yoshiharu Kohayakawa |
| Publisher | : Springer Nature |
| Total Pages | : 653 |
| Release | : 2020-12-02 |
| Genre | : Computers |
| ISBN | : 3030617920 |
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 | : Michael A. Bender |
| Publisher | : Springer |
| Total Pages | : 904 |
| Release | : 2018-04-05 |
| Genre | : Computers |
| ISBN | : 3319774042 |
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 | : José A. Soto |
| Publisher | : Springer Nature |
| Total Pages | : 362 |
| Release | : |
| Genre | : |
| ISBN | : 3031556011 |
| Author | : Imre Bárány |
| Publisher | : Springer Nature |
| Total Pages | : 616 |
| Release | : 2020-02-04 |
| Genre | : Mathematics |
| ISBN | : 3662592045 |
This volume collects together research and survey papers written by invited speakers of the conference celebrating the 70th birthday of László Lovász. The topics covered include classical subjects such as extremal graph theory, coding theory, design theory, applications of linear algebra and combinatorial optimization, as well as recent trends such as extensions of graph limits, online or statistical versions of classical combinatorial problems, and new methods of derandomization. László Lovász is one of the pioneers in the interplay between discrete and continuous mathematics, and is a master at establishing unexpected connections, “building bridges” between seemingly distant fields. His invariably elegant and powerful ideas have produced new subfields in many areas, and his outstanding scientific work has defined and shaped many research directions in the last 50 years. The 14 contributions presented in this volume, all of which are connected to László Lovász's areas of research, offer an excellent overview of the state of the art of combinatorics and related topics and will be of interest to experienced specialists as well as young researchers.
| Author | : Cristina Bazgan |
| Publisher | : Springer Nature |
| Total Pages | : 538 |
| Release | : 2022-05-29 |
| Genre | : Computers |
| ISBN | : 3031066782 |
This book constitutes the refereed proceedings of the 33rd International Workshop on Combinatorial Algorithms, IWOCA 2022, which took place as a hybrid event in Trier, Germany, during June 7-9, 2022.The 35 papers presented in these proceedings were carefully reviewed and selected from 86 submissions. They deal with diverse topics related to combinatorial algorithms, such as algorithms and data structures; algorithmic and combinatorical aspects of cryptography and information security; algorithmic game theory and complexity of games; approximation algorithms; complexity theory; combinatorics and graph theory; combinatorial generation, enumeration and counting; combinatorial optimization; combinatorics of words; computational biology; computational geometry; decompositions and combinatorial designs; distributed and network algorithms; experimental combinatorics; fine-grained complexity; graph algorithms and modelling with graphs; graph drawing and graph labelling; network theory and temporal graphs; quantum computing and algorithms for quantum computers; online algorithms; parameterized and exact algorithms; probabilistic andrandomized algorithms; and streaming algorithms.
| Author | : Derek F. Holt |
| Publisher | : Cambridge University Press |
| Total Pages | : 307 |
| Release | : 2017-02-23 |
| Genre | : Computers |
| ISBN | : 1107152356 |
A reference book discussing applications of formal language theory to group theory, particularly geometric and computational group theory.
| Author | : Benjamin Steinberg |
| Publisher | : Walter de Gruyter GmbH & Co KG |
| Total Pages | : 418 |
| Release | : 2024-10-21 |
| Genre | : Mathematics |
| ISBN | : 3110984326 |
This reference discusses how automata and language theory can be used to understand solutions to solving equations in groups and word problems in groups. Examples presented include, how Fine scale complexity theory has entered group theory via these connections and how cellular automata, has been generalized into a group theoretic setting. Chapters written by experts in group theory and computer science explain these connections.
| Author | : Inge Li Gørtz |
| Publisher | : Springer |
| Total Pages | : 409 |
| Release | : 2014-06-25 |
| Genre | : Computers |
| ISBN | : 3319084046 |
This book constitutes the refereed proceedings of the 14th International Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2014, held in Copenhagen, Denmark, in July 2014. The 33 papers were carefully reviewed and selected from a total of 134 submissions. The papers present original research and cover a wide range of topics in the field of design and analysis of algorithms and data structures including but not limited to approximation algorithms, parameterized algorithms, computational biology, computational geometry and topology, distributed algorithms, external-memory algorithms, exponential algorithms, graph algorithms, online algorithms, optimization algorithms, randomized algorithms, streaming algorithms, string algorithms, sublinear algorithms and algorithmic game theory.
