CWI Soirée and Van Wijngaarden Awards 2021

On Thursday 18 November 2021, CWI will present the Van Wijngaarden Award to a mathematician and computer scientist of special significance during the festive Soirée.

More information will follow asap.

• iCal

CWI Lectures on Decision Making under Uncertainty

This year’s edition of the CWI Lectures revolves around Decision Making under Uncertainty

The Lectures are aimed towards a general academic public and in 2021 the program committee consists of Bert Zwart (Stochastics research group), Daan Crommelin (Scientific Computing research group) and Peter Grunwald (Machine Learning research group).

Confirmed speakers for now:
- Pinar Keskinocak (Georgia Institute of Technology)
- Leonard (Lenny) Smith (Virginia Tech)
- Gergely Neu (Universitat Pompeu Fabra Barcelona)

More information about the program and speakers will follow asap.

For inquiries and further details about the Lectures, please contact event coordinator Daniëlle Kollerie (D.C.Kollerie@cwi.nl) .

• iCal

CWI Open Dag 2 oktober 2021

CWI doet mee aan de Amsterdam Science Park Open Dag tijdens het Weekend van de Wetenschap. Op zaterdag 2 oktober 2021 is het gebouw geopend van 12.00 - 17.00 voor alle belangstellenden.

Binnenkort valt hier te lezen wat er die dag allemaal te doen is op het CWI.

Bereikbaarheid: Wij raden aan om met het openbaar vervoer naar Amsterdam Science Park te komen. Op station Amsterdam Science Park stoppen vier keer per uur treinen. GVB-bus 40 rijdt elke 15 minuten vanaf de stations Amstel en Muiderpoort naar Amsterdam Science

• iCal

Girlsday 2021

On Thursday 15 April, around 15 girls of the Hervormd Lyceum West Amsterdam will meet up via Zoom with CWI scientists to learn more about what CWI does, how and why.

Our colleague Annette Kik will introduce them to CWI's history, our milestones and explain what our scientists do.

Yfke Dulek will talk about quantum computers and Nanda Piersma will tell them everything about responsible AI.

Girlsday is set up by the Dutch national expert organisation on girls and women in science and technology (VHTO). The goal of Girlsday is to promote girls’ interest in science, technology, engineering and mathematics careers.
During Girlsday, technical companies, (non-)governmental organizations, and research institutes open their doors for 10-15 year old girls. VHTO has organized Girlsday in the Netherlands annually since 2010.

Girlsday 2019 - visit to our FleXray Lab

• iCal

QuSoft Seminar: Daniel Grier (University of Waterloo)

Everyone is welcome to attend the online lecture of Daniel Grier (University of Waterloo). Title: Classical Algorithms for Forrelation. Abstract:
This talk will feature the problem of forrelation:  given two Boolean functions, estimate the correlation between one function and the Fourier transform of the other.  There is a sense in which forrelation captures one of the hardest problems solvable by a quantum computer.  For example, forrelation witnesses the largest possible separation between classical and quantum query complexity, and a natural generalization is BQP-complete. However, one can still ask the questions "What are the best classical algorithms for forrelation?" and "Are there interesting restricted settings in which forrelation becomes efficiently computable?"  In this talk, I will focus on the latter question.  I will introduce a family of Boolean functions defined over a graph and show that the forrelation can be computed efficiently whenever the graph is sufficiently structured (e.g. bipartite, planar).  As an application, this will imply an efficient classical algorithm to compute level-2 variational energies in the Quantum Approximation Optimization Algorithm (QAOA) over similarly structured graphs.

Please contact Jop Briet or Suhasree Patro for the link to this seminar.

• iCal

IGAFIT Algorithmic Colloquium: Karl Bringmann, Saarland University

This new online event aims to integrate the European algorithmic community and keep it connected during the times of the pandemic. Nikhil Bansal (N&O) is one of the organizers.

Speaker: Karl Bringmann, Saarland University. Title: Fine-Grained Complexity of Optimization Problems
Abstract: Fine-grained complexity theory is the area of theoretical computer science that proves conditional lower bounds based on conjectures such as the Strong Exponential Time Hypothesis. This enables the design of "best-possible" algorithms, where the running time of the algorithm matches a conditional lower bound.

The meeting will be held using Airmeet platform and to attend
please go to https://www.airmeet.com/e/c5d58880-9240-11eb-974a-f53cdfe77b59. You can find more information about the talk on IGAFIT web page: http://igafit.mimuw.edu.pl/?page_id=483786.
In order to access Airmeet platform, you will need to register, so that others know who you are.

• Web
• iCal