Low Power Near Field Communication Methods for RFID Applications of SIM Cards. - Yicheng Chen 002; Zhaoxia Zheng; Mingyang Gong; Fengqi Yu (Sensors, 2017)

An Anti-Electromagnetic Attack PUF Based on a Configurable Ring Oscillator for Wireless Sensor Networks. - Zhaojun Lu; Dongfang Li; Hailong Liu; Mingyang Gong; Zhenglin Liu (Sensors, 2017)

Pitfall of the Strongest Cells in Static Random Access Memory Physical Unclonable Functions. - Mingyang Gong; Hailong Liu; Run Min; Zhenglin Liu (Sensors, 2018)

A NAND Flash Endurance Prediction Scheme with FPGA-based Memory Controller System. - Zhuo Chen; Yuqian Pan; Mingyang Gong; Haichun Zhang; Mingyu Zhang; Zhenglin Liu (SoCC, 2019)

Unexpected Error Explosion in NAND Flash Memory: Observations and Prediction Scheme. - Yuqian Pan; Haichun Zhang; Mingyang Gong; Zhenglin Liu (ATS, 2020)

Process-variation Effects on 3D TLC Flash Reliability: Characterization and Mitigation Scheme. - Yuqian Pan; Haichun Zhang; Mingyang Gong; Zhenglin Liu (QRS, 2020)

Design and implementation of robust and low-cost SRAM PUF using PMOS and linear shift register extractor. - Mingyang Gong; Haichun Zhang; Chao Wang 096; Qiaoling Tong; Zhenglin Liu (Microelectron. J., 2020)

An Improved Design and Implementation of a Range-Controlled Communication System for Mobile Phones. - Mingyang Gong; Haichun Zhang; Zhenglin Liu (Sensors, 2020)

Improved Approximation Algorithms for Multiprocessor Scheduling with Testing. - Mingyang Gong; Guohui Lin (IJTCS-FAW, 2021)

Corrigendum to "Design and implementation of robust and low-cost SRAM PUF using PMOS and linear shift register extractor" [Microelectron. J. 103C (2020) 104844]. - Mingyang Gong; Haichun Zhang; Chao Wang; Qiaoling Tong; Zhenglin Liu (Microelectron. J., 2021)

Approximation Algorithms for Covering Vertices by Long Paths. - Mingyang Gong; Jing Fan; Guohui Lin; Eiji Miyano (MFCS, 2022)

Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing. - Mingyang Gong; Randy Goebel; Guohui Lin; Eiji Miyano (J. Comb. Optim., 2022)

An Approximation Algorithm for Covering Vertices by 4+-Paths. - Mingyang Gong; Zhi-Zhong Chen; Guohui Lin; Lusheng Wang 001 (COCOA (1), 2023)

Approximation Algorithms for the Longest Run Subsequence Problem. - Yuichi Asahiro; Hiroshi Eto; Mingyang Gong; Jesper Jansson 001; Guohui Lin; Eiji Miyano; Hirotaka Ono 001; Shunichi Tanaka (CPM, 2023)

An Approximation Algorithm for Covering Vertices by 4^+-Paths. - Mingyang Gong; Zhi-Zhong Chen; Guohui Lin; Zhaohui Zhan (CoRR, 2023)

Randomized algorithms for fully online multiprocessor scheduling with testing. - Mingyang Gong; Zhi-Zhong Chen; Guohui Lin (CoRR, 2023)

Semi-online Multiprocessor Scheduling with Known Largest Job Processing Time. - Mingyang Gong; Guohui Lin; Zhiyi Tan 001 (COCOA (1), 2024)

Approximately Covering Vertices by Order-5 or Longer Paths. - Mingyang Gong; Zhi-Zhong Chen; Guohui Lin; Lusheng Wang 001 (COCOON (1), 2024)

Improved Approximation Algorithms for Multiprocessor Indivisible Coflow Scheduling. - Mingyang Gong; Guohui Lin; Bing Su 002 (COCOON (1), 2024)

A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops. - Mingyang Gong; Guohui Lin; Eiji Miyano; Bing Su 002; Weitian Tong (Ann. Oper. Res., 2024)

Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time. - Mingyang Gong; Zhi-Zhong Chen; Kuniteru Hayashi (Algorithmica, 2024)

Approximation Algorithms for Covering Vertices by Long Paths. - Mingyang Gong; Brett Edgar; Jing Fan; Guohui Lin; Eiji Miyano (Algorithmica, 2024)

Covering Vertices by 4+-Paths: A Simpler Local Search Coupled with a More Delicate Amortization. - Mingyang Gong; Guangting Chen; Guohui Lin; Eiji Miyano; Abbinash Ranjitkar (IWOCA, 2025)

Jointly Ensuring Timing Disparity and End-to-End Latency Constraints in Hybrid DAGs. - Jinghao Sun; Xisheng Li; Mingyang Gong; Nan Guan; Zhishan Guo; Mingsong Chen 001; Jun Zhao; Qingxu Deng (RTAS, 2025)

Approximability of Longest Run Subsequence and Complementary Minimization Problems. - Yuichi Asahiro; Mingyang Gong; Jesper Jansson 001; Guohui Lin; Sichen Lu; Eiji Miyano; Hirotaka Ono 001; Toshiki Saitoh; Shunichi Tanaka (WABI, 2025)

Approximation Algorithms for Non-sequential Star Packing Problems. - Mengyuan Hu; An Zhang 001; Yong Chen 002; Mingyang Gong; Guohui Lin (WALCOM, 2025)

Path cover using only short paths. - Mingyang Gong; Guangting Chen; Zhi-Zhong Chen; Guohui Lin; Riki Uchida (Theor. Comput. Sci., 2025)

An improved approximation algorithm for covering vertices by 4+-paths. - Mingyang Gong; Zhi-Zhong Chen; Guohui Lin; Lusheng Wang 001 (J. Comb. Optim., 2025)

An EPTAS for multiprocessor scheduling with rejection under a machine cost constraint. - Mingyang Gong; Brendan Mumey (CoRR, 2025)

Improved approximation algorithms for multiprocessor indivisible coflow scheduling. - Mingyang Gong; Guangting Chen; Guohui Lin; Bing Su 002 (J. Comb. Optim., 2025)

An improved local search based algorithm for k--star partition. - Mingyang Gong; Guohui Lin; Brendan Mumey (CoRR, 2025)

Approximately covering vertices by order-5 or longer paths. - Mingyang Gong; Zhi-Zhong Chen; Guohui Lin; Lusheng Wang (J. Comput. Syst. Sci., 2026)