Conferences  >  Informatics  >  Algorithms and Data Structures

Select a location
ALL COUNTRIES (16)
1
IDEAL 2021 — Intelligent Data Engineering and Automated Learning
25 Nov 2021 - 27 Nov 2027 • Manchester, United Kingdom
2
SREcon22 Europe/Middle East/Africa
25 Oct 2022 - 27 Oct 2022 • Amsterdam, Netherlands
Organizer:
USENIX Association
Abstract:
SREcon22 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.
Abstract submission deadline:
30 Jun 2022
Event listing ID:
1489721
3
ALENEX23 — SIAM Symposium on Algorithm Engineering and Experiments
22 Jan 2023 - 23 Jan 2023 • Florence, Italy
Organizer:
Society for Industrial and Applied Mathematics (SIAM)
Abstract:
The aim of ALENEX is to provide a forum for the presentation of original research in the design, implementation, and experimental evaluation of algorithms and data structures. Typical submissions will include an extensive experimental analysis of nontrivial algorithmic results, ideally bridging the gap between theory and practice. We also invite submissions that address methodological issues and standards in the experimental evaluation of algorithms and data structures.
Topics:
Relevant areas of applied algorithmic research include but are not limited to databases; geometry; graphs and networks, including web applications; operations research; combinatorial aspects of scientific computing; and computational problems in the natural sciences or engineering.
Abstract submission deadline:
11 Aug 2022
Event listing ID:
1501669
Related subject(s):
4
SOSA23 — SIAM Symposium on Simplicity in Algorithms
23 Jan 2023 - 24 Jan 2023 • Florence, Italy
Organizer:
Society for Industrial and Applied Mathematics (SIAM)
Abstract:
Symposium on Simplicity in Algorithms is a conference in theoretical computer science dedicated to advancing algorithms research by promoting simplicity and elegance in the design and analysis of algorithms. The benefits of simplicity are manifold: simpler algorithms manifest a better understanding of the problem at hand; they are more likely to be implemented and trusted by practitioners; they can serve as benchmarks, as an initialization step, or as the basis for a “state of the art'' algorithm; they are more easily taught and are more likely to be included in algorithms textbooks; and they attract a broader set of researchers to difficult algorithmic problems.
Abstract submission deadline:
11 Aug 2022
Event listing ID:
1501624
5
APOCS23 — SIAM Symposium on Algorithmic Principles of Computer Systems
25 Jan 2023 • Florence, Italy
Organizer:
Society for Industrial and Applied Mathematics (SIAM)
Abstract:
The Symposium on Algorithmic Principles of Computer Systems (APOCS) serves as a venue for algorithm papers that are strongly motivated by systems, and systems papers with provable algorithmic guarantees. Contributed papers are sought in all areas of algorithms and architectures that offer insight into the performance and design of computer systems.
Abstract submission deadline:
11 Aug 2022
Event listing ID:
1501656
6
ALgebraic and combinatorial methods for COding and CRYPTography
20 Feb 2023 - 24 Feb 2023 • CIRM (Marseille Luminy) , France
Organizer:
CIRM – Centre International de Rencontres Mathématiques
Event listing ID:
1507516
7
BIRS Workshop — Perspectives on Matrix Computations: Theoretical Computer Science Meets Numerical Analysis
05 Mar 2023 - 10 Mar 2023 • Banff, Alberta, Canada
Organizer:
Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
Abstract:
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.
Event listing ID:
1498883
8
FSE 2023 — Fast Software Encryption (FSE)
20 Mar 2023 - 24 Mar 2023 • Beijing, China
Organizer:
International Association for Cryptologic Research (IACR)
Abstract:
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.
Event listing ID:
1502095
9
WALCOM 2023 — 17th International Conference and Workshops on Algorithms and Computation (WALCOM 2023)
22 Mar 2023 - 24 Mar 2023 • Hsinchu – hybrid, Taiwan
Abstract:
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).
Abstract submission deadline:
23 Sep 2022
Event listing ID:
1513841
Related subject(s):
10
RWC 2023 — Real World Crypto Symposium
27 Mar 2023 - 29 Mar 2023 • Tokyo, Japan
Organizer:
International Association for Cryptologic Research (IACR)
Abstract:
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.
Abstract submission deadline:
09 Nov 2022
Event listing ID:
1502072
11
ACDA23 — SIAM Conference on Applied and Computational Discrete Algorithms
31 May 2023 - 02 Jun 2023 • Seattle, Washington, United States
Organizer:
Society for Industrial and Applied Mathematics (SIAM)
Event listing ID:
1485636
12
ISSAC 2023 — International Symposium on Symbolic and Algebraic Computation
24 Jul 2023 - 27 Jul 2023 • Tromsø, Norway
Abstract:
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.
Topics:
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
Event listing ID:
1506965
13
BIRS Workshop — Applied and Computational Differential Geometry and Geometric PDEs
30 Jul 2023 - 04 Aug 2023 • Banff, Alberta, Canada
Organizer:
Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
Abstract:
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.
Event listing ID:
1499176
14
BIRS Workshop — Approximation Algorithms and the Hardness of Approximation
17 Sep 2023 - 22 Sep 2023 • Banff, Alberta, Canada
Organizer:
Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
Abstract:
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.
Event listing ID:
1499279
15
SREcon23 Europe/Middle East/Africa
10 Oct 2023 - 12 Oct 2023 • Dublin, Ireland
Organizer:
USENIX Association
Abstract:
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.
Event listing ID:
1489771
16
SREcon24 Americas
18 Mar 2024 - 20 Mar 2024 • San Francisco, CA, United States
Organizer:
USENIX Association
Abstract:
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.
Event listing ID:
1489857


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: 21 September 2022