Jaemin Park

Computer Science and Engineering · Seoul, Korea

• GPA: 3.47 / 4.3; major GPA: 3.77 / 4.3.
• Coursework: object-oriented and functional programming, automata theory, data structures, algorithms, computer architecture, modern algebra, and mathematical analysis.

Suwon, Korea

• GPA: 4.03 / 4.3.

Huawei Technologies, Hong Kong Research Center

Korean IOI Training Camp

• Assisted in teaching algorithms to more than 50 candidates for the Korean IOI delegation.

• Developed algorithms for maintaining order statistics of linear functions using geometric transformations, Modified Quad Tree, and Persistent Angular Sorting.
• Generalized Persistent Angular Sorting to polynomial functions and implemented bucket-based variants.

• Devised a two-player graph game to identify vertices important to graph connectivity.
• Applied reinforcement learning with DQN, DDQN, and D3QN, and evaluated strategies on large graphs.

• Extended Li Chao trees to maintain envelopes of quadratic functions.
• Proved applicability to similar convex figures and implemented bucket-based and divide-and-conquer variants.

• Implemented dynamic convex hulls using splay trees for dynamic programming optimization.
• Developed Quad Li Chao trees and segment trees containing convex hulls.

CircuitSim, a digital logic simulator that builds from gates and arithmetic circuits through memory systems to single-cycle and pipelined RV32I processors.

• Interactive circuit examples and component documentation.
• Timing models and experiments comparing processor implementations.

A beta application for organizing programming contests, tracking problem progress, and recording practice sessions.

• ICPC and Olympiad catalogs, with Codeforces and AtCoder contest imports.
• Shared problem status, dated practice records, and a workflow for curating contest resources.