My research interests are in the areas of compilers and algorithms. More specifically, I am interested in applying combinatorial optimization techniques to hard problems in code generation and optimization, especially instruction scheduling and register allocation. I am also interested in exploring compiler optimization techniques for low energy and in developing precise and practically-efficient algorithms for solving NP-hard problems, such as the traveling salesman problem (TSP) and the sequential ordering problem (SOP). I am currently building a research group at CSUS. Information about my research activities before coming to CSUS, may be found on the website of PSUTCompiler, the research group that I formed at PSUT.
