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

Association for Computing Machinery (ACM)

The annual Symposium on Principles of Programming Languages is a forum for the discussion of all aspects of programming languages and systems, with emphasis on how principles underpin practice. Both theoretical and experimental papers are welcome, on topics ranging from formal frameworks to experience reports.

Society for Industrial and Applied Mathematics (SIAM)

Symposium on Simplicity in Algorithms is a conference in theoretical computer science dedicated to advancing algorithms research by promoting simplicity and elegance in the design and analysis of algorithms. The benefits of simplicity are manifold: simpler algorithms manifest a better understanding of the problem at hand; they are more likely to be implemented and trusted by practitioners; they can serve as benchmarks, as an initialization step, or as the basis for a “state of the art'' algorithm; they are more easily taught and are more likely to be included in algorithms textbooks; and they attract a broader set of researchers to difficult algorithmic problems.

Mathématiques appliquées (en général),    Algorithmes et structures de données

The Research Institute for Mathematical Sciences (RIMS)

São Paulo Research Foundation (Fapesp)

The SPLogIC, funded by the São Paulo Research Foundation (Fapesp), aims to provide an overview of the state-of-the-art methodology and research on contemporary logic (featuring non-classical logics), rationality, and information.

History and Philosophy of Paraconsistent Logics • The Australian, Belgian, Brazilian, Israeli, and Polish Schools on Paraconsistency • Logic and Reasoning • Logic and Information • Logic and Argumentation • Methodological Aspects on Interpreting, Translating, and Combining Logics • Logic, Probability, and Artificial Intelligence

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

CSL is the annual conference of the European Association for Computer Science Logic (EACSL).

An interdisciplinary conference, spanning across both basic and application oriented research in mathematical logic and computer science. CSL’23 is hosted by the University of Warsaw.

The Research Institute for Mathematical Sciences (RIMS)

Celebrating its 54th year, the Conference brings together mathematicians and others interested in combinatorics, graph theory and computing, and their interactions. The Conference lectures and contributed papers, as well as the opportunities for informal conversations, have proven to be of great interest to other scientists and analysts employing these mathematical sciences in their professional work in business, industry, and government.

Banff International Research Station (BIRS) for Mathematical Innovation and Discovery

The researchers participating in this workshop come from several mathematical subdisciplines, including combinatorics, algebraic geometry, and theoretical computer science. Their work and common interest here is to investigate new interactions between discrete mathematics, algebra, algebraic geometry, tropical geometry, and combinatorial algorithms. Some participants have collaborated before in smaller groups, but this meeting will provide an opportunity to work together more intensively. Several recent mathematical breakthroughs will be highlighted in the workshop, including the recent resolution of some long-standing open problems about graphs and matroids. These breakthroughs used a surprising combination of interdisciplinary techniques which the organizers expect to have exciting further applications.

Théorie des graphes et combinatoire,    Géométrie et topologie

ETAPS Association

ETAPS is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of four annual conferences ESOP, FASE, FoSSaCS, and TACAS, accompanied by satellite workshops.

CIRM – Centre International de Rencontres Mathématiques

Our goal is to organise a conference devoted to interactions between pure mathematics (in particular arithmetic and algebraic geometry) and information theory (especially cryptography and coding theory). This conference will be the eighteenth edition, with the first one held in 1987, in a series that has traditionally brought together some of the top specialists in the domains of arithmetic, geometry, and information theory. The corresponding international community is very active and all of the concerned research domains are developing and expanding rapidly.

Algebraic and arithmetic geometry over finite fields and global fields. Number theory, especially explicit and algorithmic. Algebro-geometric codes constructed from curves and higher-dimensional algebraic varieties over finite fields and global fields. -Arithmetic and geometric aspects of cryptography (symmetric, public key, and post-quantum) and cryptanalysis.

Algèbre,    Cryptographie, blockchain et sécurité de l'information

WG is mainly concerned with efficient algorithms of various types (e.g. sequential, parallel, distributed, randomized, parameterized) for problems on graphs and networks. The goal is to present recent results and to identify and explore directions for future research.

The International Symposium on Symbolic and Algebraic Computation (ISSAC) is the premier conference for research in symbolic computation and computer algebra. ISSAC 2023 will be the 48th meeting in the series, which started in 1966 and has been held annually since 1981. The conference presents a range of invited speakers, tutorials, short communication, 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 2023. These include, but are not limited to: Algorithmic aspects, Software aspects, Application aspects

Institute for Pure and Applied Mathematics (IPAM), UCLA

The recent development of quantum algorithms has significantly pushed forward the frontier of using quantum computers for performing a wide range of scientific computing problems. This includes solving numerical linear algebra tasks for very large matrices, such as solving linear systems, eigenvalue decomposition, singular value decomposition, matrix function evaluation etc, as well as solving certain high dimensional linear and nonlinear differential equations, such as heat equations and wave equations. This workshop aims to bring together leading experts across different disciplines, including experts in solving related tasks using classical computers that can potentially inspire the development of new quantum algorithms; discuss recent progress made in the development of quantum algorithms for linear algebra and differential equations and the advances in classical algorithms; foster the discussion and pave the path towards identifying and overcoming challenging problems in science and engineering and for various industrial and technological applications.

Part of the Long Program Mathematical and Computational Challenges in Quantum Computing

Institute for Pure and Applied Mathematics (IPAM), UCLA

What will quantum computers be useful for once we have them? Machine learning and optimization would be important applications if quantum computers were useful for them, but the level of quantum benefit is unknown. One aim of the workshop is to bring together experts in classical and quantum machine learning to discuss the role of mathematical proof as well as experimentation in understanding these topics. A second aim is to explore how classical machine learning techniques can help us build better quantum computers.

Part of the Long Program Mathematical and Computational Challenges in Quantum Computing

Institute for Pure and Applied Mathematics (IPAM), UCLA

The ability to create and manipulate complex quantum states offers the potential for dramatic increases in computational power, measurement sensitivity, and information security. Understanding the dynamics of such entangled many-body states raises a number of mathematical and physical questions, as such states often lie beyond standard approximate descriptions used in different areas of physics. This workshop is devoted to the related problems of how quantum and classical computers can be used to attack important problems in many-body quantum mechanics across application domains. While the faithful representation of full many-particle Hilbert spaces on a classical computer is exponentially costly, efficient approximate representations for specific purposes have been discovered, such as tensor networks. Studying the dynamics of quantum computers in the current NISQ area leads naturally to questions of robustness and control.

Part of the Long Program Mathematical and Computational Challenges in Quantum Computing

The ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) is an internationally renowned forum for researchers, practitioners, and educators to present and discuss the most recent innovations, trends, experiences, and challenges in the field of software engineering. ESEC/FSE brings together experts from academia and industry to exchange the latest research results and trends as well as their practical application in all areas of software engineering.

Institute for Pure and Applied Mathematics (IPAM), UCLA

The goal of finding better quantum error correcting codes gains motivation not just in fault tolerant quantum computing, but also for attacking major open questions in quantum complexity theory. This workshop will bring together leading researchers working on both the areas, with the aim of making progress on questions such as the quantum PCP conjecture, better quantum LDPC codes, quantum local testability and tests for quantumness.

Part of the Long Program Mathematical and Computational Challenges in Quantum Computing