Conferences and Meetings on Algorithms

Verona University & University of Sfax

Email: ihsen_yengui@yahoo.fr

CONSTRUCTIVE ALGEBRA, LOGICS, COMPUTER ALGEBRA, ALGEBRAIC GEOMETRY.

Kyoto University/Nagoya University

SIAM Activity Group on Applied and Computational Discrete Algorithms

Scientific Computing ,    Graph Theory and Combinatorics

Mathematical models of scientific applications often involve simulations with a large number of degrees of freedom that strain even the most efficient of algorithms. A clear need is the rigorous development of models with reduced complexity that retain fidelity to the application. Mathematics-based reduced-order modeling applies techniques in nonlinear approximation, projection-based discretizations, sparse surrogate construction, and high-dimensional approximation, in order to construct a model surrogate with near-optimal approximation properties. This workshop focuses on theoretical and algorithmic advances in mathematics-based model order reduction of various types: reduced basis methods, projection-based methods for dynamical systems, and sparse and low-rank approximations in high dimensions.

WordCamps are volunteer-organized conferences covering everything related to WordPress, free and open source software designed for everyone, emphasizing accessibility, performance, security, and ease of use. WordCamp Asia 2020 is the first flagship WordCamp in Asia.

Email: asia@wordcamp.org

We are looking for diverse topics and inspirational stories. If you’re not sure what to talk about and need some ideas, here are the topics most asked about in our survey: Advanced development, Accessible design, Agile frameworks, Culture, Project management, Scaling up the business, SEO, Storytelling, Success stories, Working remotely ‘best practices’.

Social Networks and Social Aspects of Information Techonology,    Human-Computer Interaction, User Experience

USENIX in cooperation with ACM SIGCOMM and ACM SIGOPS

NSDI focuses on the design principles, implementation, and practical evaluation of networked and distributed systems. Our goal is to bring together researchers from across the networking and systems community to foster a broad approach to addressing overlapping research challenges.

Networks, Internet,    Software Engineering

ACM - Association for Computing Machinery

The ACM sponsored TAU series of workshops provide an informal forum for practitioners and researchers working on temporal aspects of digital systems to disseminate early work and engage in a free discussion of ideas. The twenty-seventh in the TAU series, and on its 30th anniversary, the TAU 2020 workshop emphasizes novel aspects of timing and power analysis as well as optimization with special invited talks. TAU also organizes a student contest each year, this year the contest topic is "Delay calculation using current models". More details can be found on the TAU website (www.tauworkshop.com)

General Chair;     Phone: [+1 978 502 0825];     Email: joao.geada@ansys.com

static timing analysis, statistical timing analysis, design optimization, power optimization, variability, clock design, library characterization

Electronic Engineering,    Semiconductors

Mathematical advances that reduce the complexity of models are complemented by algorithms that achieve the desired reduction in computational effort. This workshop focuses on the synthesis and development of algorithmic approaches to model order reduction. These methods tackle fundamental problems in structure- and topology-preserving reductions, low-rank models and dimension reduction, multi-level approaches, and empirical interpolation and approximations, etc. Complementary approaches that target computational efficiency include strategies with offline and online phases and divide-and-conquer algorithms.

Association of Computing Machinery (acm)

Multidisciplinary or General Events in Informatics,    Scientific Computing

CIRM – Centre International de Rencontres Mathématiques

This proposal aims to develop further a novel domain of computational group theory: the design of algorithms and software for finitely generated linear groups over infinite fields. Our research is motivated by the applications of linear groups in many areas of mathematics, and the high demand for algorithms to carry out practical computations. We plan to advance our recently obtained computational techniques, based on exploring Zariski density and the strong approximation property. Specifically, we will complete the design of algorithms for isometry groups over infinite domains, and apply implementations of these algorithms to solve hard open problems via computer-aided experimentation. The latter includes experiments with symplectic hypergeometric monodromy groups. All results will be new. Moreover, the algorithms will be the first-ever of their kind, satisfying the demand for practical computational methods in the areas concerned.

CIRM – Centre International de Rencontres Mathématiques

Centre International de Rencontres Mathématiques (CIRM)

DIMACS, Rutgers University

MIP 2020 features DANniversay -- a special day celebrating the 60th birthday of Prof. Daniel Bienstock, founder of the series of MIP workshops.

International Conference on Computational Science and Numerical Algorithms (CSMA 2020) will be held from May 29-31, 2020 in Xiamen, China. CSMA 2020 will cover issues on Applications of computational science,Problem solving environments, Complex systems: modeling and simulation, Web and grid based simulation and computing, Linear and nonlinear programming, Advanced computing architectures and new programming models, Computational humanities, etc.

The 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.

Since its inception in 1989 as AWOCA (Australasian Workshop on Combinatorial Algorithms), IWOCA has provided an annual forum for researchers who design algorithms for the myriad combinatorial problems that underlie computer applications in science, engineering and business.

The Tenth International Conference on Fun with Algorithms (FUN 2020) will be held in Island of Favignana, Trapani, Sicily, Italy, on June 8 – 10, 2020. FUN is dedicated to the use, design and analysis of algorithms and data structures, focusing on results that provide amusing, witty but nonetheless original and scientifically profound contributions to the area.

Facultad de Ciencias of the Universidad de Cantabria

Algorithms and Complexity, Combinatorics, Coding Theory, Cryptography, Discrete and Computational Geometry, Discrete Optimization, Graph Theory, Location and Related Problems

Graph Theory and Combinatorics,    Numerical Analysis and Computational Mathematics

EURO Working Group on Stochastic Modelling / Politecnico di Milano

StochMod - the biennial meeting of the EURO Working Group on Stochastic Modelling - is the premier European forum for researchers who have an interest in stochastic modelling. Its eight edition will take place in Milan, at Politecnico di Milano.

Imperial College, London

Mixed-integer nonlinear optimisation (MINLP) combines the modelling capabilities of mixed-integer linear programming with nonlinear programming into a flexible framework for dealing with a large variety of optimisation problems. The MINLP Workshop brings together world-leading researcher in the field of mixed-integer nonlinear optimisation, and covers topics ranging from theoretical and algorithmic advances to industrial applications. The workshop is held at the South Kensington Campus at Imperial College right in the centre of London.

The Cologne-Twente Workshop on Graphs and Combinatorial Optimization 2020 welcomes contributions on theory and applications of discrete algorithms, graphs and combinatorial optimization in the wider sense. The series of Cologne-Twente Workshops on Graphs and Combinatorial Optimization started with meetings organized every two years by the universities of Cologne and Twente. The organizational base was later expanded by other universities. Since 2003 the workshop is held (almost) every year.

Alpen-Adria-Universität, Klagenfurt

The 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA2020) will take place June 15–19, 2020 at Alpen-Adria-Universität Klagenfurt. It is part of the series of annual meetings on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms.

Graph Theory and Combinatorics,    Information Theory, Foundations of Computer Science

SEA aims to attract papers from both the Computer Science and the Operations Research/Mathematical Programming communities. The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures.

Operational research,    Scientific Computing

SGH Warsaw School of Economics, Warsaw, Poland

The World Wide Web has become part of our everyday life, and information retrieval and data mining on the Web are now of enormous practical interest. The algorithms supporting these activities combine the view of the Web as a text repository and as a graph, induced in various ways by links among pages, hosts and users. The aim of the 17th Workshop on Algorithms and Models for the Web Graph (WAW 2020) is to further the understanding of graphs that arise from the Web and various user activities on the Web, and stimulate the development of high-performance algorithms and applications that exploit these graphs. The workshop will also welcome the researchers who are working on graph-theoretic and algorithmic aspects of citation networks, social networks, biological networks, molecular networks, and the Internet.

Graph Theory and Combinatorics,    Complex Networks

The Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), 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.

Algorithmic approaches of interest include, but are not limited to: approximation algorithms, parametrized algorithms, distributed algorithms, parallel algorithms, external-memory algorithms, data structures, exponential time algorithms, online algorithms, randomized algorithms, streaming algorithms, sub-linear algorithms.

Università dell'Insubria

The conference GASCom brings together researchers in combinatorics, algorithms, probabilities, and more generally mathematical computer science, around the theme of random and exhaustive generation of combinatorial structures, mostly considered from a theoretical point of view. In connection with this main theme, the conference is also interested in contributions in enumerative or analytic combinatorics, and interactions with other areas of mathematics, computer science, physics or biology. The conference is both interested in methods for random or exhaustive generation and in original results on combinatorial or algorithmic questions, whose solution has been made possible by an approach involving random or exhaustive generation.

Graph Theory and Combinatorics,    Information Theory, Foundations of Computer Science

Mathematical Sciences Research Institute (MSRI)

Probability theory, statistics as well as mathematical physics have increasingly been used in computer science. The goal of this school is to provide a unique opportunity for graduate students and young researchers to developed multi-disciplinary skills in a rapidly evolving area of mathematics.

Courses and Events for Physics Students,    Applied Mathematics (in general)

Graph problems have applications in many fields and typically require multidisciplinary approaches. The fifth edition of this school aims to bring together leading scientists, junior researchers and PhD students from several areas in order to discuss, possibly in a systematic and organic way, different approaches for solving graph problems. The school is organized in plenary lectures held by internationally renowned speakers. The intended audience consists of PhD students and junior researchers interested in graph problems, coming from several areas including (but not limited to) the design, analysis and experimentation of algorithms, operations research, optimization, and discrete mathematics.

Graph Theory and Combinatorics,    Courses and Events for Math Students and Early Career Researchers

Adam Mickiewicz University in Poznań

The CMSC conference series was initiated in 2013. The aim is to explore new ways of communicating the rich algorithmics and mathematics underlying computer science. The conference aims also to engage research mathematical scientists in outreach and communication. Bringing together researchers, educators and communicators committed to bringing exploration and discovery into classrooms and among the educated public, the conference hopes to explore new ways of thinking initiated by Computer Science Unplugged and other similar efforts. We invite researchers, teachers, students and everybody interested in innovative teaching ways.

Modern life science studies involve both biological and computational methods. Breakthrough results in these fields can only be achieved by tight communication and knowledge exchange between the two sides. The ultimate goal of the conference is to bring together bioinformaticians and biologists to share experience in development and practical application of bioinformatics algorithms.

Email: biata@spbu.ru

bioinformatics, computation biology, application, genomics, transcriptomics, Sequencing technologies, Molecular sequence analysis, Computational genomics, Genome assembly, Metagenomics, Agrigenomics, Viromics, CRISPR, Natural Producs Discovery

Genomics and Bioinformatics,    Systems Biology and Computational Biology

TU Wien / Journal Computational Methods in Applied Mathematics (CMAM)

The 9th edition of the conference (CMAM-9) takes place on July 13-17, 2020 in Vienna. The support of the Austrian Science Fund (FWF) through the Doctoral School (DK) Dissipation and dispersion in nonlinear PDEs (grant W1245) and the Special Research Program (SFB) Taming complexity in partial differential systems (grant F65), as well as of TU Wien and the Vienna Center for Partial Differential Equations is thankfully acknowledged.

Scientific Computing ,    Numerical Analysis and Computational Mathematics

Institute for Mathematical Sciences/National University of Singapore

The more data we have, the more data we need to process. Whether it is internet traffic or biological data, the hardware is never fast enough. The aim of this workshop is to focus on analysing data under new models: when the data cannot be stored (e.g., identifying viruses in the Internet traffic), when we use multiple cores to analyse the data, and when we are generating short sketches of the data to be sent and analysed by someone else. We believe a new set of algorithmic techniques (which rely mostly on statistics and on data structures) can be used in these models, and wish to find such techniques and employ them. An important focus of this workshop is to find algorithms which are elegant, and thus can also be used in practice. To develop these algorithms, it is critical to connect the key subareas of algorithmic research on big data. These key subareas include streaming, sketching, and sampling. The goal of the workshop is to bring researchers together from these different sub-areas and to establish strong collaborations among the attendees.

Applied Mathematics (in general),    Information & Knowledge Management, Big Data Computing

ACM Special Interest Groups on Algorithms and Computation Theory (SIGACT) and Computer Architecture (SIGARCH) and organized in cooperation with the European Association for Theoretical Computer Science

Software Engineering,    Grid-, Distributed- and Cloud Computing

Universität Augsburg

Parametric optimization is a part of mathematical programming and has emerged as an exciting research area in theory, numerics and applications. It investigates the properties of solutions to optimization problems under data perturbations or uncertainty. Many relations to other disciplines of operations research, like stochastic programming, complementarity problems, mixed-integer problems, model-building, numerical methods, multi-objective optimization and optimal control, originate from these properties.

Operational research,    Modeling and Simulation

CIRM – Centre International de Rencontres Mathématiques

Applied Mathematics (in general),    Scientific Computing

CIRM – Centre International de Rencontres Mathématiques

CIRM – Centre International de Rencontres Mathématiques

Software Engineering,    Applied Mathematics (in general)

CIRM – Centre International de Rencontres Mathématiques

Neural Networks and Artificial Intelligence, Machine Learning,    Probability and Statistics, Game Theory