Neerja Mhaskar, PhD
Post Doctoral Fellow & Sessional Faculty
Department of Computing and Software
1280 Main Street West Hamilton, Ontario L8S4L8 Canada
Email: pophlin AT mcmaster DOT ca
CV (updated on October 1, 2017)
PhD Thesis: A Generalization of Square-free Strings
I am interested in all aspects of Combinatorics on Words, Algorithms on Strings and Complexity. My current
work is primarily on exploring alternate covers for regular and indeterminate finite strings. During my
PhD, I worked on a generalization of square-free strings, the shuffle operation on strings,
and on giving a formalism for finite strings.
I am a post doctoral fellow working with Bill Smyth, and sessional faculty at the Department of Computing and Software, McMaster University. I completed my PhD in August 2016, from McMaster University under the supervision of Professor Michael Soltys.
Before pursuing my doctoral studies I was a Programmer at the DeGroote School of Business at McMaster University.
I have a Master's degree in Engineering Science (with IT as major) from Louisiana State University, and a Bachelor's degree in Mechanical Engineering from Jawaharlal Nehru Technological University Hyderabad, India.
When I am not working I am with my two kids and family.
- Computer Science Practice and Experience: Operating Systems (Comp Sci 3SH3) in Winter 2018.
- Computer Science Practice and Experience: Operating Systems (Comp Sci 3SH3) in Winter 2017.
Refereed Journal Papers:
Refereed Conference Papers:
- Michael Soltys and Neerja Mhaskar, Formal Framework for Stringology, Discrete Applied Mathematics, Submitted March 2017.
- Neerja Mhaskar and Michael Soltys, String Shuffle: Circuits and Graphs, Journal of
Discrete Algorithms, 31:120-128, 2015.
- Neerja Mhaskar and Michael Soltys, Forced Repetitions over Alphabet Lists, Prague
Stringology Conference, PSC 2016.
- Neerja Mhaskar and Michael Soltys, A Formal Framework for Stringology, Prague Stringology
Conference, PSC 2015, to appear in Lecture Notes in Computer Science.
- Neerja Mhaskar and Michael Soltys, Non-repetitive Strings over Alphabet Lists, WALCOM:
Algorithms and Computation, volume 8973 of Lecture Notes in Computer Science,
pages 270-281, February 2015.