Enric Boix-Adserà

MaRDI QIDQ2049459zbMATH OpenFDO

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
The average-case complexity of counting cliques in Erdős-Rényi hypergraphs SIAM Journal on Computing	2025-09-16	Paper
Chow-Liu++: optimal prediction-centric learning of tree Ising models	2025-08-13	Paper
The average-case complexity of counting cliques in Erdős-Rényi hypergraphs	2025-08-12	Paper
Polynomial-time algorithms for multimarginal optimal transport problems with structure Mathematical Programming. Series A. Series B	2023-05-02	Paper
Wasserstein Barycenters Are NP-Hard to Compute SIAM Journal on Mathematics of Data Science	2022-03-21	Paper
Graph powering and spectral robustness SIAM Journal on Mathematics of Data Science	2022-02-03	Paper
Hardness results for multimarginal optimal transport problems Discrete Optimization	2022-01-18	Paper
The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs SIAM Journal on Computing	2021-10-18	Paper
The multiplayer Colonel Blotto game Games and Economic Behavior	2021-08-25	Paper
scientific article; zbMATH DE number 7370561 (Why is no real title available?) (available as arXiv preprint)	2021-07-09	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 The Annals of Applied Probability	2021-03-18	Paper
An information-percolation bound for spin synchronization on general graphs The Annals of Applied Probability	2021-03-18	Paper
Randomized Concurrent Set Union and Generalized Wake-Up Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing	2021-01-20	Paper
Wasserstein barycenters are NP-hard to compute (available as arXiv preprint)	2021-01-04	Paper
Wasserstein barycenters can be computed in polynomial time in fixed dimension (available as arXiv preprint)	2020-06-14	Paper
The Average-Case Complexity of Counting Cliques in Erdos-Renyi Hypergraphs (available as arXiv preprint)	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à