Articles avec mandats d'accès public - Matthew FahrbachEn savoir plus
Disponibles quelque part : 10
Submodular maximization with nearly optimal approximation, adaptivity and query complexity
M Fahrbach, V Mirrokni, M Zadimoghaddam
ACM-SIAM Symposium on Discrete Algorithms (SODA), 255-273, 2019
Exigences : US National Science Foundation
Edge-weighted online bipartite matching
M Fahrbach, Z Huang, R Tao, M Zadimoghaddam
Journal of the ACM 69 (6), 45:1-45:35, 2022
Exigences : US National Science Foundation
Non-monotone submodular maximization with nearly optimal adaptivity and query complexity
M Fahrbach, V Mirrokni, M Zadimoghaddam
International Conference on Machine Learning (ICML), 1833-1842, 2019
Exigences : US National Science Foundation
Faster graph embeddings via coarsening
M Fahrbach, G Goranci, R Peng, S Sachdeva, C Wang
International Conference on Machine Learning (ICML), 2953-2963, 2020
Exigences : US National Science Foundation, Conseil de recherches en sciences naturelles …
Coefficients and roots of peak polynomials
S Billey, M Fahrbach, A Talmage
Experimental Mathematics 25 (2), 165-175, 2016
Exigences : US National Science Foundation
Graph sketching against adaptive adversaries applied to the minimum degree algorithm
M Fahrbach, GL Miller, R Peng, S Sawlani, J Wang, SC Xu
IEEE Symposium on Foundations of Computer Science (FOCS), 101-112, 2018
Exigences : US National Science Foundation
Approximately sampling elements with fixed rank in graded posets
P Bhakta, B Cousins, M Fahrbach, D Randall
ACM-SIAM Symposium on Discrete Algorithms (SODA), 1828-1838, 2017
Exigences : US National Science Foundation
Analyzing Boltzmann samplers for Bose–Einstein condensates with Dirichlet generating functions
M Bernstein, M Fahrbach, D Randall
Meeting on Analytic Algorithmics and Combinatorics (ANALCO), 107-117, 2018
Exigences : US National Science Foundation
Nearly tight bounds for sandpile transience on the grid
D Durfee, M Fahrbach, Y Gao, T Xiao
ACM-SIAM Symposium on Discrete Algorithms (SODA), 605-624, 2018
Exigences : US National Science Foundation
A fast minimum degree algorithm and matching lower bound
R Cummings, M Fahrbach, A Fatehpuria
ACM-SIAM Symposium on Discrete Algorithms (SODA), 724-734, 2021
Exigences : US National Science Foundation
Les informations concernant la publication et le financement sont déterminées automatiquement par un programme informatique