Min-Qian Liu

Orcid: 0000-0003-1954-6241

According to our database1, Min-Qian Liu authored at least 21 papers between 2004 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A New Class of Strong Orthogonal Arrays of Strength Three.
J. Syst. Sci. Complex., June, 2024

Construction of Optimal Mixed-Level Uniform Designs.
J. Syst. Sci. Complex., April, 2024

A Rainbow Framework for Coded Caching and Its Applications.
IEEE Trans. Inf. Theory, 2024

2023
Fast Approximation of the Shapley Values Based on Order-of-Addition Experimental Designs.
CoRR, 2023

2022
Optimal designs for order-of-addition experiments.
Comput. Stat. Data Anal., 2022

A generic framework for coded caching and distributed computation schemes.
CoRR, 2022

Network Function Computation With Different Secure Conditions.
CoRR, 2022

2018
On Construction of Optimal Two-Level Designs with Multi Block Variables.
J. Syst. Sci. Complex., 2018

2016
Computer Experiments With Both Qualitative and Quantitative Variables.
Technometrics, 2016

2015
Construction of second-order orthogonal sliced Latin hypercube designs.
J. Complex., 2015

2014
Construction of sliced (nearly) orthogonal Latin hypercube designs.
J. Complex., 2014

Functionally induced priors for componentwise Gibbs sampler in the analysis of supersaturated designs.
Comput. Stat. Data Anal., 2014

2013
On blocked resolution IV designs containing clear two-factor interactions.
J. Complex., 2013

2012
On optimal two-level nonregular factorial split-plot designs.
J. Complex., 2012

Attribute Characteristics of Object (Property) Oriented Concept Lattices.
Proceedings of the Rough Sets and Current Trends in Computing, 2012

2011
Geometric isomorphism check for symmetric factorial designs.
J. Complex., 2011

2009
An algorithmic approach to finding factorial designs with generalized minimum aberration.
J. Complex., 2009

An algorithm for constructing mixed-level k-circulant supersaturated designs.
Comput. Stat. Data Anal., 2009

The Reduction Theory of Object Oriented Concept Lattices and Property Oriented Concept Lattices.
Proceedings of the Rough Sets and Knowledge Technology, 4th International Conference, 2009

2008
An algorithmic approach to constructing mixed-level orthogonal and near-orthogonal arrays.
Comput. Stat. Data Anal., 2008

2004
Combinatorial constructions for optimal supersaturated designs.
Discret. Math., 2004


  Loading...