Conférences - Théorie de l'information, fondations de l'informatique

CIRM – Centre International de Rencontres Mathématiques

Centre International de Rencontres Mathématiques (CIRM)

University of South Florida

The series of International Conferences Developments in Language Theory provides a forum for presenting current developments in formal languages and automata. Its scope is very general and includes, among others, the following topics and areas: combinatorial and algebraic properties of words and languages; grammars, acceptors and transducers for strings, trees, graphs, arrays; algebraic theories for automata and languages; codes; efficient text algorithms; symbolic dynamics; decision problems; relationships to complexity theory and logic; picture description and analysis; polyominoes and bidimensional patterns; cryptography; concurrency; cellular automata; bio-inspired computing; quantum computing.

An International Conference Series under the auspices of the European Association for Theoretical Computer Science (EATCS)

This workshop focuses on the newly developing connection between computable structure theory, computable analysis, and algorithmic randomness. Historically, computable structure theory has been centered around countable algebraic structures such as algebraically closed fields and linear orders. However, with some care, it is possible to study uncountable structures such as Banach spaces and metric spaces in this context and to define the notion of an algorithmically random structure. This workshop will bring together researchers in these three areas to build on recent advances in the intersection of these topics and develop new questions in and new approaches to this emerging field of study.

University of São Paulo

LATIN is devoted to different areas in theoretical computer science including, but not limited to: algorithms (approximation, online, combinatorial optimization, etc.), algorithmic game theory, analytic combinatorics and analysis of algorithms, automata theory and formal languages, combinatorics and graph theory, computational algebra and number theory, computational complexity, computational biology, computational geometry, data structures and information retrieval, foundations of data science and theoretical machine learning, parallel and distributed computing, quantum computing, randomization and pseudorandomness, sublinear algorithms and testing.

Alpen-Adria-Universität, Klagenfurt

The 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA2020) will take place June 15–19, 2020 at Alpen-Adria-Universität Klagenfurt. It is part of the series of annual meetings on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms.

Théorie des graphes et combinatoire,    Algorithmes

The Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), which alternates with the Algorithms and Data Structures Symposium (WADS), is a forum for researchers in the area of design and analysis of algorithms and data structures.

Algorithmic approaches of interest include, but are not limited to: approximation algorithms, parametrized algorithms, distributed algorithms, parallel algorithms, external-memory algorithms, data structures, exponential time algorithms, online algorithms, randomized algorithms, streaming algorithms, sub-linear algorithms.

Università dell'Insubria

The conference GASCom brings together researchers in combinatorics, algorithms, probabilities, and more generally mathematical computer science, around the theme of random and exhaustive generation of combinatorial structures, mostly considered from a theoretical point of view. In connection with this main theme, the conference is also interested in contributions in enumerative or analytic combinatorics, and interactions with other areas of mathematics, computer science, physics or biology. The conference is both interested in methods for random or exhaustive generation and in original results on combinatorial or algorithmic questions, whose solution has been made possible by an approach involving random or exhaustive generation.

Théorie des graphes et combinatoire,    Algorithmes

University of Leeds

The International Conference on Theory and Applications of Satisfiability Testing (SAT) is the premier annual meeting for researchers focusing on the theory and applications of the propositional satisfiability problem, broadly construed. In addition to plain propositional satisfiability, it also includes Boolean optimization (such as MaxSAT and Pseudo-Boolean (PB) constraints), Quantified Boolean Formulas (QBF), Satisfiability Modulo Theories (SMT), and Constraint Programming (CP) for problems with clear connections to Boolean-level reasoning. Many hard combinatorial problems can be tackled using SAT-based techniques including problems that arise in Formal Verification, Artificial Intelligence, operations Research, Computational Biology, Cryptography, Data Mining, Machine Learning, Mathematics, etc. Indeed, the theoretical and practical advances in SAT research over the past twenty years have contributed to making SAT technology an indispensable tool in a variety of domains. SAT 2020 aims to further advance the field by soliciting original theoretical and practical contributions in these areas with a clear connection to satisfiability.

The International Symposium on Symbolic and Algebraic Computation (ISSAC) is the premier conference for research in symbolic computation and computer algebra. ISSAC 2020 will be the 45th meeting in the series, which started in 1966 and has been held annually since 1981. The conference presents a range of invited speakers, tutorials, poster sessions, software demonstrations and vendor exhibits with a center-piece of contributed research papers.

All areas of computer algebra and symbolic computation are of interest at ISSAC 2020.

Mathématiques numériques,    Mathématiques appliquées (en général)

Under the auspices of FoLLI the European Summer School in Logic, Language, and Information (ESSLLI) is organized every year in a different European country. It takes place over two weeks in the European Summer, hosts approximately 50 different courses at both the introductory and advanced levels, attracting around 400 participants each year from all the world. The main focus of the program of the summer schools is the interface between linguistics, logic and computation, with special emphasis in human linguistic and cognitive ability. Courses, both introductory and advanced, cover a wide variety of topics within the combined areas of interest: Logic and Computation, Computation and Language, and Language and Logic. Workshops are also organized, providing opportunities for in-depth discussion of issues at the forefront of research, as well as a series of invited lectures. Proposals for courses and workshops are invited in all areas of Logic, Linguistics and Computation. Cross-disciplinary and innovative topics are encouraged. Each course/workshop will consist of five 90-minute sessions, offered daily in a single week. Proposals for 2-week courses should be structured and submitted as two independent one-week courses. The ESSLLI program committee reserves the right to accept just one of the two proposals. The EACSL offers to act as a sponsor for one course or workshop in the areas of Logic and Computation covered by the Computer Science Logic (CSL) conferences. This course or workshop will be designated an EACSL course/workshop. If you wish to be considered for this, please indicate so on your proposal.

Formation en informatique ,    Génie logiciel

Under the auspices of FoLLI the European Summer School in Logic, Language, and Information (ESSLLI) is organized every year in a different European country. It takes place over two weeks in the European Summer, hosts approximately 50 different courses at both the introductory and advanced levels, attracting around 400 participants each year from all the world. The main focus of the program of the summer schools is the interface between linguistics, logic and computation, with special emphasis in human linguistic and cognitive ability.

Traitement automatique des langues, Linguistique informatique,    Formation en informatique

Institute of Physics – IOP

Biomolecular computing has emerged as an interdisciplinary field that draws together molecular biology, chemistry, computer science and mathematics. Our knowledge on DNA nanotechnology and biomolecular computing increases exponentially with every passing year. The annual international meeting in the field began in 1995 right after the landmark work by L. Adleman, who solved an instance of the Hamiltonian path problem by DNA molecules and opened the door to this new field. Since then, the meeting has been a forum where scientists with different backgrounds, yet sharing a common interest in biomolecular computing meet, and present their latest results.

Biotechnologie,    Génomique et bio-informatique

Institute for Mathematical Sciences/National University of Singapore

BIRS-affiliated mathematics research centre, Casa Matemática Oaxaca (CMO)

The workshop will concentrate on three contemporary, central themes in coding theory and its applications. Algebraic coding theory tackles classical communication problems, such as error-free communication between a source and a receiver over a noisy channel, using a wide range of tools from computational algebra, algebraic geometry, and probability theory. More recently coding theory has found applications to emerging challenges in communication. The kind of problems that arise has been shifting, as our digital lives got more and more interconnected. Network Coding seeks answers to problems of maximization of information flow over networks. These answers often require establishing new communication schemes, relying on mathematical structures which were not used in this context before. In the last few years a new set of problems with local features arose from practical applications such as distributed storage of large amounts of data. Locally recoverable codes allow the recovery of a codeword symbol's erasure by mean of a small set of other codeword symbols. These codes are a central topic of research of the last few years, due also to their applicability to these problems.

The world is being reconstructed through software and data. Conceptual models seem mandatory to cope with this gigantic transformation that is unprecedented in the history of humankind. Not only do they build a solid foundation for designing software system, they also foster the empowerment of users and help us to develop images of possible future worlds. However, recent developments in AI challenge this pivotal role of conceptual models. Some AI proponents go so far as to predict the end of conceptual modeling, for an ostensibly convincing reason: machine learning will enable automated software construction, both faster and at much lower costs. These contradictory assessments make it especially exciting to reflect upon the foundations of conceptual modeling and the limitations of inductive approaches to software creation. The ER conference has been the leading conference on conceptual modeling for many years. In continuation of this tradition, ER 2020 is dedicated to providing a forum for discussing the present and future role of conceptual modeling with regard to enabling and managing change.

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Cours et évènements pour étudiants en mathématiques,    Logique mathématique et fondements

CIRM – Centre International de Rencontres Mathématiques

CIRM – Centre International de Rencontres Mathématiques

Génie logiciel,    Cryptographie, blockchain et sécurité de l'information

Institute for Mathematical Sciences/National University of Singapore

Information theory addresses fundamental questions in various areas of science and engineering, including communications, data compression, statistical learning theory, security, and networks. In particular, information theory can be used to identify fundamental limits and gauge the effectiveness of algorithms for various problems associated with these fields.

CIRM – Centre International de Rencontres Mathématiques