Please find the programme for each day of the conference below.
Contributed Talks - chaired by Sagnik Mukhopadhyay
contributions
|
Sukanya Pandey
|
Planar Multiway Cut with Terminals on Few Faces
|
|
Javier Cembrano
|
Multidimensional Apportionment through Discrepancy Theory
|
|
Raphael Meyer
|
Hutch++: Optimal Stochastic Trace Estimation
|
|
Jakub Tarnawski
|
Online Edge Coloring via Tree Recurrences and Correlation Decay
|
|
Marcel Dall'Agnol
|
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy
|
|
Evangelos Kipouridis
|
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor
|
|
Spyros Angelopoulos
|
Online Search With Best-Price and Query-Based Predictions
|
|
Andreas Emil Feldmann
|
The Parameterized Complexity of the Survivable Network Design Problem
|
|
Henrik Lievonen
|
Online Algorithms with Lookaround
|
|
Dimitrios Los
|
Balanced Allocations: Relaxing (without) the Second Choice
|
|
Karol Węgrzycki
|
Improving Schroeppel and Shamir's algorithm for subset sum via orthogonal vectors
|
|
Gopinath Mishra
|
Faster Counting and Sampling Algorithms using Colorful Decision Oracle
|
|
Adam Polak
|
Knapsack and Subset Sum with Small Items
|
|
Fabian Kuhn
|
Latency, Capacity, and Distributed Minimum Spanning Trees
|
|
Chen Amiraz
|
Distributed sparse normal means estimation with sublinear communication
|
Contributed Talks - chaired by Uriel Feige
contributed talks
|
Federico Fusco
|
A Regret Analysis of Bilateral Trade
|
|
Luca Zanetti
|
Geometric Bounds on the Fastest Mixing Markov Chain
|
|
Peter Kiss
|
Deterministic Dynamic Matching In Worst-Case Update Time
|
|
Yael Hitron
|
Broadcast CONGEST Algorithms against Adversarial Edges
|
|
Weiming Feng
|
Rapid mixing of Glauber dynamics via spectral independence for all degrees
|
|
Ioana Bercea
|
An extendable data structure for incremental stable perfect hashing
|
|
Aris Filos-Ratsikas
|
FIXP-membership via Convex Optimization: Games, Cakes, and Markets
|
|
Nick Fischer
|
Almost-Optimal Sublinear-Time Edit Distance in the Low Distance Regime
|
|
Asaf Petruschka
|
Near-Optimal Distributed Computation of Small Vertex Cuts
|
|
Konstantin Zabarnyi
|
Multi-Channel Bayesian Persuasion
|
|
Francesco d'Amore
|
Search via Parallel Lévy Walks on %%Z^2%%
|
|
Alexandros Hollender
|
Further Collapses in TFNP
|
|
Oded Nir
|
Secret Sharing, Slice Formulas, and Monotone Real Circuits
|
|
Gopinath Mishra
|
Interplay between Graph Isomorphism and Earth Mover’s Distance in the Query and Communication Worlds
|
|
Andreas Padalkin
|
Coordinating Amoebots via Reconfigurable Circuits
|
Contributed Talks - chaired by Ioana Bercea
Contributed Talks
|
Sujoy Bhore
|
Euclidean Steiner Spanners: Light and Sparse
|
|
Jens Schlöter
|
Orienting (hyper)graphs under explorable stochastic uncertainty
|
|
Tomer Ezra
|
Combinatorial Contracts
|
|
Mary Scott
|
Aggregation and Transformation of Vector-Valued Messages in the Shuffle Model of Differential Privacy
|
|
Hicham Lesfari
|
Biased Majority Opinion Dynamics: Exploiting graph k-domination
|
|
Parth Mittal
|
Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for Delta-Coloring
|
|
Minati De
|
Geometric Dominating Set and Set Cover via Local Search
|
|
Sorrachai Yingchareonthawornchai
|
Vertex Connectivity in Polylogarithmic Max-Flows
|
|
Renan Gross
|
Noise sensitivity from fractional query algorithms and the axis-aligned Laplacian
|
|
Christian Coester
|
Shortest Paths without a Map, but with an Entropic Regularizer
|
|
Alexander Lindermayr
|
Robustification of Online Graph Exploration Methods
|
|
Goran Zuzic
|
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing
|
|
Amir Ban
|
An Observational Learning Approach to Crowdfunding
|
|
Nikhil Ayyadevara
|
The Randomized Competitive Ratio of Weighted k-server is at Least Exponential
|
|
Jiaheng Wang
|
Algorithm and complexity for approximating the number of hypergraph colourings in the local lemma regime
|
|
Shay Sapir
|
Comparison of Matrix Norm Sparsification
|