Conferences  >  Informatics  >  Information Theory, Foundations of Computer Science

Select a location
ALL COUNTRIES (22)
1
Mathematical Foundations of Computer Science and Its Applications
19 Feb 2024 - 21 Feb 2024 • Kyoto, Japan
Organizer:
Research Institute for Mathematical Sciences (RIMS)
Event listing ID:
1574360
2
CSL 2024 — 32nd EACSL Annual Conference on Computer Science Logic 2024
19 Feb 2024 - 23 Feb 2024 • Naples, Italy
Organizer:
CSL is the annual conference of the European Association for Computer Science Logic (EACSL).
Abstract:
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.
Event listing ID:
1583639
3
Dagstuhl-Seminar — Shapes in Graph Data: Theory and Implementation
03 Mar 2024 - 08 Mar 2024 • Schloss Dagstuhl, Wadern, Germany
Organizer:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Abstract:
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.
Topics:
graph databases such as RDF and property graphs
Event listing ID:
1589818
4
Dagstuhl-Seminar — Logics for Dependence and Independence: Expressivity and Complexity
10 Mar 2024 - 15 Mar 2024 • Schloss Dagstuhl, Wadern, Germany
Organizer:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Abstract:
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.
Event listing ID:
1566029
5
Dagstuhl-Seminar — Trustworthiness and Responsibility in AI – Causality, Learning, and Verification
17 Mar 2024 - 22 Mar 2024 • Schloss Dagstuhl, Wadern, Germany
Organizer:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Abstract:
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.
Event listing ID:
1565995
6
LATIN 2024 — Latin American Theoretical Informatics
18 Mar 2024 - 24 Mar 2024 • Puerto Varas, Chile
Abstract:
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.
Event listing ID:
1589173
7
Dagstuhl-Seminar — Automated Synthesis: Functional, Reactive and Beyond
21 Apr 2024 - 26 Apr 2024 • Schloss Dagstuhl, Wadern, Germany
Organizer:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Abstract:
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.
Event listing ID:
1566034
Related subject(s):
8
Workshop on Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms
22 Apr 2024 - 26 Apr 2024 • Berkeley, United States
Organizer:
The Simons Institute for the Theory of Computing
Abstract:
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.
Event listing ID:
1592472
9
MACOS — International Conference on Mathematics and Computer Science
06 Jun 2024 - 08 Jun 2024 • Brasov, Romania
Organizer:
Transilvania University of Brasov, Brasov, Romania
Abstract:
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.
Topics:
Algebra and Geometry, Mathematical Analysis, Probabilities and Statistics, Applied Mathematics, Computing methodologies, Software and its engineering, Theory of computation, Big Data and Machine Learning
Event listing ID:
1570362
Related subject(s):
Event website:
10
GOTO Amsterdam 2024
11 Jun 2024 - 12 Jun 2024 • Amsterdam, Netherlands
Organizer:
GOTO Amsterdam
Abstract:
GOTO Amsterdam 2024 will gather the pioneers and game-changing coders who shape our industry and radically improve the way we look at software. For our 12th edition of the conference, we’ll dive into core technical concepts and explore what quality code looks like in 2024 and beyond. Whatever you’re working with — frontend, backend, mobile, cloud services, microservices, events, machine learning, maybe even upcoming technologies like quantum computing — it’s all based on solid fundamentals like programming languages, testing skills, scalability, stability and a focus on the end user. Each keynote, session and masterclass is designed to deliver a blend of eye-opening ideas and the practical skills needed to write software you can be proud of.
Contact:
Phone: [+31 6 29508921];     Email: info@amsterdam.gotocon.com
Event listing ID:
1607016
Event website:
11
Annual Quantum Foundations Conference
11 Jun 2024 - 14 Jun 2024 • Växjö, Sweden
Abstract:
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.
Event listing ID:
1592321
12
SWAT 2024 — 19th Scandinavian Symposium on Algorithm Theory
12 Jun 2024 - 14 Jun 2024 • Helsinki, Finland
Abstract:
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.
Abstract submission deadline:
07 Feb 2024
Event listing ID:
1589061
Related subject(s):
13
Dagstuhl-Seminar — Teaching Support Systems for Formal Foundations of Computer Science
16 Jun 2024 - 21 Jun 2024 • Schloss Dagstuhl, Wadern, Germany
Organizer:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Abstract:
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.
Event listing ID:
1566114
14
ICCMS 2024 — 2024 The 16th International Conference on Computer Modeling and Simulation
21 Jun 2024 - 23 Jun 2024 • Dalian, China
Organizer:
ICCMS 2024 is organized by Dalian University of Technology, China, co-organized by Chongqing University of Posts and Telecommunications, China.
Abstract:
The 16th International Conference on Computer Modeling and Simulation (ICCMS 2024), which will be held in Dalian, China during June 21-23, 2024.
Contact:
Email: aimee@iacsit.net
Topics:
Agent Based Simulation; Analytical and Stochastic Modeling Techniques and Applications; Biomedical Visualization and Applications; Chaos Modeling, Control and Signal Transmission; Emerging Technologies and Applications;
Event listing ID:
1594506
Related subject(s):
Event website:
15
BIRS Workshop — Frontiers of Statistical Mechanics and Theoretical Computer Science
11 Aug 2024 - 16 Aug 2024 • Banff, Alberta, Canada
Organizer:
Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
Event listing ID:
1559583
16
Trimester Program — Boolean Analysis in Computer Science
09 Sep 2024 - 18 Dec 2024 • Bonn, Germany
Organizer:
Hausdorff Research Institute for Mathematics (HIM)
Abstract:
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.
Event listing ID:
1583972
17
Dagstuhl-Seminar — Algebraic and Analytic Methods in Computational Complexity
15 Sep 2024 - 20 Sep 2024 • Schloss Dagstuhl, Wadern, Germany
Organizer:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Abstract:
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.
Event listing ID:
1589513
Related subject(s):
18
Dagstuhl-Seminar — SAT and Interactions
13 Oct 2024 - 18 Oct 2024 • Schloss Dagstuhl, Wadern, Germany
Organizer:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Abstract:
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.
Event listing ID:
1589529
Related subject(s):
19
Trimester Program Activity — Workshop “Information theory, Boolean functions, and lattice problems”
18 Nov 2024 - 22 Nov 2024 • Bonn, Germany
Organizer:
Hausdorff Research Institute for Mathematics (HIM)
Abstract:
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.
Event listing ID:
1583976
Related subject(s):
20
CCC 2025 — Computational Complexity Conference 2025
05 Aug 2025 - 08 Aug 2025 • Toronto, Ontario, Canada
Organizer:
The Fields Institute for Research in Mathematical Sciences
Abstract:
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.
Event listing ID:
1586293
21
New Mathematical Directions in Coding Theory
07 Sep 2025 - 12 Sep 2025 • Oberwolfach, Germany
Topics:
Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)
Event listing ID:
1605380
Related subject(s):
22
Combinatorics, Probability and Computing
14 Sep 2025 - 19 Sep 2025 • Oberwolfach, Germany
Topics:
Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)
Event listing ID:
1605445


Conference-Service.com offers, as part of its business activities, a directory of upcoming scientific and technical meetings. The calendar is published for the convenience of conference participants and we strive to support conference organisers who need to publish their upcoming events. Although great care is being taken to ensure the correctness of all entries, we cannot accept any liability that may arise from the presence, absence or incorrectness of any particular information on this website. Always check with the meeting organiser before making arrangements to participate in an event!

No tracking | No pop-ups | No animations
Last updated: 12 February 2024