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.
-------------------------------------------------------------------
Call For Submissions of Contributed Presentations
The IGAFIT HALG 2024 conference seeks submissions for contributed presentations. Each presentation is expected to consist of a short talk followed by a question and answer session. There will be no conference proceedings, hence presenting work already published or accepted at a different venue or journal (or to be submitted there) is welcome.
Please submit the paper by registering in the link: https://systemcoffee.pl/?lang=en&go2rej=1&kid=1536
Please choose: Participant category = "participant with abstract". No payment should be made at this time.
After registration, you can login through the link: https://systemcoffee.pl/?lang=en&go2logPanel=1&kid=1536
The abstract should include (when relevant) information where the results have been published/accepted (e.g., conference), and where they are publicly available (e.g., ArXiv). All submissions will be reviewed by the program committee, giving priority to work accepted or published in 2023 or later.
Submissions deadline: March 29th, 2024, 23:00 GMT.
Acceptance/rejection notifications for contributed presentations: April 30th, 2024.
-------------------------------------------------------------------
Invited Speakers
Survey Speakers (partial): Shiri Chechik, Paul Duetting, Bernhard Haeupler, Sam Hopkins, Ronitt Rubinfeld
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
