Conferences  >  Informatics  >  Algorithms and Data Structures

Neural Networks and Artificial Intelligence, Machine Learning,    Software Agents and Intelligent Agents in Artificial Intelligence

CIRM – Centre International de Rencontres Mathématiques

Graph Theory and Combinatorics,    Cryptography, Blockchain and Information Security

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

Computations with matrices, such as their multiplication, are fundamental operations that are executed on millions of devices, from smartphones to supercomputers, every day. But what is the minimum number of operations it takes to multiply two matrices? Surprisingly, the answer is currently unknown. The problem of determining the complexity, or the number of operations required to perform a certain computation, goes back to the very origins of computing. In the age of large-scale scientific computing, big data, and machine learning, understanding the complexity of computations is crucial for designing algorithms that are efficient in terms of both time and energy. There are two distinct research communities in computer science and mathematics working to answer these questions. Each community brings different perspectives and different approaches, but they rarely interact with each other to the detriment of both. To truly advance the state-of-the-art and tackle huge computational problems, cooperation and collaboration is needed. This workshop will bring together a diverse group of researchers in theoretical computer science and numerical analysis to shape the future of research on the complexity of matrix computations.

International Association for Cryptologic Research (IACR)

The Conference on Fast Software Encryption (FSE) has been sponsored by the IACR since 2004. FSE concentrates on fast and secure primitives for symmetric cryptography, including the design and analysis of block ciphers, stream ciphers, encryption schemes, analysis and evaluation tools, hash functions, and MAC algorithms.

Cryptography, Blockchain and Information Security,    Software Engineering

To provide an international forum for researchers working in the areas of algorithms and computation, the first Workshop on Algorithms and Computation (WALCOM 2007) was held on February 12, 2007 in Dhaka, Bangladesh and was organized by Bangladesh Academy of Sciences. WALCOM 2008 , 2010, 2012, 2015, and 2018 were held in Bangladesh; whereas WALCOM 2009, WALCOM 2011, 2013, 2014, and 2019 were held in India. WALCOM 2016 was held in Nepal. WALCOM 2017 was held in Taiwan. The name of this conference has been changed as Conference and Workshops on Algorithms and Computation since WALCOM 2017. WALCOM 2020 was held in Singapore. WALCOM 2021 was held in Myanmar. WALCOM 2022 was held in Indonesia. The proceedings will be published by Lecture Notes in Computer Science (LNCS). Special issues dedicated to WALCOM 2023 will be published at Journal of Graph Algorithms and Applications, and Theoretical Computer Science, and Algorithmica. WALCOM 2023 is organized in cooperation with IEICE Technical Committee on Theoretical Foundations of Computing (COMP) and the Special Interest Group for ALgorithms (SIGAL) of the Information Processing Society of Japan (IPSJ).

International Association for Cryptologic Research (IACR)

Real World Crypto Symposium aims to bring together cryptography researchers with developers implementing cryptography in real-world systems. The conference goal is to strengthen the dialogue between these two communities. Topics covered focus on uses of cryptography in real-world environments such as the Internet, the cloud, and embedded devices.

Cryptography, Blockchain and Information Security,    Information Security and Information Privacy

Rutgers University

The focus of this workshop is the interaction between 3-manifold topology/geometry and theoretical computer science. Of particular interest is the computational complexity of algorithmic problems in 3-manifold topology. Related topics in low-dimensional topology and theoretical computer science will also be discussed. The program will include introductory lectures as well as flash talks and ample time for discussions and informal interactions.

Geometry and Topology,    Graph Theory and Combinatorics

Society for Industrial and Applied Mathematics (SIAM)

Applied Mathematics (in general),    Numerical Analysis and Computational Mathematics

The IGAFIT Highlights of Algorithms (HALG) conference is designed to be a forum for presenting the highlights of recent developments in algorithms and for discussing potential further advances in this area. The conference will provide a broad picture of the latest research in algorithms through a series of invited talks, as well as the possibility for all researchers and students to present their recent results through a series of short talks and poster presentations. Attending the IGAFIT Highlights of Algorithms conference will also be an opportunity for networking and meeting leading researchers in algorithms.

This is a hybrid conference, with free-of-charge registration for all participants, for online & in-person attendance as well.

The conference will focus on the study of discrete mathematical models; e.g. graphs (networks) and hypergraphs, the algorithmic complexity of combinatorial problems, approximability in discrete optimization, but will also include other areas of discrete mathematics, including discrete geometry. During the conference we will celebrate the past 25 years of Semi Online problems. The conference is also dedicated to celebrate the 70-th birthday of Zsolt Tuza.

Graph Theory and Combinatorics,    Optimization Theory, Operational Research

National Cheng Kung University, Tainan, Taiwan

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

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

This workshop will bring together mathematicians with expertise spanning the theoretical, numerical, discrete and computational geometry and partial differential equations (PDEs) and computer scientists with related interests to identify and discuss some of the most promising areas for advances in the understanding and application in geometric data analysis.

Calculus, Differential Equations and Integration,    Computational Physics and Numerical Simulation

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

Most of the many discrete optimization problems arising in the sciences, engineering, and mathematics are NP-hard, that is, there exist no efficient algorithms to solve them to optimality, assuming the conjecture that P does not equal NP. The area of approximation algorithms focuses on the design and analysis of efficient algorithms that find solutions that are within a guaranteed factor of the optimal one. Loosely speaking, in the context of studying algorithmic problems, an approximation guarantee captures the quality of an algorithm -- for every possible set of input data for the problem, the algorithm finds a solution whose cost is within this factor of the optimal cost. A hardness threshold indicates the difficulty of the algorithmic problem -- no efficient algorithm can achieve an approximation guarantee better than the hardness threshold assuming that P does not equal NP. Over the last two decades, there have been major advances on the design and analysis of approximation algorithms, and on the complementary topic of the hardness of approximation. The goal of the workshop is to focus on a few key topics that could lead to deep new results in the areas of approximation algorithms, combinatorial optimization, hardness of approximation, and proof complexity.

Mathematical Physics,    Computational Physics and Numerical Simulation

USENIX Association

SREcon23 Europe/Middle East/Africa is a gathering of engineers who care deeply about site reliability, systems engineering, and working with complex distributed systems at scale. SREcon strives to challenge both those new to the profession as well as those who have been involved in it for decades. The conference has a culture of critical thought, deep technical insights, continuous improvement, and innovation.

Software Engineering,    Distributed, Edge and Cloud Computing

USENIX Association

SREcon is a gathering of engineers who care deeply about site reliability, systems engineering, and working with complex distributed systems at scale. Our purpose is to be inclusive as we bring together ideas representative of our diverse community, whether its members are focusing on a global scale, launching new products and ideas for a small business, or pivoting their approach to unite software and systems engineering. SREcon challenges both those new to the profession as well as those who have been involved in it for decades. The conference has a culture of critical thought, deep technical insights, continuous improvement, and innovation.

Software Engineering,    Distributed, Edge and Cloud Computing