Scholars@Duke

• Background
• 

  Education, Training, & Certifications

  • Ph.D., Duke University 2019
• 

  Previous Appointments & Affiliations

  • Assistant Research Professor of Computer Science, Computer Science, Trinity College of Arts & Sciences 2019 - 2020
• Research
• 

  Selected Grants

  • NSF INCLUDES Alliance: The Alliance for Identity-Inclusive Computing Education (AIICE): A Collective Impact Approach to Broadening Participation in Computing awarded by  National Science Foundation 2021 - 2026
  • CUE: Collaborative Research: Effective Peer Teaching Across Computing Pathways awarded by  National Science Foundation 2020 - 2023
• Publications & Artistic Works
• 

  Selected Publications

  • Academic Articles

    • Pujol, D., B. Fain, A. Sun, and A. Machanavajjhala. “Multi-Analyst Differential Privacy for Online Query Answering.” Proceedings of the Vldb Endowment 16, no. 4 (January 1, 2022): 816–28. https://doi.org/10.14778/3574245.3574265.
       Full Text
    • Lyu, L., B. Fain, K. Munagala, and K. Wang. “Centrality with Diversity.” Wsdm 2021  Proceedings of the 14th Acm International Conference on Web Search and Data Mining, August 3, 2021, 644–52. https://doi.org/10.1145/3437963.3441789.
       Full Text
    • Fain, B., W. Fan, and K. Munagala. “Concentration of distortion: The value of extra voters in randomized social choice.” Ijcai International Joint Conference on Artificial Intelligence 2021-January (January 1, 2020): 110–16.
    • Chen, X., B. Fain, L. Lyu, and K. Munagala. “Proportionally fair clustering.” 36th International Conference on Machine Learning, Icml 2019 2019-June (January 1, 2019): 1782–91.

  • Conference Papers

    • Lin, J., C. Chen, M. Chmielewski, S. Zaman, and B. Fain. “Auditing for Gerrymandering by Identifying Disenfranchised Individuals.” In Acm International Conference Proceeding Series, 1125–35, 2022. https://doi.org/10.1145/3531146.3533174.
       Full Text
    • Pujol, D., Y. Wu, B. Fain, and A. Machanavajjhala. “Budget sharing for multi-analyst differential privacy.” In Proceedings of the Vldb Endowment, 14:1805–17, 2021. https://doi.org/10.14778/3467861.3467870.
       Full Text
    • Fain, B., A. Goel, K. Munagala, and N. Prabhu. “Random dictators with a random referee: Constant sample complexity mechanisms for social choice.” In 33rd Aaai Conference on Artificial Intelligence, Aaai 2019, 31st Innovative Applications of Artificial Intelligence Conference, Iaai 2019 and the 9th Aaai Symposium on Educational Advances in Artificial Intelligence, Eaai 2019, 1893–1900, 2019.
    • Fain, B., K. Munagala, and N. Shah. “Fair allocation of indivisible public goods.” In Acm Ec 2018  Proceedings of the 2018 Acm Conference on Economics and Computation, 575–92, 2018. https://doi.org/10.1145/3219166.3219174.
       Full Text
    • Kunjir, M., B. Fain, K. Munagala, and S. Babu. “ROBUS: Fair cache allocation for data-parallel workloads.” In Proceedings of the Acm Sigmod International Conference on Management of Data, Part F127746:219–34, 2017. https://doi.org/10.1145/3035918.3064018.
       Full Text
    • Fain, B., A. Goel, K. Munagala, and S. Sakshuwong. “Sequential deliberation for social choice.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10660 LNCS:177–90, 2017. https://doi.org/10.1007/978-3-319-71924-5_13.
       Full Text
    • Fain, B., A. Goel, and K. Munagala. “The core of the participatory budgeting problem.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10123 LNCS:384–99, 2016. https://doi.org/10.1007/978-3-662-54110-4_27.
       Full Text
• Teaching & Mentoring
• 

  Recent Courses

  • COMPSCI 201: Data Structures and Algorithms 2023
  • COMPSCI 330: Introduction to the Design and Analysis of Algorithms 2023
  • COMPSCI 333: Algorithms in the Real World 2023
  • COMPSCI 391: Independent Study 2023
  • COMPSCI 394: Research Independent Study 2023
  • COMPSCI 201: Data Structures and Algorithms 2022
  • COMPSCI 210D: Introduction to Computer Systems 2022
  • COMPSCI 393: Research Independent Study 2022
  • COMPSCI 394: Research Independent Study 2022
  • COMPSCI 201: Data Structures and Algorithms 2021
  • COMPSCI 216: Everything Data 2021
  • COMPSCI 333: Algorithms in the Real World 2021
  • COMPSCI 390: Topics in Computer Science 2021
  • COMPSCI 394: Research Independent Study 2021

Some information on this profile has been compiled automatically from Duke databases and external sources. (Our About page explains how this works.) If you see a problem with the information, please write to Scholars@Duke and let us know. We will reply promptly.