| It's compaslicated: The messy relationship between rai datasets and algorithmic fairness benchmarks M Bao, A Zhou, S Zottola, B Brubach, S Desmarais, A Horowitz, K Lum, ... arXiv preprint arXiv:2106.05498, 2021 | 107 | 2021 |
| Online Stochastic Matching: New Algorithms and Bounds B Brubach, KA Sankararaman, A Srinivasan, P Xu Algorithmica 82 (10), 2737-2783, 2020 | 94* | 2020 |
| Probabilistic fair clustering S Esmaeili, B Brubach, L Tsepenekas, J Dickerson Advances in Neural Information Processing Systems 33, 12743-12755, 2020 | 42 | 2020 |
| A pairwise fair and community-preserving approach to k-center clustering B Brubach, D Chakrabarti, J Dickerson, S Khuller, A Srinivasan, ... International conference on machine learning, 1178-1189, 2020 | 41 | 2020 |
| Attenuate locally, win globally: Attenuation-based frameworks for online stochastic matching with timeouts B Brubach, KA Sankararaman, A Srinivasan, P Xu Algorithmica 82, 64-87, 2020 | 33 | 2020 |
| Fair clustering under a bounded cost S Esmaeili, B Brubach, A Srinivasan, J Dickerson Advances in Neural Information Processing Systems 34, 14345-14357, 2021 | 29 | 2021 |
| Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints B Brubach, D Chakrabarti, JP Dickerson, A Srinivasan, L Tsepenekas arXiv preprint arXiv:2103.02013, 2021 | 27 | 2021 |
| Improved bound for online square-into-square packing B Brubach International Workshop on Approximation and Online Algorithms, 47-58, 2014 | 22* | 2014 |
| Improved guarantees for offline stochastic matching via new ordered contention resolution schemes B Brubach, N Grammel, W Ma, A Srinivasan Advances in Neural Information Processing Systems 34, 27184-27195, 2021 | 19 | 2021 |
| Follow your star: New frameworks for online stochastic matching with known and unknown patience B Brubach, N Grammel, W Ma, A Srinivasan International Conference on Artificial Intelligence and Statistics, 2872-2880, 2021 | 19* | 2021 |
| Algorithms to approximate column-sparse packing problems B Brubach, KA Sankararaman, A Srinivasan, P Xu ACM Transactions on Algorithms (TALG) 16 (1), 1-32, 2019 | 12 | 2019 |
| Current progress and future opportunities in applications of bioinformatics for biodefense and pathogen detection: report from the Winter Mid-Atlantic Microbiome Meet-up … JS Meisel, DJ Nasko, B Brubach, V Cepeda-Espinoza, J Chopyk, ... Microbiome 6, 1-10, 2018 | 12 | 2018 |
| Further improvement in approximating the maximum duo-preservation string mapping problem B Brubach International Workshop on Algorithms in Bioinformatics, 52-64, 2016 | 11 | 2016 |
| Meddling metrics: the effects of measuring and constraining partisan gerrymandering on voter incentives B Brubach, A Srinivasan, S Zhao Proceedings of the 21st ACM Conference on Economics and Computation, 815-833, 2020 | 8 | 2020 |
| Online matching frameworks under stochastic rewards, product ranking, and unknown patience B Brubach, N Grammel, W Ma, A Srinivasan Operations Research, 2023 | 6 | 2023 |
| Fair labeled clustering SA Esmaeili, S Duppala, JP Dickerson, B Brubach Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and …, 2022 | 6 | 2022 |
| A succinct four Russians speedup for edit distance computation and one-against-many banded alignment B Brubach, J Ghurye 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018 | 5 | 2018 |
| Better greedy sequence clustering with fast banded alignment B Brubach, J Ghurye, M Pop, A Srinivasan 17th International Workshop on Algorithms in Bioinformatics (WABI 2017), 2017 | 4 | 2017 |
| Centralized fairness for redistricting SA Esmaeili, H Grape, B Brubach arXiv preprint arXiv:2203.00872, 2022 | 3 | 2022 |
| Approximating two-stage stochastic supplier problems B Brubach, N Grammel, DG Harris, A Srinivasan, L Tsepenekas, ... arXiv preprint arXiv:2008.03325, 2020 | 3 | 2020 |
Aravind SrinivasanProfessor of Computer Science and Distinguished University Professor, University of Maryland在 umd.edu 的电子邮件经过验证
