Enric Boix-Adserà

zbMath Openboix-adsera.enricMaRDI QIDQ2049459

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Polynomial-time algorithms for multimarginal optimal transport problems with structure	2023-05-02	Paper
Wasserstein Barycenters Are NP-Hard to Compute	2022-03-21	Paper
Graph powering and spectral robustness	2022-02-03	Paper
Hardness results for multimarginal optimal transport problems	2022-01-18	Paper
The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs	2021-10-18	Paper
The multiplayer Colonel Blotto game	2021-08-25	Paper
scientific article; zbMATH DE number 7370561 (Why is no real title available?)	2021-07-09	Paper
An information-percolation bound for spin synchronization on general graphs	2021-03-18	Paper
Randomized Concurrent Set Union and Generalized Wake-Up	2021-01-20	Paper
Wasserstein barycenters are NP-hard to compute	2021-01-04	Paper
Wasserstein barycenters can be computed in polynomial time in fixed dimension	2020-06-14	Paper
The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs	2019-03-19	Paper
Subadditivity Beyond Trees and the Chi-Squared Mutual Information	2019-02-06	Paper

Research outcomes over time

This page was built for person: Enric Boix-Adserà