معرفی
Mordecai J Golin is a Professor in the Department of Computer Science and Engineering at The Hong Kong University of Science and Technology (HKUST), School of Engineering. His research lies at the intersection of theoretical computer science, algorithms, and discrete mathematics, with strong applications in information theory and computational geometry.
His research interests include algorithms, computational geometry, data structures, dynamic programming, coding theory, and combinatorics. He has made significant contributions to the design and analysis of optimal search trees, prefix-free coding, and minmax regret optimization in dynamic flow networks. His work often combines probabilistic analysis with algorithmic efficiency.
The recent publications highlight a sustained focus on optimization problems in graphs and trees, particularly in dynamic flow networks for applications like evacuation modeling, and in data compression via advanced Huffman and AIFV coding techniques. The research spans from theoretical foundations to algorithmic innovation, with recurring themes of efficiency, robustness, and structural analysis.
Scientific Awards
- No specific awards mentioned in the provided text.
Advising and Grants: While specific students and grants are not listed, Dr. Golin has an extensive record of collaborative research with colleagues at HKUST and internationally, suggesting active supervision and project leadership. His frequent publications in top-tier venues indicate sustained funding and research activity.
Labs and Teams: Though not explicitly named, his work is likely conducted within theoretical computer science or algorithms research groups at HKUST, possibly associated with centers focusing on discrete mathematics or information sciences.
