Shelley Zhang, PhD
Professor
Computer & Information Science
Contact
508-999-8294
508-999-9144
shelley.zhang@umassd.edu
Dion 302C
Education
| 2002 | University of Massachusetts Amherst | PhD in Computer Science |
| 1998 | University of Massachusetts Amherst | MS in Computer Science |
| 1995 | University of Science & Technology of China | B.S. in Computer Science |
Teaching
Programs
Programs
- Computer Science BS, BS/MS
- Computer Science MS
- Computer Science Graduate Certificate
- Computer Science Cybersecurity Concentration
- Data Science BS, BS/MS
- Master's in Data Science MS
- Data Science Graduate Certificate
- Engineering and Applied Science PhD
- Mobile Applications Development
- Software Engineering Option
Teaching
Courses
Comprehensive coverage of all major groups of algorithms, including divide-and-conquer, dynamic programming, greedy, backtracking, branch-and-bound, and parallel algorithms. Discussion of the design and implementation of complex, dynamic data structures. The course also covers an introduction to the functional paradigm.
Comprehensive coverage of all major groups of algorithms, including divide-and-conquer, dynamic programming, greedy, backtracking, branch-and-bound, and parallel algorithms. Discussion of the design and implementation of complex, dynamic data structures. The course also covers an introduction to the functional paradigm.
Comprehensive coverage of all major groups of algorithms, including divide-and-conquer, dynamic programming, greedy, backtracking, branch-and-bound, and parallel algorithms. Discussion of the design and implementation of complex, dynamic data structures. The course also covers an introduction to the functional paradigm.
Comprehensive coverage of all major groups of algorithms, including divide-and-conquer, dynamic programming, greedy, backtracking, branch-and-bound, and parallel algorithms. Discussion of the design and implementation of complex, dynamic data structures. The course also covers an introduction to the functional paradigm.
Comprehensive coverage of all major groups of algorithms, including divide-and-conquer, dynamic programming, greedy, backtracking, branch-and-bound, and parallel algorithms. Discussion of the design and implementation of complex, dynamic data structures. The course also covers an introduction to the functional paradigm.
Comprehensive coverage of all major groups of algorithms, including divide-and-conquer, dynamic programming, greedy, backtracking, branch-and-bound, and parallel algorithms. Discussion of the design and implementation of complex, dynamic data structures. The course also covers an introduction to the functional paradigm.
Comprehensive coverage of all major groups of algorithms, including divide-and-conquer, dynamic programming, greedy, backtracking, branch-and-bound, and parallel algorithms. Discussion of the design and implementation of complex, dynamic data structures. The course also covers an introduction to the functional paradigm.
Research
Research Interests
- Agent control and reasoning under uncertainty
- Artificial intelligence
- Distributed systems
- e-commerce
- Intelligent agent architecture designing