Daniel Anderson
Scholar

Daniel Anderson

Google Scholar ID: xLkb7NAAAAAJ
Assistant Teaching Professor, Carnegie Mellon University
Parallel AlgorithmsConcurrent AlgorithmsOptimization
Citations & Impact
All-time
Citations
730
 
H-index
13
 
i10-index
13
 
Publications
20
 
Co-authors
12
list available
Resume (English only)
Academic Achievements
  • Recipient of the Herbert A. Simon Award for Teaching Excellence in Computer Science in 2024. Also received the Alan J. Perlis Graduate Student Teaching Award in 2022 as a PhD student in SCS.
Research Experience
  • Currently an Assistant Teaching Professor at Carnegie Mellon University, teaching 15-451 Algorithm Design and Analysis. Previously, taught at Monash University, including course design and instruction for Introduction to Modern C++, Algorithms and Data Structures, and Theory of Computation.
Education
  • Information not provided
Background
  • Teaching faculty member in the Computer Science Department at Carnegie Mellon University. Loves teaching, researching, and writing about algorithms. Research interests are broadly in the area of parallel computing, specifically, designing parallel algorithms and implementing libraries that make parallel programming easier for programmers.
Miscellany
  • Enjoys teaching programming, maths, and computer science. Former coach of the Monash University Programming Team and a judge and problem setter for the South Pacific Programming Contests.