Michael Shindler
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Michael Shindler has a total of 62 co-authors. Here are the top co-authors by number of shared publications:
- Matthew Ferland
Dickinson College, Carlisle, PA, USA
4 shared publications - Jeff Erickson
University of Illinois Urbana-Champaign, Urbana, IL, USA
3 shared publications - Ryan Edward Dougherty
United States Military Academy, West Point, NY, USA
3 shared publications - Tim Randolph
Harvey Mudd College, Claremont, CA, USA
3 shared publications - Ana Smaranda Sandu
Wellesley College, Wellesley, MA, USA
2 shared publications - Arushi Arora
University of California, Irvine, Irvine, CA, USA
2 shared publications
Latest Publications
- Open Access
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1615-1616
Pedagogy in Theory of Computing and Algorithms
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1615-1616
Open AccessPedagogy in Theory of Computing and Algorithms
- Open Access
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 568-574
A Replication Study on Student Expectations on CS Tutors: Understanding Roles and Labors of Tutors
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 568-574
Open AccessA Replication Study on Student Expectations on CS Tutors: Understanding Roles and Labors of Tutors
- Open Access
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 582-588
Scaling Engagement: Leveraging Social Annotation and AI for Collaborative Code Review in Large CS Courses
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 582-588
Open AccessScaling Engagement: Leveraging Social Annotation and AI for Collaborative Code Review in Large CS Courses
- Open Access
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1619-1620
It Seemed Like a Good Idea at the Time ('No, Not Like That!' edition)
- 17 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1619-1620
Open AccessIt Seemed Like a Good Idea at the Time ('No, Not Like That!' edition)
- Open Access
- 12 February 2025
- Published by Association for Computing Machinery (ACM)
- p. 325-331
Construction and Preliminary Validation of a Dynamic Programming Concept Inventory
Concept inventories are standardized assessments that evaluate student understanding of key concepts within academic disciplines. While prevalent across STEM fields, their development lags for advanced computer science topics like dynamic programming (DP)---an algorithmic technique that poses significant conceptual challenges for undergraduates. To fill this gap, we developed and validated a Dynamic Programming Concept Inventory (DPCI). We detail the iterative process used to formulate multiple-choice questions targeting known student misconceptions about DP concepts identified through prior research studies. We discuss key decisions, tradeoffs, and challenges faced in crafting probing questions to subtly reveal these conceptual misunderstandings. We conducted a preliminary psychometric validation by administering the DPCI to 172 undergraduate CS students finding our questions to be of appropriate difficulty and effectively discriminating between differing levels of student understanding. Taken together, our validated DPCI will enable instructors to accurately assess student mastery of DP. Moreover, our approach for devising a concept inventory for an advanced theoretical computer science concept can guide future efforts to create assessments for other under-evaluated areas currently lacking coverage.
- 12 February 2025
- Published by Association for Computing Machinery (ACM)
- p. 325-331
Open AccessConstruction and Preliminary Validation of a Dynamic Programming Concept Inventory
Concept inventories are standardized assessments that evaluate student understanding of key concepts within academic disciplines. While prevalent across STEM fields, their development lags for advanced computer science topics like dynamic programming (DP)---an algorithmic technique that poses significant conceptual challenges for undergraduates. To fill this gap, we developed and validated a Dynamic Programming Concept Inventory (DPCI). We detail the iterative process used to formulate multiple-choice questions targeting known student misconceptions about DP concepts identified through prior research studies. We discuss key decisions, tradeoffs, and challenges faced in crafting probing questions to subtly reveal these conceptual misunderstandings. We conducted a preliminary psychometric validation by administering the DPCI to 172 undergraduate CS students finding our questions to be of appropriate difficulty and effectively discriminating between differing levels of student understanding. Taken together, our validated DPCI will enable instructors to accurately assess student mastery of DP. Moreover, our approach for devising a concept inventory for an advanced theoretical computer science concept can guide future efforts to create assessments for other under-evaluated areas currently lacking coverage.
- Open Access
- 12 February 2025
- Published by Association for Computing Machinery (ACM)
- p. 659-665
Investigating the Capabilities of Generative AI in Solving Data Structures, Algorithms, and Computability Problems
There is both great hope and concern about the future of Computer Science practice and education concerning the recent advent of large language models (LLMs). We present the first study to extensively evaluate the ability of such a model to solve problems in Computer Science Theory. Specifically, we tested 165 exam-level problems across 16 specific topics related to computer science theory, ranging from preliminary data structures to algorithm design paradigms to theory of computation (automata and complexity). Our results use the recent popular models (GPT-4 and GPT-4o). This is a rapidly evolving field, with model performance continuously improving. We present our results primarily as an indication of what they can already achieve-equivalently how they can already be useful-today, fully expecting them to improve even further in the near future. Our results show that what was very recently a state-of-the-art model (GPT-4) can solve 77% of free-response problems in data structures and algorithms with little to no guidance. The latest model, GPT-4o, can solve around 46% of the Theory of Computation problems we posed, with predictable categories for which problems it could not solve. When broken down by topic, the model can solve 80% of problems in 4 out of the 15 topics and at least half in 8 other topics. Other problems, namely more visual problems, either require more substantial coaching or seem to still be beyond the capabilities of the language model--for now. By understanding the strengths and limitations of these models for solving theory problems, we can open the door to future work, ranging from human educational assessment on the topic to automated tutors for learners of the subject.
- 12 February 2025
- Published by Association for Computing Machinery (ACM)
- p. 659-665
Open AccessInvestigating the Capabilities of Generative AI in Solving Data Structures, Algorithms, and Computability Problems
There is both great hope and concern about the future of Computer Science practice and education concerning the recent advent of large language models (LLMs). We present the first study to extensively evaluate the ability of such a model to solve problems in Computer Science Theory. Specifically, we tested 165 exam-level problems across 16 specific topics related to computer science theory, ranging from preliminary data structures to algorithm design paradigms to theory of computation (automata and complexity). Our results use the recent popular models (GPT-4 and GPT-4o). This is a rapidly evolving field, with model performance continuously improving. We present our results primarily as an indication of what they can already achieve-equivalently how they can already be useful-today, fully expecting them to improve even further in the near future. Our results show that what was very recently a state-of-the-art model (GPT-4) can solve 77% of free-response problems in data structures and algorithms with little to no guidance. The latest model, GPT-4o, can solve around 46% of the Theory of Computation problems we posed, with predictable categories for which problems it could not solve. When broken down by topic, the model can solve 80% of problems in 4 out of the 15 topics and at least half in 8 other topics. Other problems, namely more visual problems, either require more substantial coaching or seem to still be beyond the capabilities of the language model--for now. By understanding the strengths and limitations of these models for solving theory problems, we can open the door to future work, ranging from human educational assessment on the topic to automated tutors for learners of the subject.
- Open Access
- 5 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-14
A Survey of Undergraduate Theory of Computation Curricula in the United States
- 5 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-14
Open AccessA Survey of Undergraduate Theory of Computation Curricula in the United States
- Open Access
- 5 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 281-282
A Survey of Undergraduate Theory of Computing Curricula
Theory of Computing (ToC) is an important aspect of nearly every undergraduate CS curriculum, as it concerns what computation fundamentally means. However, there has been little research into ToC pedagogy, both within the classroom and how it fits within its institutional context. We propose in this working group to create a survey of current ToC pedagogy. Our goals are to create a standard for teaching ToC, find trends, determine under-researched areas, and to build a community among ToC educators.
- 5 December 2024
- Published by Association for Computing Machinery (ACM)
- p. 281-282
Open AccessA Survey of Undergraduate Theory of Computing Curricula
Theory of Computing (ToC) is an important aspect of nearly every undergraduate CS curriculum, as it concerns what computation fundamentally means. However, there has been little research into ToC pedagogy, both within the classroom and how it fits within its institutional context. We propose in this working group to create a survey of current ToC pedagogy. Our goals are to create a standard for teaching ToC, find trends, determine under-researched areas, and to build a community among ToC educators.
- Open Access
- 2 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 284-290
What is an Algorithms Course?
- 2 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 284-290
Open AccessWhat is an Algorithms Course?
- 19 June 2022
- Published by Taylor & Francis in Computer Science Education
- Vol. 32 (3) , 288-312
Student misconceptions of dynamic programming: a replication study
We replicated and expanded on previous work about how well students learn dynamic programming, a difficult topic for students in algorithms class. Their study interviewed a number of students at on...
- 19 June 2022
- Published by Taylor & Francis in Computer Science Education
- Vol. 32 (3) , 288-312
Student misconceptions of dynamic programming: a replication study
We replicated and expanded on previous work about how well students learn dynamic programming, a difficult topic for students in algorithms class. Their study interviewed a number of students at on...