Konferenzen  >  Informatik  >  Informationstheorie und Grundlagen der Informatik

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

Quantenmechanik und Quantentechnologie,    Quanteninformationstheorie und Quanteninformatik

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.

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

What is the computational content of proofs? This is one of the main topics in mathematical logic, especially proof theory, that is of relevance for computer science. The well-known foundational solutions aim at rebuilding mathematics constructively almost from scratch, and include Bishop-style constructive mathematics and Martin-Löf's intuitionistic type theory, the latter most recently in the form of the so-called homotopy or univalent type theory put forward by Voevodsky.

The Winter Colloquium on the Physics of Quantum Electronics, known as PQE is an annual physics conference that attracts the world's experts in laser physics, quantum physics, and many other areas. January 2024 marks the 54th winter meeting.

Quantenmechanik und Quantentechnologie,    Computerhardware

Quantenmechanik und Quantentechnologie,    Quanteninformationstheorie und Quanteninformatik

14th International Conference on Computer Science, Engineering and Information Technology (CCSEIT 2024) focuses on Complex systems, information and computation using Computer Science, Engineering and Information Technology. This conference will act as a major forum for the presentation of innovative ideas, approaches, developments and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of advanced Computation and its applications will be covered during the conference.

• Automata Theory, • Big Data, • Blockchain, • Computational Complexity, Economics, Geometry, • Computational Physics & Biology, • Computational Science and Applications, • Cryptography, • Data Mining, • Deep Learning

Quantum science has made great strides in both providing a deeper understanding of nature and enabling innovative technologies. We are now approaching the exciting possibilities of “Quantum 2.0,” a technology revolution that embraces such phenomena as quantum superposition and entanglement to solve entirely new challenges and provide unique capabilities in large-scale systems. Realizing this potential will require overcoming the hurdles and building the infrastructure necessary to bring promising technology from research through prototype development to achieve robust commercial product solutions. Quantum West will highlight the future of applied quantum technologies and will provide a forum that addresses the interests of researchers, engineers, tech companies, investors, and governments—all contributors that can bring about a quantum-enabled future.

Quantenmechanik und Quantentechnologie,    Computerhardware

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

The emergence of new computing systems, like cloud computing, blockchains, and Internet of Things (IoT), replaces the traditional monolithic software hardware stack with a distributed heterogeneous model. This change poses new demands on the programming languages for developing such systems: compositionality, allowing decomposition of a system into smaller, possibly heterogeneous parts and composition of the individually verified parts into a verified whole; security, asserting end-to-end integrity and confidentiality; quantitative reasoning methods, accounting for timing and probabilistic events; and, as a cross-cutting concern, certification of asserted properties in terms of independently verifiable, machine-checked proofs.

Research Institute for Mathematical Sciences (RIMS)

Research Institute for Mathematical Sciences (RIMS)

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

It is an interdisciplinary conference, spanning across both basic and application oriented research in mathematical logic and computer science. CSL’24 is hosted by the University of Naples Federico II.

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Our aim is to bring together the leading researchers on shapes, schemas, and constraints for graph data, both from academia and industry, to discuss the many open problems. The purpose of this Dagstuhl Seminar is to inform each other on how we perceive the research area; to report on brand new results; to discuss open problems and future directions; and to initiate new research.

graph databases such as RDF and property graphs

Datenbanktechlologie, Suchmaschinen und Data-Mining,    Softwareentwicklung

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Logics for dependence and independence are new tools for modelling dependencies and interaction in dynamical scenarios. Reflecting this, these logics often have higher expressive power and complexity than classical logics used for these purposes previously. During the past decade, pioneering results on logics for dependence and independence have been disseminated in a spectrum of respected international conferences and in top journals in the areas of logic and theoretical computer science. Although significant progress has been made in understanding the computational side of these novel logics, many central questions remain unsolved. In addition to addressing the open questions, this Dagstuhl Seminar aims at boosting the exchange of ideas and techniques between team-based logics and the following application areas.

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

The purpose of the seminar will be to initiate a debate around both theoretical foundations and practical methodologies for a "Trustworthiness & Responsibility in AI" framework that integrates quantifiable responsibility and verifiable correctness into all stages of the software engineering process. Such a framework will allow governance and regulatory practises to be viewed not only as rules and regulations imposed from afar, but instead as an integrative process of dialogue and discovery to understand why an autonomous system might fail and how to help designers and regulators address these through proactive governance. In particular, we will consider how to reason about responsibility, blame, and causal factors affecting the trustworthiness of the system.

LATIN (Latin American Theoretical Informatics) was born in 1992, when a group of Latin American researchers, under the leadership of Imre Simon (São Paulo, Brazil), launched the first of a series of symposia in theoretical computer science, to be held triennially in Latin America. Since 1998 it has been held biennially.

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Automated synthesis of systems from specifications has been a longstanding goal of computer science. This problem has been studied by theoreticians and practitioners over decades as witnessed by an extensive and continued stream of articles related to synthesis in top-tier conferences in the field of formal methods. Despite a lot of recent progress, scalability in practical applications is still a concern. Recent advances in SAT/SMT solvers, decision tree learners, and other computational engines present an opportunity for a breakthrough in scalability. These advances have already led to powerful tools in the subarea of functional synthesis, which focuses on the synthesis of functions from relational specifications. However, much work is left to be done in order to translate these successes into scalable algorithms for more comprehensive synthesis problems, such as reactive synthesis, which aims at the automatic construction of circuits, embedded controllers, and other reactive software with complex temporal requirements. This Dagstuhl Seminar seeks to build on the recent momentum in these communities, and aims to bring together researchers in functional synthesis, reactive synthesis, and sister communities to chart the way forward. There are three broad objectives of the seminar.

The Simons Institute for the Theory of Computing

This workshop will bring together researchers from academia and industry to study the capabilities of existing and upcoming quantum computers. Topics will include protocols for characterizing quantum noise, as well as tailoring fault-tolerance protocols to more concrete noise models. The other theme will be proofs of quantumness and other near-term algorithms suitable for such computers, as well as algorithms for scalable fault-tolerant quantum computers.

Transilvania University of Brasov, Brasov, Romania

The International Conference on Mathematics and Computer Science (MACOS) is a biennial conference organized by the Faculty of Mathematics and Computer Science at Transilvania University of Brașov, Romania.

Algebra and Geometry, Mathematical Analysis, Probabilities and Statistics, Applied Mathematics, Computing methodologies, Software and its engineering, Theory of computation, Big Data and Machine Learning

International conference devoted to the analysis of foundational impact of the recent quantum information revolution, arranged by The International Centre for Mathematical Modelling in physics, engineering and cognitive sciences (ICMM) at Linnaeus University.

Quanteninformationstheorie und Quanteninformatik,    Robotik, Automatisierung & Mechatronik

SWAT (Scandinavian Symposium on Algorithm Theory), 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.

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

This Dagstuhl Seminar intends to foster discussion between researchers in computing education, builders of teaching support systems for formal foundations of computer science, as well as instructors of these foundations with the goal of facilitating more robust research and development of such systems.

Computergestütztes Lernen,    Didaktik in der Wissenschaft

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

Kurse und Veranstaltungen für Studenten der Mathematik,    Thermodynamik, Hydrodynamik und Statistische Mechanik

Hausdorff Research Institute for Mathematics (HIM)

The trimester program aims to bring together experts, postdocs, and students in computer science and certain areas in mathematics (analysis, probability, and combinatorics) in order to learn about some challenging open problems recently raised in computer science, to use and invent necessary new tools and techniques in mathematics to solve these challenging problems, and vice versa to learn and further extend methods developed in computer science to develop new directions in mathematics motivated by questions in computer science. The core topics of the trimester program would be: learning theory, complexity of classical and quantum algorithms, vector valued functions on the hypercube, complex Hypercontractivity, polynomial inequalities on the hypercube, and discrete approximation theory on the hamming cube.

Analysis,    Kurse und Veranstaltungen für Studenten der Mathematik

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Computational Complexity is concerned with the resources that are required for algorithms to detect properties of combinatorial objects and structures. It has often proven true that the best way to argue about these combinatorial objects is by establishing a connection (perhaps approximate) to a more well-behaved algebraic setting. Indeed, many of the deepest and most powerful results in Computational Complexity rely on algebraic proof techniques.

Schloss Dagstuhl - Leibniz-Zentrum für Informatik

The problem of deciding whether a propositional formula is satisfiable (SAT) is one of the most fundamental problems in computer science, both theoretically and practically. Due to its practical implications, intensive research has been performed on how to solve SAT problems in an automated fashion, and SAT solving is now a ubiquitous tool to solve many hard problems, both from industry and mathematics. SAT is also increasingly being applied in logics that are not decidable, particularly in the context of first-order theorem proving. Here, fast SAT solvers are used for reasoning sub-tasks and for guiding the theorem provers. The main aim of this Dagstuhl Seminar is to bring together researchers from different areas of activity on SAT and researchers that work in the field of first-order theorem proving so that they can communicate state-of-the-art advances and embark on a systematic interaction that will enhance the synergy between the different areas.

Hausdorff Research Institute for Mathematics (HIM)

This workshop brings together leading experts in Boolean analysis, information theory, and lattices to explore the forefront of these disciplines through the talks and discussions about intriguing open problems, recent resolutions, and the evolution of innovative ideas, approaches, and techniques.

The Fields Institute for Research in Mathematical Sciences

The Copmutational Complexity Conference (CCC) aims to foster research in all areas of computational complexity theory, studying the absolute and relative power of computational models under resource constraints. Typical models include deterministic, nondeterministic, randomized, and quantum models; uniform and nonuniform models; Boolean, algebraic, and continuous models. Typical resource constraints involve time, space, randomness, program size, input queries, communication, and entanglement; worst-case as well as average case. Other, more specific, topics include: probabilistic and interactive proof systems, inapproximability, proof complexity, descriptive complexity, and complexity-theoretic aspects of cryptography and machine learning. The conference also encourages results from other areas of computer science and mathematics motivated by computational complexity theory.