Konferenzen  >  Informatik  >  Informationstheorie und Grundlagen der Informatik

Wählen Sie ein Land aus
ALLE LÄNDER (18)
1
Dagstuhl-Seminar — Trustworthiness and Responsibility in AI – Causality, Learning, and Verification
17. Mär 2024 - 22. Mär 2024 • Schloss Dagstuhl, Wadern, Deutschland
Veranstalter:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Zusammenfassung:
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.
Eintrags-ID:
1565973
2
LATIN 2024 — Latin American Theoretical Informatics
18. Mär 2024 - 24. Mär 2024 • Puerto Varas, Chile
Zusammenfassung:
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.
Eintrags-ID:
1589184
3
Dagstuhl-Seminar — Automated Synthesis: Functional, Reactive and Beyond
21. Apr 2024 - 26. Apr 2024 • Schloss Dagstuhl, Wadern, Deutschland
Veranstalter:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Zusammenfassung:
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.
Eintrags-ID:
1566067
Verwandte Fachgebiete:
4
Workshop on Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms
22. Apr 2024 - 26. Apr 2024 • Berkeley, Vereinigte Staaten
Veranstalter:
The Simons Institute for the Theory of Computing
Zusammenfassung:
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.
Eintrags-ID:
1592538
5
MACOS — International Conference on Mathematics and Computer Science
06. Jun 2024 - 08. Jun 2024 • Brasov, Rumänien
Veranstalter:
Transilvania University of Brasov, Brasov, Romania
Zusammenfassung:
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.
Themen:
Algebra and Geometry, Mathematical Analysis, Probabilities and Statistics, Applied Mathematics, Computing methodologies, Software and its engineering, Theory of computation, Big Data and Machine Learning
Eintrags-ID:
1570439
Verwandte Fachgebiete:
6
GOTO Amsterdam 2024
11. Jun 2024 - 12. Jun 2024 • Amsterdam, Niederlande
Veranstalter:
GOTO Amsterdam
Zusammenfassung:
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.
Kontakt:
Tel.: [+31 6 29508921];     Email: info@amsterdam.gotocon.com
Eintrags-ID:
1606994
7
Annual Quantum Foundations Conference
11. Jun 2024 - 14. Jun 2024 • Växjö, Schweden
Zusammenfassung:
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.
Eintrags-ID:
1592354
8
SWAT 2024 — 19th Scandinavian Symposium on Algorithm Theory
12. Jun 2024 - 14. Jun 2024 • Helsinki, Finnland
Zusammenfassung:
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.
Einsendeschluss für Abstracts:
07. Feb 2024
Eintrags-ID:
1589138
Verwandte Fachgebiete:
9
Dagstuhl-Seminar — Teaching Support Systems for Formal Foundations of Computer Science
16. Jun 2024 - 21. Jun 2024 • Schloss Dagstuhl, Wadern, Deutschland
Veranstalter:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Zusammenfassung:
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.
Eintrags-ID:
1566136
10
ICCMS 2024 — 2024 The 16th International Conference on Computer Modeling and Simulation
21. Jun 2024 - 23. Jun 2024 • Dalian, China
Veranstalter:
ICCMS 2024 is organized by Dalian University of Technology, China, co-organized by Chongqing University of Posts and Telecommunications, China.
Zusammenfassung:
The 16th International Conference on Computer Modeling and Simulation (ICCMS 2024), which will be held in Dalian, China during June 21-23, 2024.
Kontakt:
Email: aimee@iacsit.net
Themen:
Agent Based Simulation; Analytical and Stochastic Modeling Techniques and Applications; Biomedical Visualization and Applications; Chaos Modeling, Control and Signal Transmission; Emerging Technologies and Applications;
Eintrags-ID:
1594517
Verwandte Fachgebiete:
Webseite:
11
BIRS Workshop — Frontiers of Statistical Mechanics and Theoretical Computer Science
11. Aug 2024 - 16. Aug 2024 • Banff, Alberta, Kanada
Veranstalter:
Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
Eintrags-ID:
1559605
12
Trimester Program — Boolean Analysis in Computer Science
09. Sep 2024 - 18. Dez 2024 • Bonn, Deutschland
Veranstalter:
Hausdorff Research Institute for Mathematics (HIM)
Zusammenfassung:
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.
Eintrags-ID:
1584016
13
Dagstuhl-Seminar — Algebraic and Analytic Methods in Computational Complexity
15. Sep 2024 - 20. Sep 2024 • Schloss Dagstuhl, Wadern, Deutschland
Veranstalter:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Zusammenfassung:
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.
Eintrags-ID:
1589557
Verwandte Fachgebiete:
14
Dagstuhl-Seminar — SAT and Interactions
13. Okt 2024 - 18. Okt 2024 • Schloss Dagstuhl, Wadern, Deutschland
Veranstalter:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Zusammenfassung:
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.
Eintrags-ID:
1589496
Verwandte Fachgebiete:
15
Trimester Program Activity — Workshop “Information theory, Boolean functions, and lattice problems”
18. Nov 2024 - 22. Nov 2024 • Bonn, Deutschland
Veranstalter:
Hausdorff Research Institute for Mathematics (HIM)
Zusammenfassung:
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.
Eintrags-ID:
1583987
Verwandte Fachgebiete:
16
CCC 2025 — Computational Complexity Conference 2025
05. Aug 2025 - 08. Aug 2025 • Toronto, Ontario, Kanada
Veranstalter:
The Fields Institute for Research in Mathematical Sciences
Zusammenfassung:
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.
Eintrags-ID:
1586304
17
New Mathematical Directions in Coding Theory
07. Sep 2025 - 12. Sep 2025 • Oberwolfach, Deutschland
Themen:
Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)
Eintrags-ID:
1605468
Verwandte Fachgebiete:
18
Combinatorics, Probability and Computing
14. Sep 2025 - 19. Sep 2025 • Oberwolfach, Deutschland
Themen:
Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)
Eintrags-ID:
1605478


Conference-Service.com stellt der Öffentlichkeit ein Kalendarium wichtiger Konferenzen, Symposien und sonstiger Tagungen im wissenschaftlich-technischen Bereich zur Verfügung. Obwohl das Verzeichnis mit großer Sorgfalt zusammengestellt und ständig aktualisiert wird, weisen wir auf die Möglichkeit von Fehlern ausdrücklich hin. Bitte vergewissern Sie sich immer beim Veranstalter, bevor Sie über die Teilnahme oder Nichtteilnahme an einer Konferenz entscheiden.

Kein Tracking | Keine Pop-ups | Keine Animationen
Stand vom 12. Februar 2024