Andrew C. Lee

Andrew C. Lee is an Assistant Teaching Professor in the Department of Computer Science at Syracuse University. He holds a Ph.D. from the University of Maryland, College Park (1998) and multiple advanced degrees from the University of Michigan and the University of Hong Kong. His expertise spans the Theory of Computing, Graphs and Combinatorics, Computer Science Education, and the History of Computing. His research focuses on mathematical analysis of computational resources and strategies, integrating methods from logic, discrete mathematics, and automata theory. He has contributed to formal learning theory, graph algorithms, and educational curriculum development.

Education:

• Ph.D. in Computer Science, University of Maryland, College Park (1998)
• M.A. in Computer Science, University of Maryland, College Park (1996)
• M.A. in Mathematics, University of Michigan, Ann Arbor (1988)
• B.A. in Mathematics, University of Hong Kong (1987)

Research Interests: Dr. Lee investigates computational problem-solving strategies, particularly in machine learning and algorithm design. He applies graph theory and combinatorial methods to formal learning models and explores the interplay between computing history and education to enhance teaching practices for future professionals. Recent work includes applications in game theory, questionnaire design, and data analytics.

Publications: His work spans topics like recursive chromatic numbers, query-based learning models, and graph homeomorphisms. Key themes include algorithmic efficiency, computational logic, and discrete mathematics applications.

Teaching & Advising: Courses taught include Artificial Intelligence, Algorithms, and Automata Theory. No explicit grants or student advisees are listed, but his research engages undergraduates in concrete problem-solving scenarios.

Labs/Teams: Not explicitly mentioned, but his educational focus suggests involvement in curriculum design and undergraduate research initiatives.