Name: Hang Dinh
Office: NS 336
Phone: 574-520- 4621
Title: Associate Professor of Computer and Information Sciences
2010 Ph.D. in Computer Science & Engineering; University of Connecticut
2002 M.S. in Computer Science; Asian Institute of Technology
2000 B.S. in Computer Science; Vietnam National University, Hanoi
Brief Biography ~
She grew up in a small town in Central Vietnam without electricity or running water. As a child, she was initially interested in becoming a writer but later switched her interest to mathematics thanks to her father’s advice. With her mathematical background, she took a programming class in high school and eventually chose to major in Computer Science. After obtaining her bachelor degree from Vietnam, she went to Thailand to complete her Master’s degree and then to the USA for her Ph.D. In August 2010, she joined Indiana University South Bend as a full-time faculty member and have been calling the Michiana area her new home ever since. She’s married to a German chemist and became a new mom to a little boy in 2015.
Best Paper Award 2015 In the Conference on Computing, Management and Educational Tech (ComManTel 2015)
Taylor L. Booth Memorial Scholarship, University of Connecticut 2008-2009
Doctoral Fellowship, University of Connecticut 2008
Graduate PreDoctoral Fellowship, University of Connecticut 2007
AAAI Student Travel Award 2007 Awarded by the Association for the Advancement of Artificial Intelligence
Vietnamese Government Fellowship 2002 Covered full tuition and stipend for my study at the Asian Institute of Technology
Canadian Government Scholarship 2000 Honorably awarded $500 for being an outstanding Vietnamese woman in Information Technology
Japanese Yamada Scholarship 1997 Honorably awarded $250 for academic excellence
Bronze Medal in the Vietnam National Informatics Olympiad for undergraduate students 1997
Merit-based Full-tuition Scholarship, Vietnam National University, Hanoi 1996-2000
Second Prize in the Mathematics Contest held by the Vietnamese Journal of Youth
and Mathematics 1996
Second Prize in the Vietnam National Mathematics Competition 1993
Research Interests ~
Quantum computing, post-quantum cryptography, computer security, algorithm analysis and design, heuristic search.
Recent Grants ~
Faculty Research Grant, Indiana University South Bend 2013
Awarded $8,500 for the project “Quantum Algorithms for Post-quantum
Faculty Research Grant, Indiana University South Bend 2011
Awarded $8,500 for the project “Empirical Analysis of A* Search for Hard Problems”
Oversea Conference Fund Grant, Indiana University 2011
Awarded $700 to support my traveling to present a paper at the 14th Workshop on
Quantum Information Processing (QIP 2011)
Selected Publications ~
Peer-reviewed Journal Articles
1. Michael R. Scheessele, Hang Dinh, and Mahesh Ananth. On adding a critical thinking
module to a discrete structures course. Journal of Computing Sciences in Colleges,
30(6):97-- 103, June2015.
2. Hang Dinh, Alexander Russell, and Cristopher Moore. Limitations of single coset
states and quantum algorithms for Code Equivalence. Quantum Information &
Computation, 15(3&4):0260-0294, March 2015.
3. Hang Dinh, Hieu Dinh, Laurent Michel, and Alexander Russell. The time complexity
of A* with approximate heuristics on multiple-solution search spaces. Journal of Artificial
Intelligence Research, 45:685-729, December 2012.
4. Hang Dinh and Alexander Russell. Quantum and randomized lower bounds for local
search on vertex-transitive graphs. Quantum Information and Computation, 10(7):0636-
0652, July 2010.
5. Eugene Santos, Jr. and Hang T. Dinh. On automatic knowledge validation for
Bayesian knowledge bases. Data & Knowledge Engineering, 64(1):218-241, January 2008.
Papers in Peer-reviewed Conference Proceedings
1. Duc-Anh Le, Hung Vu, Nghi H Tran, Hang Dinh, and Tutku Karacolak. Capacity-Achieving signals of Noncoherent rayleigh fading channels with additive gaussian mixture noise. In Conference on Computing, Management and Educational Tech (ComManTel 2015), Da Nang, Vietnam, December 2015.
2. Hang Dinh. Inconsistency versus accuracy of heuristics. In Proceedings of the 27th
Canadian Conference on Artificial Intelligence (AI 2014), volume 8436 of Lecture Notes
in Artificial Intelligence, pages 71-82, Montreal, Quebec, Canada, May 2014. Springer.
3. Tuyen X. Tran, Nghi H. Tran, Hamid Reza Bahrami, Hang Dinh, and Shivakumar
Sastry. On achievable rate and ergodic capacity of OAF multiple-relay networks with
CSI. In Proceedings of the IEEE 77th Vehicular Technology Conference (VTC2013-Spring), Dresden, Germany, June 2013.
4. Hang Dinh, Cristopher Moore, and Alexander Russell. McEliece and Niederreiter
cryptosystems that resist quantum Fourier sampling attacks. In Advances in Cryptology
- CRYPTO 2011: 31 st Annual Cryptology Conference, Santa Barbara, CA, USA, August 2011 Proceedings, volume 6841 of Lecture Notes in Computer Science, pages 761-779. Springer, August 2011.
5. Hang Dinh and Alexander Russell. Quantum and randomized lower bounds for local
search on vertex-transitive graphs. In Proceedings of the 12th International Workshop
on Randomization and Computation (RANDOM), Lecture Notes in Computer Science
LNCS 5171, pages 385-401. Springer-Verlag, 2008.
6. Hang Dinh, Alexander Russell, and Yuan Su. On the value of good advice: The
complexity of A* with accurate heuristics. In Proceedings of the Twenty-Second
Conference on Artificial Intelligence (AAAI-07), pages 1140-1145, July 2007.
7. Eugene Santos Jr. and Hang T. Dinh. Consistency of test cases in validation of
Bayesian knowledge-bases. In Proceedings of the 16th IEEE International Conference
on Tools with Artificial Intelligence, ICTAI ‘04, pages 468-475, Washington DC, USA, 2004. IEEE Computer Society.
Additional Information ~
Courses Taught at IU South Bend:
CSCI-A106 Introduction to Computing (Course for non-majors. Lecture and lab.)
CSCI-C101 Computer Programming I (Core course for majors. Lecture and lab.)
CSCI-C201 Computer Programming II (Core course for majors. Lecture.)
CSCI-C251 Foundations of Digital Computing (Core course for majors until Spring
CSCI-C250 Discrete Structures (Core course for majors since Spring 2014. Lecture.)
CSCI-B401 Fundamentals of Computing Theory (Core course for majors since Fall
CSCI-B451 Security in Computing (Elective course for majors. Lecture.)
CSCI-C455 Analysis of Algorithms I (Core course for majors. Lecture)