Edward Talmage

Edward Talmage is interested in theoretical aspects of computer science, particularly with regards to distributed computing. He focuses on distributed data structures, considering abstract implementations, complexity, measures of computational strength, relaxed versions of data structures, and impossibility results. His current work is in defining and understanding how to trade off some precision in distributed data structures against increased performance. In teaching, Edward focuses on making abstract concepts accessible and showing their interest and applicability. He teaches Algorithms and Theory of Computation, as well as introductory programming courses.

Educational Experience

• Ph.D. in Computer Science, Texas A&M University, 2018
• A.B. in Computer Science and Mathematics, Dartmouth College, 2012

Research Interests

• Distributed Computing
• Algorithms and Impossibility Results
• Shared Data Structures