Seth Poulsen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Seth Poulsen has a total of 80 co-authors. Here are the top co-authors by number of shared publications:
- Geoffrey L. Herman
University of Illinois Urbana-Champaign, Urbana, IL, USA
11 shared publications - Matthew West
Department of Mechanical Science & Engineering, University of Illinois Urbana-Champaign, Urbana, Illinois, USA
10 shared publications - Yael Gertner
University of Illinois Urbana-Champaign, Urbana, IL, USA
9 shared publications - David H. Smith
Virginia Tech, Blacksburg, VA, USA
6 shared publications - Max Fowler
University of Illinois Urbana-Champaign, Urbana, IL, USA
6 shared publications - Hongxuan Chen
The Chinese University of Hong Kong, Shenzhen, Shenzhen, China
5 shared publications
Latest Publications
- Open Access
- 10 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 407-421
Evaluating LLM-Generated Contextualized Algorithm Design Problems
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.
- 10 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 407-421
Open AccessEvaluating LLM-Generated Contextualized Algorithm Design Problems
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
- 14 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing Education
- Vol. 26 (4) , 1
Corrigendum: Teaching Algorithm Design: A Literature Review
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.
- 14 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computing Education
- Vol. 26 (4) , 1
Open AccessCorrigendum: Teaching Algorithm Design: A Literature Review
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
- 9 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 30-36
Accessible Keyboard Controls for Block Ordering Problems
- 9 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 30-36
Open AccessAccessible Keyboard Controls for Block Ordering Problems
- Top Cited PapersOpen Access
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1207-1214
AI-Supported Grading and Rubric Refinement for Free Response Questions
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1207-1214
Top Cited PapersOpen AccessAI-Supported Grading and Rubric Refinement for Free Response Questions
- Open Access
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 859-865
Enabling Open Educational Resource Adoption through Integrated Sharing in PrairieLearn
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 859-865
Open AccessEnabling Open Educational Resource Adoption through Integrated Sharing in PrairieLearn
- Open Access
- 9 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 76-84
How do Students Select an Algorithm Design Technique?
- 9 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 76-84
Open AccessHow do Students Select an Algorithm Design Technique?
- Open Access
The Effect of Transparency on Students' Perceptions of AI Graders
The development of effective autograders is key for scaling assessment and feedback. While NLP based autograding systems for open-ended response questions have been found to be beneficial for providing immediate feedback, autograders are not always liked, understood, or trusted by students. Our research tested the effect of transparency on students' attitudes towards autograders. Transparent autograders increased students' perceptions of autograder accuracy and willingness to discuss autograders in survey comments, but did not improve other related attitudes -- such as willingness to be graded by them on a test -- relative to the control without transparency. However, this lack of impact may be due to higher measured student trust towards autograders in this study than in prior work in the field. We briefly discuss possible reasons for this trend.
Open AccessThe Effect of Transparency on Students' Perceptions of AI Graders
The development of effective autograders is key for scaling assessment and feedback. While NLP based autograding systems for open-ended response questions have been found to be beneficial for providing immediate feedback, autograders are not always liked, understood, or trusted by students. Our research tested the effect of transparency on students' attitudes towards autograders. Transparent autograders increased students' perceptions of autograder accuracy and willingness to discuss autograders in survey comments, but did not improve other related attitudes -- such as willingness to be graded by them on a test -- relative to the control without transparency. However, this lack of impact may be due to higher measured student trust towards autograders in this study than in prior work in the field. We briefly discuss possible reasons for this trend.
- Open Access
- 4 December 2025
- Published by Taylor & Francis in Computer Science Education
- p. 1-22
Mining hierarchies with conviction: constructing the CS1 skill hierarchy with pairwise comparisons over skill distributions
- 4 December 2025
- Published by Taylor & Francis in Computer Science Education
- p. 1-22
Open AccessMining hierarchies with conviction: constructing the CS1 skill hierarchy with pairwise comparisons over skill distributions
- Open Access
Choose Your Own Solution: Supporting Optional Blocks in Block Ordering Problems
This paper extends the functionality of block ordering problems (such as Parsons problems and Proof Blocks) to include optional blocks. We detail the algorithms used to implement the optional block feature and present usage experiences from instructors who have integrated it into their curriculum. The optional blocks feature enables instructors to create more complex Parsons problems with multiple correct solutions utilizing omitted or optional blocks. This affords students a method to engage with questions that have several valid solutions composed of different answer components. Instructors can specify blocks with multiple mutually exclusive dependencies, which we represent using a multigraph structure. This multigraph is then collapsed into multiple directed acyclic graphs (DAGs), allowing us to reuse existing algorithms for grading block ordering problems represented as a DAG. We present potential use cases for this feature across various domains, including helping students learn Git workflows, shell command sequences, mathematical proofs, and Python programming concepts.
Open AccessChoose Your Own Solution: Supporting Optional Blocks in Block Ordering Problems
This paper extends the functionality of block ordering problems (such as Parsons problems and Proof Blocks) to include optional blocks. We detail the algorithms used to implement the optional block feature and present usage experiences from instructors who have integrated it into their curriculum. The optional blocks feature enables instructors to create more complex Parsons problems with multiple correct solutions utilizing omitted or optional blocks. This affords students a method to engage with questions that have several valid solutions composed of different answer components. Instructors can specify blocks with multiple mutually exclusive dependencies, which we represent using a multigraph structure. This multigraph is then collapsed into multiple directed acyclic graphs (DAGs), allowing us to reuse existing algorithms for grading block ordering problems represented as a DAG. We present potential use cases for this feature across various domains, including helping students learn Git workflows, shell command sequences, mathematical proofs, and Python programming concepts.