default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJinkun Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]Hongzheng Li, Ruojin Wang, Ge Shi, Xing Lv, Lei Lei, Chong Feng, Fang Liu, Jinkun Lin, Yangguang Mei, Lingnan Xu:
RAAMove: A Corpus for Analyzing Moves in Research Article Abstracts. LREC/COLING 2024: 13503-13513- [i6]Hongzheng Li, Ruojin Wang, Ge Shi, Xing Lv, Lei Lei, Chong Feng, Fang Liu, Jinkun Lin, Yangguang Mei, Lingnan Xu:
RAAMove: A Corpus for Analyzing Moves in Research Article Abstracts. CoRR abs/2403.15872 (2024) - 2023
- [c15]Jiawei Liu
, Jinkun Lin, Fabian Ruffy, Cheng Tan, Jinyang Li, Aurojit Panda, Lingming Zhang:
NNSmith: Generating Diverse and Valid Test Cases for Deep Learning Compilers. ASPLOS (2) 2023: 530-543 - [c14]Qiyuan Zhao, Chuan Luo, Shaowei Cai, Wei Wu, Jinkun Lin, Hongyu Zhang, Chunming Hu:
CAmpactor: A Novel and Effective Local Search Algorithm for Optimizing Pairwise Covering Arrays. ESEC/SIGSOFT FSE 2023: 81-93 - [i5]Peng Lin, Shaowei Cai, Mengchuan Zou, Jinkun Lin:
Local Search for Integer Linear Programming. CoRR abs/2305.00188 (2023) - [i4]Tao Wang, Jinkun Lin, Gianni Antichi, Aurojit Panda, Anirudh Sivaraman:
Application-Defined Receive Side Dispatching on the NIC. CoRR abs/2312.04857 (2023) - 2022
- [c13]Jinkun Lin, Anqi Zhang, Mathias Lécuyer, Jinyang Li, Aurojit Panda, Siddhartha Sen:
Measuring the Effect of Training Data on Deep Learning Predictions via Randomized Experiments. ICML 2022: 13468-13504 - [i3]Jinkun Lin, Anqi Zhang, Mathias Lécuyer, Jinyang Li, Aurojit Panda, Siddhartha Sen:
Measuring the Effect of Training Data on Deep Learning Predictions via Randomized Experiments. CoRR abs/2206.10013 (2022) - [i2]Jiawei Liu, Jinkun Lin, Fabian Ruffy, Cheng Tan, Jinyang Li, Aurojit Panda, Lingming Zhang:
Finding Deep-Learning Compilation Bugs with NNSmith. CoRR abs/2207.13066 (2022) - 2021
- [j5]Shaowei Cai, Jinkun Lin, Yiyuan Wang, Darren Strash:
A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs. J. Artif. Intell. Res. 72: 39-67 (2021) - [c12]Jinkun Lin, Shaowei Cai, Bing He, Yingjie Fu, Chuan Luo, Qingwei Lin:
FastCA: An Effective and Efficient Tool for Combinatorial Covering Array Generation. ICSE (Companion Volume) 2021: 77-80 - [c11]Chuan Luo, Jinkun Lin, Shaowei Cai, Xin Chen, Bing He, Bo Qiao, Pu Zhao, Qingwei Lin, Hongyu Zhang, Wei Wu, Saravanakumar Rajmohan, Dongmei Zhang:
AutoCCAG: An Automated Approach to Constrained Covering Array Generation. ICSE 2021: 201-212 - [c10]Chuan Luo, Binqi Sun, Bo Qiao, Junjie Chen, Hongyu Zhang, Jinkun Lin, Qingwei Lin, Dongmei Zhang:
LS-sampling: an effective local search based sampling approach for achieving high t-wise coverage. ESEC/SIGSOFT FSE 2021: 1081-1092 - 2020
- [j4]Yingjie Fu, Zhendong Lei, Shaowei Cai, Jinkun Lin, Haoran Wang:
WCA: A weighting local search for constrained combinatorial test optimization. Inf. Softw. Technol. 122: 106288 (2020) - [j3]Shuaijun Liu, Jinkun Lin, Lexi Xu, Xianming Gao, Lixiang Liu, Linyan Jiang:
A Dynamic Beam Shut Off Algorithm for LEO Multibeam Satellite Constellation Network. IEEE Wirel. Commun. Lett. 9(10): 1730-1733 (2020) - [c9]Bohan Li, Xindi Zhang, Shaowei Cai, Jinkun Lin, Yiyuan Wang, Christian Blum:
NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set. IJCAI 2020: 1503-1510
2010 – 2019
- 2019
- [c8]Qinyi Luo, Jinkun Lin, Youwei Zhuo, Xuehai Qian:
Hop: Heterogeneity-aware Decentralized Training. ASPLOS 2019: 893-907 - [c7]Jinkun Lin, Shaowei Cai, Chuan Luo, Qingwei Lin, Hongyu Zhang:
Towards more efficient meta-heuristic algorithms for combinatorial test generation. ESEC/SIGSOFT FSE 2019: 212-222 - [i1]Qinyi Luo, Jinkun Lin, Youwei Zhuo, Xuehai Qian:
Hop: Heterogeneity-Aware Decentralized Training. CoRR abs/1902.01064 (2019) - 2018
- [c6]Shaowei Cai, Wenying Hou, Jinkun Lin, Yuanjie Li:
Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies. IJCAI 2018: 1412-1418 - 2017
- [j2]Shaowei Cai, Jinkun Lin, Chuan Luo:
Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search, and Preprocess. J. Artif. Intell. Res. 59: 463-494 (2017) - [c5]Jinkun Lin, Shaowei Cai, Chuan Luo, Kaile Su:
A Reduction based Method for Coloring Very Large Graphs. IJCAI 2017: 517-523 - 2016
- [j1]Shaowei Cai, Chuan Luo, Jinkun Lin, Kaile Su:
New local search methods for partial MaxSAT. Artif. Intell. 240: 1-18 (2016) - [c4]Shaowei Cai, Jinkun Lin:
Fast Solving Maximum Weight Clique Problem in Massive Graphs. IJCAI 2016: 568-574 - 2015
- [c3]Shaowei Cai, Jinkun Lin, Kaile Su:
Two Weighting Local Search for Minimum Vertex Cover. AAAI 2015: 1107-1113 - [c2]Jinkun Lin, Chuan Luo, Shaowei Cai, Kaile Su, Dan Hao, Lu Zhang:
TCA: An Efficient Two-Mode Meta-Heuristic Algorithm for Combinatorial Test Generation (T). ASE 2015: 494-505
1990 – 1999
- 1998
- [c1]Jeffrey Lynn Brandenburg, Boyce Byerly, Tom Dobridge, Jinkun Lin, Dharmaraja Rajan, Timothy Roscoe:
Artefact: A Framework for Low-Overhead Web-Based Collaborative Systems. CSCW 1998: 189-196
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-08-20 22:50 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:
