Regular biography
Daniel Anderson is an Assistant Teaching Professor in the Computer Science Department at Carnegie Mellon University. His teaching responsibilities include courses such as 15210 - Fall, 2026, 15110 - Summer, 2026, and 15210 - Spring, 2026. He can be contacted via email at danielanderson@cmu.edu or through his website at https://csd.cmu.edu/people/faculty/daniel-anderson. His profile page indicates his affiliation with the Gates and Hillman Centers.
Scholar-generated biography
Daniel Anderson is an Assistant Teaching Professor at Carnegie Mellon University, specializing in Parallel Algorithms, Concurrent Algorithms, and Optimization. His research focuses on developing efficient algorithms for parallel and concurrent computing environments, with an emphasis on shared-memory multicore systems. Anderson's work includes the design of toolkits for parallel algorithms, optimization frameworks, and techniques for managing dynamic data structures. His publications explore topics such as batch-dynamic graph connectivity, work-efficient parallel algorithms, and self-adjusting computation. His contributions aim to improve the performance and scalability of computational systems in both theoretical and applied contexts.