Enric Boix-Adserà

From MaRDI portal
Person:2049459

Available identifiers

zbMath Open boix-adsera.enricMaRDI QIDQ2049459

List of research outcomes





PublicationDate of PublicationType
Polynomial-time algorithms for multimarginal optimal transport problems with structure2023-05-02Paper
Wasserstein Barycenters Are NP-Hard to Compute2022-03-21Paper
Graph Powering and Spectral Robustness2022-02-03Paper
Hardness results for multimarginal optimal transport problems2022-01-18Paper
The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs2021-10-18Paper
The multiplayer Colonel Blotto game2021-08-25Paper
https://portal.mardi4nfdi.de/entity/Q49989352021-07-09Paper
An information-percolation bound for spin synchronization on general graphs2021-03-18Paper
Randomized Concurrent Set Union and Generalized Wake-Up2021-01-20Paper
Wasserstein barycenters are NP-hard to compute2021-01-04Paper
Wasserstein barycenters can be computed in polynomial time in fixed dimension2020-06-14Paper
The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs2019-03-19Paper
Subadditivity Beyond Trees and the Chi-Squared Mutual Information2019-02-06Paper

Research outcomes over time

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:2049459&oldid=6525044"
Powered by MediaWiki