Warsaw, June 3-June 5, 2024
https://highlightsofalgorithms.org/
The Highlights of Algorithms conference is 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 Highlights of Algorithms conference will also be an opportunity for networking and meeting leading researchers in algorithms.
REGISTRATION
https://systemcoffee.pl/?lang=en&go2rej=1&kid=1536
Early registration fee (by May 6th)
Regular: 800pln (about 185 Euro)
Student: 600pln (about 140 Euro)
-------------------------------------------------------------------
Invited Speakers
Survey Speakers:
Shiri Chechik (Tel-Aviv University, Israel)
Paul Duetting (Google Switzerland)
Bernhard Haeupler (CMU and ETH)
Sam Hopkins (MIT)
Kurt Mehlhorn (MPI)
Ronitt Rubinfeld (MIT)
Invited Talks:
Soheil Behnezhad (Northeastern University): Dynamic Algorithms for Maximum Matching Size
Naama Ben-David (Technion): The FIDS Theorems: Tensions between Multinode and Multicore Performance in Transactional Systems
Christian Coester (University of Oxford): The Randomized k-Server Conjecture is False!
Andrés Cristi (University of Chile). A Constant Factor Prophet Inequality for Online Combinatorial Auctions
Gary Hoppenworth (University of Michigan): Folklore Sampling is Optimal for Exact Hopsets: Confirming the $\sqrt{n}$ Barrier
Shang-En Huang (Boston College): Byzantine Agreement with Optimal Resilience via Statistical Fraud Detection
Sanjeev Khanna (University of Pennsylvania): A Faster Combinatorial Algorithm for Maximum Bipartite Matching
Tomasz Kociumaka (Max Planck Institute for Informatics): Weighted Edit Distance Computation: Strings, Trees and Dyck
Tuukka Korhonen (University of Bergen): Dynamic treewidth
Annamária Kovács (Goethe University Frankfurt): A Proof of the Nisan-Ronen Conjecture
William Kuszmaul (Harvard University): Tiny Pointers
Kasper Green Larsen (Aarhus University): Bagging is an Optimal PAC Learner
Jason Li (CMU): Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
Chris Schwiegelshohn (Aarhus University): Deterministic Clustering in High Dimensional Spaces: Sketches and Approximation
Cameron Seth (University of Waterloo): Testing Graph Properties with the Container Method
David Wajc (Technion): Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
