YGYael Gertner

Yael Gertner

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Yael Gertner has a total of 37 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Exploring the Impact of Gender and Affective Factors on Performance in Discrete Mathematics

    by Erica Goodwin, Jonathan Liu, Max Fowler, Juan Alvarez, Jennifer R. Amos, Benjamin Cosman, Yael Gertner, Diana Franklin

  • Open Access

    Evaluating LLM-Generated Contextualized Algorithm Design Problems

    by Erica Goodwin, Katherine Braught, Jonathan Liu, Dip Kiran Pradhan Newar, Yael Gertner, Seth Poulsen, Diana Franklin

    Background: Context personalization, the practice of adapting learning materials to students’ personal interests, has been shown to increase student learning and engagement. Within computer science education, research has found that LLMs can generate high-quality contextualized introductory programming exercises. Objective: In this paper, we evaluate the capability of LLMs to generate technically correct and thematically integrated contextualized algorithm design problems. Methods: In a series of three iterative studies, we use LLMs to generate contextualized algorithm design problems from a given base problem and theme, evaluating over 500 generated problems for technical and thematic alignment. Results: We find that LLM-generated algorithm design problems exhibit significantly more issues than prior work has found for introductory programming problems. We identify issues specific to the algorithm design context and then mitigate these issues with prompt engineering techniques and model choice. With these adjustments, we produce LLM-generated contextualized algorithm design problems that are technically strong, deeply themed, and largely realistic, though realism drops with more culturally and locally specific themes. Implications: We demonstrate a viable workflow for generating contextualized algorithm design problems using LLMs, including prompt design, model selection, and identification of specific issues to review for.

  • Open Access

    Corrigendum: Teaching Algorithm Design: A Literature Review

    by Jonathan Liu, Seth Poulsen, Erica Goodwin, Hongxuan Chen, Grace Williams, Yael Gertner, Diana Franklin

    This is a corrigendum for the article “Teaching Algorithm Design: A Literature Review” published in ACM Trans. Comput. Educ. 25, 2 Article 17 (May 2025), 20 pages.

  • Open Access

    Integrating a CS+Linguistics Project into High School English

    by Salma El Otmani, Isabella Marquez, Katherine Calder, Daphane Hammer, Weronika Trzaska, Kathleen Isenegger, Max Fowler, Raya Hegeman-Davis, Leonard Pitt, Yael Gertner

  • Open Access

    Using Kotter’s Eight-Stage Model to Understand Departmental Efforts to Broaden Participation in Computing

    by Kari L. George, Max Fowler, Vidushi Ojha, Morgan M. Fong, Kathleen Isenegger, Christopher Perdriau, Mariam Saffar Perez, Yael Gertner, Colleen Lewis

    Background : Motivated by the need for a diverse technological workforce, broadening participation in computing (BPC) efforts aim to increase the representation of people who identify as women, African American or Black, Hispanic or Latinx/a/o/e, Native American, Indigenous, persons from economically disadvantaged backgrounds, and persons with disabilities. Research on BPC efforts has highlighted exemplar institutions and activities, but tends to focus on what initiatives computing departments have undertaken and the outcomes of these initiatives. Purpose : Given this prior focus on what initiatives computing departments are undertaking, we propose refocusing on how change happens to increase our collective capacity for impactful change efforts. We apply a well-known organizational change framework, John Kotter’s eight-stage process of leading change, to examine catalysts for change in computing departments, who contributes to this work, and what motivates the work. Doing so can deepen our understanding of BPC efforts and how to enhance them. Theoretical Framework : Kotter’s framework for leading change includes the following eight stages: (1) establishing a sense of urgency, (2) creating the guiding coalition, (3) developing a vision and strategy, (4) communicating the change vision, (5) empowering broad-based action, (6) generating short-term wins, (7) consolidating gains and producing more change, and (8) anchoring new approaches in the culture. Methods : Using a practitioner research approach, we conducted interviews with 13 faculty and staff members across R1 and R2 U.S. institutions via Zoom. Participants were recruited based on their involvement in BPC efforts at their respective institutions. We used inductive and deductive analytic coding approaches to capture how the Kotter framework illuminated participants’ experiences leading BPC efforts. Findings : Kotter’s stages provide a useful breakdown of processes with which to understand and illuminate catalysts for change in computing departments. Across our participants, we see examples of how each stage not only takes shape in different departments, but also how subsequent stages build upon the one(s) before it. Findings reveal a variety of factors that motivate the urgency for computer science (CS) departments to engage in BPC work, along with the importance of top-down leadership and institutional resources. Implications : Kotter’s organizational change model provides an appropriate frame to guide BPC efforts and may be useful to practitioners. Findings from this study illuminate several areas for CS departments to address in order to build capacity for organizational change efforts that support BPC goals. These include examining a variety of departmental data, effectively using meetings and other communications mechanisms, and revising hiring and promotion policies.

  • Top Cited Papers
    Open Access

    AI-Supported Grading and Rubric Refinement for Free Response Questions

    by Chenyan Zhao, Max Fowler, Yael Gertner, Seth Poulsen, Matthew West, Mariana Silva


  • Open Access

    Measuring Students' Perceptions of an Autograded Scaffolding Tool for Students Performing at All Levels in an Algorithms Class

    by Yael Gertner, Brad Solomon, Hongxuan Chen, Eliot Robson, Carl Evans, Jeff Erickson

  • Open Access

    Teaching Algorithm Design: A Literature Review

    by Jonathan Liu, Seth Poulsen, Erica Goodwin, Hongxuan Chen, Grace Williams, Yael Gertner, Diana Franklin

    Algorithm design is a vital skill developed in most undergraduate Computer Science (CS) programs, but few research studies focus on pedagogy related to algorithms coursework. To understand the work that has been done in the area, we present a systematic survey and literature review of CS Education studies. We search for research that is both related to algorithm design (as described by the ACM Curricular Guidelines) and evaluated on post-secondary-level students. Across all venues we searched prior to July 2024, we only find 102 such papers. We first classify these papers by topic, evaluation metric, evaluation methods, and intervention target. Through our classification, we find a broad sparsity of papers which indicates that many open questions remain about teaching algorithm design. We also note the need for papers using rigorous research methods, as only 43 out of 92 papers presenting quantitative data use statistical tests, and only 16 out of 47 papers presenting qualitative data follow a coding scheme. Only 18 papers report controlled trials. In addition, almost all authors only contribute to one publication, an indication that few groups are specializing on these topics. We then synthesize the results of the existing literature to give insights into what the corpus reveals about how we should teach algorithms. Broadly, we find that much of the literature explores implementing well-established practices, such as active learning or automated assessment, in the algorithms classroom. However, there are algorithms-specific results as well: A number of papers find that students may under-utilize certain algorithmic design techniques, and studies describe a variety of ways to select algorithms problems that increase student engagement and learning. The results we present, along with the publicly available set of papers collected, provide a detailed representation of the current corpus of CS Education work related to algorithm design and can orient further research in the area.