Conferences  >  Informatics  >  Information Theory, Foundations of Computer Science

The International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR) is an academic conference aimed at discussing cutting-edge results in the fields of automated reasoning, computational logic, programming languages and their applications.

South China University of Technology, China

The Greenwich Parallel Session of ISPDS 2024 will be held on campus at University of Greenwich. Due to the time difference between the main venue in Guangzhou and Greenwich, the ISPDS 2024 Greenwich Parallel Session is scheduled from 09:00 to 12:00 (GMT),on Saturday, 1st June 2024, in King William 002 at Greenwich Campus. The conference aims to provide a platform for experts and scholars engaged in information science, parallel or distributed processing research, engineering and technical personnel, and technology research and development personnel to share scientific research results and cutting-edge technologies, understand academic development trends, broaden research ideas, strengthen academic research and discussion, and promote the industrialization of academic achievements. The conference sincerely invites academic experts, scholars, businesspeople, and other relevant personnel to participate in ISPDS 2024.

Phone: [+86-16782275466];     Email: contact_ispds@163.com

Algorithms, Artificial Intelligence, Applications, Compilers and runtime systems, Communication, Deep memory hierarchies, Development, analysis, or management tools, Data Compression, Data Mining, Data Engineering, Fault tolerance for Parallel and Distributed systems, High performance computing, cloud and grid computing, Information Retrieval, Image Processing, Information Systems, Middleware and Software engineering, Programming languages, Programming theory and models, Security in Computing, Signal Processing, Information / Cyber Security, Wireless and Mobile Computing

Neural Networks and Artificial Intelligence, Machine Learning,    Information & Knowledge Management, Big Data Computing

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

GOTO Amsterdam

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.

Phone: [+31 6 29508921];     Email: info@amsterdam.gotocon.com

Software Engineering,    Training in Computer Science, Courses

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.

Quantum Information Theory and Quantum Computing,    Robotics, Automation & Mechatronics

Entwickler.de Akademie

Das DevOps Training für Kubernetes bietet einen praktischen und klar verständlichen Einstieg in die Open-Source-Technologie Kubernetes. Wer schon mit Docker arbeitet, wird auch Container orchestrieren – erlauben Orchestrierungslösungen doch die eigenen Container über mehrere Rechner hinweg hochverfügbar und skalierbar auszurollen und zu verwalten. Dazu gehört auch das Service Discovery (nicht nur für Microservices interessant) der Container, egal wo sie gestartet sind. Solch ein Orchestrierungsframework bietet die Konfiguration des Loadbalancers, die Möglichkeit sowohl die Rechner als auch die Container automatisch zu skalieren und vieles mehr. In diesem Intensivtraining steht Kubernetes im Mittelpunkt, denn schon jetzt kann man sagen, dass Kubernetes der Industriestandard für Orchestrierungsframeworks ist. Wo Docker Swarm Mode (behandelt im Docker Camp) nicht mehr ausreicht, findet das komplexere Kubernetes seine Verwendung. In diesem DevOps Training wird zunächst der Aufbau von Kubernetes erklärt, der Fokus liegt jedoch auf der praktischen Verwendung, dem Ausrollen von Containern in und mit Kubernetes. Dabei erhält jeder Teilnehmende Zugriff auf einen eigenen Kubernetescluster mit mindestens 3 Knoten.

DevOps Training, Kubernetes, Open-Source-Technologie, Docker, Container, Service Discovery, Loadbalancers

Software Engineering,    Training in Computer Science, Courses

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.

e-Learning, Computers in Education,    Didactics of Scientific Disciplines

ICCMS 2024 is organized by Dalian University of Technology, China, co-organized by Chongqing University of Posts and Telecommunications, China.

The 16th International Conference on Computer Modeling and Simulation (ICCMS 2024), which will be held in Dalian, China during June 21-23, 2024.

Email: aimee@iacsit.net

Agent Based Simulation; Analytical and Stochastic Modeling Techniques and Applications; Biomedical Visualization and Applications; Chaos Modeling, Control and Signal Transmission; Emerging Technologies and Applications;

European Summer Meeting of the Association for Symbolic Logic, Gothenburg, Sweden

The Logic Colloquium is the European Summer Meeting of the Association for Symbolic Logic, an annual gathering to present current research in all aspects of logic. In 2024, the meeting will be held 24–28 June at the University of Gothenburg in Sweden. The colloquium will run for five days and comprise 3 tutorials, 7 plenary lectures and 6 special sessions as well as contributed talks. In addition, the 2024 Gödel Lecture will be delivered at the meeting.

This will be a conference focussing on new developments in inner model theory and connections to Large Cardinals, Determinacy and Forcing Axioms. The first week will be an invitation only workshop.

Logical frameworks and meta-languages form a common substrate for representing, implementing and reasoning about a wide variety of deductive systems of interest in logic and computer science. Their design, implementation and their use in reasoning tasks, ranging from the correctness of software to the properties of formal systems, have been the focus of considerable research over the last two decades. This workshop will bring together designers, implementors and practitioners to discuss various aspects impinging on the structure and utility of logical frameworks, including the treatment of variable binding, inductive and co-inductive reasoning techniques and the expressiveness and lucidity of the reasoning process.

Computability in Europe (CiE) is an interdisciplinary series of international conferences organised by the Association Computability in Europe (ACiE).

CiE brings together both basic and application oriented research in computability related areas of science. The conference welcomes research contributions on computability-related fields of science including mathematics, theoretical computer science, logic, quantum computability, cryptography, information theory, computational biology, computational linguistics, history and philosophy of computability, and many other related subjects.

Mathematical Logic and Foundations,    Courses and Events for Math Students and Early Career Researchers

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

Courses and Events for Math Students and Early Career Researchers,    Thermodynamics, Fluid Dynamics and Statistical Physics

Term rewriting is a powerful model of computation that underlies much of declarative programming and which is heavily used in symbolic computation in mathematics, theorem proving, and protocol verification. The 14th International School on Rewriting takes place at the University Center Obergurgl, Austria. The school is aimed at master and PhD students, researchers and practitioners interested in the study of rewriting concepts and their applications.

Software Engineering,    Automated Theorem Proving

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,    Courses and Events for Math Students and Early Career Researchers

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.

The aim of the COMMA conference is to bring together researchers interested in computational models of argument and the representation of argumentation structures in natural language texts, including the problem of automatically discovering argumentation in text or speech. In addition to the main conference track, there will be thematically-focused workshops, system demonstrations, and a summer school with courses on current topics of argumentation.

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.

Faculty of Sciences of Monastir, University of Monastir, Monastir, Tunisia

The aim of this conference is to provide an overview of recent developments in number theory, special functions and computer algebra, covering the three topics separately as well as their interactions. This event will provide a collaborative and supportive research environment for young researchers and an opportunity for researchers to exchange ideas. Participants are strongly encouraged to give a talk within these topics.

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.

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

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

Graph Theory and Combinatorics,    Probability and Statistics, Game Theory