research
∙
03/18/2022
Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs
We solve the Bin Packing problem in O^*(2^k) time, where k is the number...
share
research
∙
07/12/2021
Noisy searching: simple, fast and correct
This work revisits the multiplicative weights update technique (MWU) whi...
research
∙
08/17/2020
Cardinality estimation using Gumbel distribution
Cardinality estimation is the task of approximating the number of distin...
research
∙
07/17/2020
All-Pairs LCA in DAGs: Breaking through the O(n^2.5) barrier
Let G=(V,E) be an n-vertex directed acyclic graph (DAG). A lowest common...
research
∙
04/30/2020