default search action
Mingyang Gong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]Mingyang Gong
, Zhi-Zhong Chen, Kuniteru Hayashi:
Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time. Algorithmica 86(5): 1400-1427 (2024) - [j9]Mingyang Gong
Approximation Algorithms for Covering Vertices by Long Paths. Algorithmica 86(8): 2625-2651 (2024) - [j8]Mingyang Gong
A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops. Ann. Oper. Res. 335(1): 185-204 (2024) - [i4]Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Lusheng Wang:
Approximately covering vertices by order-5 or longer paths. CoRR abs/2408.11225 (2024) - 2023
- [c7]Mingyang Gong
An Approximation Algorithm for Covering Vertices by 4+-Paths. COCOA (1) 2023: 459-470 - [c6]Yuichi Asahiro, Hiroshi Eto, Mingyang Gong
Approximation Algorithms for the Longest Run Subsequence Problem. CPM 2023: 2:1-2:12 - [i3]Mingyang Gong, Zhi-Zhong Chen, Guohui Lin, Zhaohui Zhan:
An Approximation Algorithm for Covering Vertices by 4^+-Paths. CoRR abs/2304.12779 (2023) - [i2]Mingyang Gong, Zhi-Zhong Chen, Guohui Lin:
Randomized algorithms for fully online multiprocessor scheduling with testing. CoRR abs/2305.01605 (2023) - 2022
- [j7]Mingyang Gong
Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing. J. Comb. Optim. 44(1): 877-893 (2022) - [c5]Mingyang Gong
Approximation Algorithms for Covering Vertices by Long Paths. MFCS 2022: 53:1-53:14 - [i1]Mingyang Gong, Brett Edgar, Jing Fan, Guohui Lin, Eiji Miyano:
Approximation algorithms for covering vertices by long paths. CoRR abs/2208.03294 (2022) - 2021
- [j6]Mingyang Gong, Haichun Zhang, Chao Wang, Qiaoling Tong, Zhenglin Liu:
Corrigendum to "Design and implementation of robust and low-cost SRAM PUF using PMOS and linear shift register extractor" [Microelectron. J. 103C (2020) 104844]. Microelectron. J. 114: 105150 (2021) - [c4]Mingyang Gong
Improved Approximation Algorithms for Multiprocessor Scheduling with Testing. IJTCS-FAW 2021: 65-77 - 2020
- [j5]Mingyang Gong, Haichun Zhang, Chao Wang, Qiaoling Tong, Zhenglin Liu:
Design and implementation of robust and low-cost SRAM PUF using PMOS and linear shift register extractor. Microelectron. J. 103: 104844 (2020) - [j4]Mingyang Gong
An Improved Design and Implementation of a Range-Controlled Communication System for Mobile Phones. Sensors 20(17): 4997 (2020) - [c3]Yuqian Pan, Haichun Zhang, Mingyang Gong, Zhenglin Liu:
Unexpected Error Explosion in NAND Flash Memory: Observations and Prediction Scheme. ATS 2020: 1-6 - [c2]Yuqian Pan, Haichun Zhang, Mingyang Gong, Zhenglin Liu:
Process-variation Effects on 3D TLC Flash Reliability: Characterization and Mitigation Scheme. QRS 2020: 329-334
2010 – 2019
- 2019
- [c1]Zhuo Chen, Yuqian Pan, Mingyang Gong, Haichun Zhang, Mingyu Zhang, Zhenglin Liu:
A NAND Flash Endurance Prediction Scheme with FPGA-based Memory Controller System. SoCC 2019: 68-73 - 2018
- [j3]Mingyang Gong, Hailong Liu, Run Min, Zhenglin Liu:
Pitfall of the Strongest Cells in Static Random Access Memory Physical Unclonable Functions. Sensors 18(6): 1776 (2018) - 2017
- [j2]Yicheng Chen
Low Power Near Field Communication Methods for RFID Applications of SIM Cards. Sensors 17(4): 867 (2017) - [j1]Zhaojun Lu, Dongfang Li, Hailong Liu, Mingyang Gong, Zhenglin Liu:
An Anti-Electromagnetic Attack PUF Based on a Configurable Ring Oscillator for Wireless Sensor Networks. Sensors 17(9): 2118 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: