Jinkun Lin

Orcid: 0000-0003-3653-3514

According to our database1, Jinkun Lin authored at least 24 papers between 1998 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
RAAMove: A Corpus for Analyzing Moves in Research Article Abstracts.
CoRR, 2024

2023
Application-Defined Receive Side Dispatching on the NIC.
CoRR, 2023

Local Search for Integer Linear Programming.
CoRR, 2023

CAmpactor: A Novel and Effective Local Search Algorithm for Optimizing Pairwise Covering Arrays.
Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2023

NNSmith: Generating Diverse and Valid Test Cases for Deep Learning Compilers.
Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, 2023

2022
Finding Deep-Learning Compilation Bugs with NNSmith.
CoRR, 2022

Measuring the Effect of Training Data on Deep Learning Predictions via Randomized Experiments.
Proceedings of the International Conference on Machine Learning, 2022

2021
A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs.
J. Artif. Intell. Res., 2021

LS-sampling: an effective local search based sampling approach for achieving high t-wise coverage.
Proceedings of the ESEC/FSE '21: 29th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2021

AutoCCAG: An Automated Approach to Constrained Covering Array Generation.
Proceedings of the 43rd IEEE/ACM International Conference on Software Engineering, 2021

FastCA: An Effective and Efficient Tool for Combinatorial Covering Array Generation.
Proceedings of the 43rd IEEE/ACM International Conference on Software Engineering: Companion Proceedings, 2021

2020
A Dynamic Beam Shut Off Algorithm for LEO Multibeam Satellite Constellation Network.
IEEE Wirel. Commun. Lett., 2020

WCA: A weighting local search for constrained combinatorial test optimization.
Inf. Softw. Technol., 2020

NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
Towards more efficient meta-heuristic algorithms for combinatorial test generation.
Proceedings of the ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2019

Hop: Heterogeneity-aware Decentralized Training.
Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, 2019

2018
Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search, and Preprocess.
J. Artif. Intell. Res., 2017

A Reduction based Method for Coloring Very Large Graphs.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
New local search methods for partial MaxSAT.
Artif. Intell., 2016

Fast Solving Maximum Weight Clique Problem in Massive Graphs.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
TCA: An Efficient Two-Mode Meta-Heuristic Algorithm for Combinatorial Test Generation (T).
Proceedings of the 30th IEEE/ACM International Conference on Automated Software Engineering, 2015

Two Weighting Local Search for Minimum Vertex Cover.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

1998
Artefact: A Framework for Low-Overhead Web-Based Collaborative Systems.
Proceedings of the CSCW '98, 1998


  Loading...