On the public citation graph
Iteratively Intervening with the “Most Difficult” Topics of an Algorithms and Complexity Course
0 signed · 60 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11685654_15openalex-snapshot
On Teaching the Basics of Complexity Theory
inferredcites →https://doi.org/10.1007/3-540-63165-8_160openalex-snapshot
NP-completeness: A retrospective
inferredcites →https://doi.org/10.1007/bf01273371openalex-snapshot
High school geometry students' justification for their views of empirical evidence and mathematical proof
inferredcites →https://doi.org/10.1016/j.jmathb.2009.04.005openalex-snapshot
Undergraduate mathematics majors’ writing performance producing proofs and counterexamples about continuous functions
inferredcites →https://doi.org/10.1037//0022-0663.86.2.193openalex-snapshot
Role of self-efficacy and self-concept beliefs in mathematical problem solving: A path analysis.
inferredcites →https://doi.org/10.1080/002073900287381openalex-snapshot
The student experience of mathematical proof at university level
inferredcites →https://doi.org/10.1080/00461520.2013.804395openalex-snapshot
Do Learners Really Know Best? Urban Legends in Education
inferredcites →https://doi.org/10.1080/08993400802332548openalex-snapshot
Supporting abstraction processes in problem solving through pattern-oriented instruction
inferredcites →https://doi.org/10.1080/10511970903386915openalex-snapshot
Learning from Their Mistakes: Using Students' Incorrect Proofs as a Pedagogical Tool
inferredcites →https://doi.org/10.1080/14794800903569774openalex-snapshot
Can a proof and a counterexample coexist? Students' conceptions about the relationship between proof and refutation
inferredcites →https://doi.org/10.1108/978-1-60752-750-3openalex-snapshot
Self-Efficacy Beliefs of Adolescents
inferredcites →https://doi.org/10.1108/978-1-60752-837-120251015openalex-snapshot
Toward an Emotion Nuanced Sensemaking Perspective of Organizational Consultation
inferredcites →https://doi.org/10.1109/fie.2008.4720415openalex-snapshot
Teaching abstraction to novices: Pattern-based and ADT-based problem-solving processes
inferredcites →https://doi.org/10.1109/fie.2011.6142846openalex-snapshot
Work in progress — Courses dedicated to the development of logical and algorithmic thinking
inferredcites →https://doi.org/10.1109/fie.2011.6142931openalex-snapshot
Five years with kattis — Using an automated assessment system in teaching
inferredcites →https://doi.org/10.1109/fie.2013.6685158openalex-snapshot
Dynamic programming - Structure, difficulties and teaching
inferredcites →https://doi.org/10.1111/j.1949-8594.2011.00106.xopenalex-snapshot
Possible Student Justification of Proofs
inferredcites →https://doi.org/10.1145/1008902.1008904openalex-snapshot
On teaching theoretical foundations of Computer Science
inferredcites →https://doi.org/10.1145/1089786.1089792openalex-snapshot
Pattern oriented instruction and the enhancement of analogical reasoning
inferredcites →https://doi.org/10.1145/1140124.1140161openalex-snapshot
Reductive thinking in undergraduate CS courses
inferredcites →https://doi.org/10.1145/1268784.1268830openalex-snapshot
Pattern-oriented instruction and its influence on problem decomposition and solution construction
inferredcites →https://doi.org/10.1145/1269900.1268830openalex-snapshot
Pattern-oriented instruction and its influence on problem decomposition and solution construction
inferredcites →https://doi.org/10.1145/1384271.1384288openalex-snapshot
Reductive thinking in a quantitative perspective
inferredcites →https://doi.org/10.1145/1822090.1822175openalex-snapshot
Using AVs to explain NP-completeness
inferredcites →https://doi.org/10.1145/230514.571645openalex-snapshot
Introduction to the Theory of Computation
inferredcites →https://doi.org/10.1145/2499947.2499949openalex-snapshot
Can peer instruction be effective in upper-division computer science courses?
inferredcites →https://doi.org/10.1145/2534860openalex-snapshot
Computer Science Curricula 2013: Curriculum Guidelines for Undergraduate Degree Programs in Computer Science
inferredcites →https://doi.org/10.1145/299649.299718openalex-snapshot
Teaching recursion in a procedural environment—how much should we emphasize the computing model?
inferredcites →https://doi.org/10.1145/800045.801618openalex-snapshot
What do novice programmers know about recursion
inferredcites →https://doi.org/10.1145/989314.989320openalex-snapshot
A framework for teaching recursion
inferredcites →https://doi.org/10.1145/990511.990516openalex-snapshot
On teaching theoretical foundations of computer science
inferredcites →https://doi.org/10.1177/10983007070090020201openalex-snapshot
Meta-Analysis of the Research on Response Cards
inferredcites →https://doi.org/10.1187/cbe.06-12-0205openalex-snapshot
Clickers in the Large Classroom: Current Research and Best-Practice Tips
inferredcites →https://doi.org/10.2190/c670-y3c8-ltj1-ct3popenalex-snapshot
Development and Validation of Scores on a Computer Programming Self-Efficacy Scale and Group Analyses of Novice Programmer Self-Efficacy
inferredcites →https://doi.org/10.3847/aer2006005openalex-snapshot
Clickers: A New Teaching Aid with Exceptional Promise
inferredcites →https://doi.org/10.3929/ethz-a-005128663openalex-snapshot
GraphBench: Exploring the Limits of Complexity with Educational Software: Exploring the limits of complexity with educational software
inferredcites →https://doi.org/10.5555/1127442.1127450openalex-snapshot
NP-completeness for all computer science undergraduates
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10639-021-10532-0openalex-snapshot
Can we do better? a classification of algorithm run-time-complexity improvement using the SOLO taxonomy
inferred← citeshttps://doi.org/10.1007/s11042-022-13679-1openalex-snapshot
Augmented reality with algorithm animation and their effect on students’ emotions
inferred← citeshttps://doi.org/10.1080/08993408.2022.2079865openalex-snapshot
Student misconceptions of dynamic programming: a replication study
inferred← citeshttps://doi.org/10.1080/08993408.2026.2633989openalex-snapshot
Data structures and algorithms misconceptions in concept inventories: a systematic literature review
inferred← citeshttps://doi.org/10.1145/3159450.3159528openalex-snapshot
Student Misconceptions of Dynamic Programming
inferred← citeshttps://doi.org/10.1145/3230977.3230980openalex-snapshot
Self-Efficacy, Cognitive Load, and Emotional Reactions in Collaborative Algorithms Labs - A Case Study
inferred← citeshttps://doi.org/10.1145/3304221.3319749openalex-snapshot
Students' Misconceptions of Optimization Algorithms
inferred← citeshttps://doi.org/10.1145/3632620.3671115openalex-snapshot
Regulation, Self-Efficacy, and Participation in CS1 Group Work
inferred← citeshttps://doi.org/10.1145/3641554.3701918openalex-snapshot
Construction and Preliminary Validation of a Dynamic Programming Concept Inventory
inferred← citeshttps://doi.org/10.1145/3641554.3701937openalex-snapshot
Reflections on Teaching Algorithm Courses
inferred← citeshttps://doi.org/10.1145/3641554.3701946openalex-snapshot
Investigating the Capabilities of Generative AI in Solving Data Structures, Algorithms, and Computability Problems
inferred← citeshttps://doi.org/10.1145/3641554.3701967openalex-snapshot
Tool-Assisted Learning of Computational Reductions
inferred← citeshttps://doi.org/10.1145/3727987openalex-snapshot
Teaching Algorithm Design: A Literature Review
inferred← citeshttps://doi.org/10.1145/3765964.3811658openalex-snapshot
Evaluating LLM-Generated Contextualized Algorithm Design Problems
inferred← citeshttps://doi.org/10.1145/3770762.3772624openalex-snapshot
Analogical Reasoning in Undergraduate Algorithms
inferred← citeshttps://doi.org/10.18260/1-2--42347openalex-snapshot
Auto-graded Scaffolding Exercises For Theoretical Computer Science
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.