The workshop will
take place from Monday, the 5th September 2022 to Friday, the 9th
September 2022 (until noon), in CAES-CNRS
Centre Paul Langevin, in Aussois in the French Alps. Arrivals are on Sunday and departures on Friday. The workshop is
by invitation only and is a community building effort by SIAM ACDA.
We are particularly excited about organizing an in-person. During the seminar, the participants will exchange new ideas and results and discuss new developments.
| Sunday | ||
|---|---|---|
| 19:45--onwards | Dinner [Cold plates] | |
| Monday | ||
| 07:30--08-30 | Breakfast | |
| 09:45--10:00 | Welcome talk [Salle Parrache] | Aydın, Bora, Michael |
| 10:00--10:30 | Coffee | |
| Technical session | Chair: Michael Bender | |
| 10:30--10:50 | ACDA presentation (slides) | Ales Pothen & Cindy Philips |
| 10:55--11:15 | Recent advances and challenges in algebraic programming and hypergraph applications (slides) | Albert-Jan Yzelman |
| 11:20--11:40 | Coupe: a mesh partitioner | Cedric Chevalier |
| 12:00--13:00 | Lunch | |
| Break | ||
| Technical session | Chair: Aydın Buluç | |
| 18:00--18:20 | ML Accelerator Hardware: A Model for Parallel Sparse Computations? (slides) | Johannes Langguth |
| 18:25--18:45 | Algorithmic Tools for Congressional Districting: Fairness via Analytics | David Shmoys |
| 18:50--19:10 | Sparse matrices in biology and machine learning (slides) | Aydın Buluç |
| 19:30--20h30 | Dinner | |
| Tuesday | ||
| 07:30--08-30 | Breakfast | |
| 08:40--08:45 | Announcements | Aydın, Bora, Michael |
| Technical session | Chair: Bora Uçar | |
| 08:50--09:10 | PaCHash: Packed and Compressed Hash Tables slides) | Florian Kurpicz |
| 09:15--09:35 | Online List Labeling: Breaking the log^2(n) Barrier (slides) | Hanna Komlos |
| 09:40--10:00 | Vector quotient filter | Prashant Pandey |
| 10:00--10:25 | Coffee | |
| Technical session | Chair: Kathrin Hanauer | |
| 10:25--10:45 | Optimizing Dynamic Graph Processing with the Locality-First Strategy (slides) | Helen Xu |
| 10:50--11:10 | Parallel batch-dynamic algorithm for approximate k-core decomposition (slides) | Julian Shun |
| 11:15--11:35 | Theoretically and Practically Efficient Parallel Nucleus Decomposition (slides) | Jessica Shi |
| 11:40--12:00 | Dynamic Graph Connectivity: To Infinity And Beyond | David Tench |
| 12:00--13:00 | Lunch | |
| Break | ||
| 17:15--17:35 | Community session | Host: Blair Sullivan |
| Technical session | Chair: Cindy Philips | |
| 17:40--18:00 | Faster Greedy Optimization of Resistance-based Graph Robustness (slides) | Henning Meyerhenke |
| 18:05--18:25 | Inferring Tie Strength in Temporal Networks | Lutz Oettershagen |
| 18:30--18:50 | Matching on the line admits no $o(\sqrt{\log n})$-competitive algorithm | Michele Scquizzato |
| 18:55--19:15 | Greedily Growing a Maximal Independent Set to Approximate Vertex Cover (slides) | Nathan Veldt |
| 19:20--19:35 | On spline surrogate models and reformulation techniques for MINLPs with separable non-convexities | Vanesa Guerrero and Claudia D'Ambrosio |
| 19:40--20h30 | Dinner | |
| Wednesday | ||
| 07:30--08-30 | Breakfast | |
| 12:00--13:00 | Lunch | |
| Technical session | Chair: Olivier Beaumont | |
| 17:40--18:00 | SplinterDB + Maplets: Improving the Trade-offs in Key-Value Store Compaction Policy | Alex Conway |
| 18:05--18:25 | Write-optimized algorithms for cybersecurity stream monitoring | Cindy Phillips |
| 18:30--18:50 | Towards Accelerating AI using Fast and Feasible Matrix Multiplication | Oded Schwartz |
| 18:55--19:15 | To catch a thief (the blockchain edition) (slides) | Seth Gilbert |
| 19:30--20h30 | Dinner | |
| Thursday | ||
| 07:30--08:30 | Breakfast | |
| 08:40--08:45 | Announcements | Aydın, Bora, Michael |
| Technical session | Chair: Sivan Toledo | |
| 08:50--09:10 | Graph Partitioning and Randomized Linear Algebra (slides) | Erik Boman |
| 09:15--09:35 | Data Distribution for Symmetric Linear Algebra Kernels (slides) | Lionel Eyraud-Dubois |
| 09:40--10:00 | Online Parallel Paging and Green Paging (slides) | Michael Bender |
| 10:00--10:30 | Coffee | |
| Technical session | Chair: Alex Pothen | |
| 10:30--10:50 | Memory optimization for training in DNNs (slides) | Olivier Beaumont |
| 10:55--11:15 | Smoothing Discontinuous Concatenated Functions (slides) | Sebastian Christodoulou |
| 11:20--11:40 | Combinatorial problems in sparse matrix and sparse tensor applications (slides) | Sherry Li |
| 12:00--13:00 | Lunch | |
| Break | ||
| Technical session | Chair: John Gilbert | |
| 17:30--17:50 | Combinatorial Problems and Algorithms in Robust Estimation (slides) | Sivan Toledo |
| 17:55--18:15 | Density-Driven Path Metrics: Graphs, Manifolds, and Data (slides) | James Murphy |
| 18:20--18:40 | Efficient Algorithms via Inexact Linear Solvers and Randomized Sampling | Edgar Solomonik |
| 18:45--19:05 | Matrix anti-concentration inequalities with applications | Zipei Nie |
| 19:10--19:30 | Disjoint weighted matchings for reconfigurable optical datacenter technologies | Kathrin Hanauer |
| 19:30--20h30 | Dinner | |
| Friday | ||
| 07:30--08-30 | Breakfast | |
| 09:10--09:50 | Closing session | Blair, Bora, Cindy, Henning |
| 10:00--10:30 | Coffee | |
| 12:00--13:00 | Lunch |