default search action
Min-Qian Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j18]Xueru Zhang, Dennis K. J. Lin, Min-Qian Liu, Jianbin Chen:
Analysis of order-of-addition experiments. Comput. Stat. Data Anal. 203: 108077 (2025) - 2024
- [j17]Kashinath Chatterjee, Min-Qian Liu, Hong Qin, Liuqing Yang:
Construction of Optimal Mixed-Level Uniform Designs. J. Syst. Sci. Complex. 37(2): 841-862 (2024) - [j16]Chunyan Wang, Min-Qian Liu, Jinyu Yang:
A New Class of Strong Orthogonal Arrays of Strength Three. J. Syst. Sci. Complex. 37(3): 1233-1250 (2024) - [j15]Min Xu
, Zixiang Xu
A Rainbow Framework for Coded Caching and Its Applications. IEEE Trans. Inf. Theory 70(3): 1738-1752 (2024) - 2023
- [j14]Siyu Yi, Ze Liu, Min-Qian Liu
Global Likelihood Sampler for Multimodal Distributions. J. Comput. Graph. Stat. 32(3): 927-937 (2023) - [i3]Liuqing Yang, Yongdao Zhou, Haoda Fu, Min-Qian Liu, Wei Zheng:
Fast Approximation of the Shapley Values Based on Order-of-Addition Experimental Designs. CoRR abs/2309.08923 (2023) - 2022
- [j13]Yuna Zhao, Dennis K. J. Lin, Min-Qian Liu
Optimal designs for order-of-addition experiments. Comput. Stat. Data Anal. 165: 107320 (2022) - [i2]Min Xu, Gennian Ge, Min-Qian Liu:
Network Function Computation With Different Secure Conditions. CoRR abs/2206.05468 (2022) - [i1]Min Xu, Zixiang Xu, Gennian Ge, Min-Qian Liu:
A generic framework for coded caching and distributed computation schemes. CoRR abs/2209.04647 (2022)
2010 – 2019
- 2018
- [j12]Yuna Zhao, Shengli Zhao, Min-Qian Liu:
On Construction of Optimal Two-Level Designs with Multi Block Variables. J. Syst. Sci. Complex. 31(3): 773-786 (2018) - 2016
- [j11]Hengzhen Huang, Dennis K. J. Lin, Min-Qian Liu, Jian-Feng Yang:
Computer Experiments With Both Qualitative and Quantitative Variables. Technometrics 58(4) (2016) - 2015
- [j10]Rui-Yuan Cao, Min-Qian Liu
Construction of second-order orthogonal sliced Latin hypercube designs. J. Complex. 31(5): 762-772 (2015) - 2014
- [j9]Hengzhen Huang, Jinyu Yang, Min-Qian Liu
Functionally induced priors for componentwise Gibbs sampler in the analysis of supersaturated designs. Comput. Stat. Data Anal. 72: 1-12 (2014) - [j8]Hengzhen Huang, Jian-Feng Yang, Min-Qian Liu
Construction of sliced (nearly) orthogonal Latin hypercube designs. J. Complex. 30(3): 355-365 (2014) - 2013
- [j7]Shengli Zhao, Pengfei Li, Min-Qian Liu
On blocked resolution IV designs containing clear two-factor interactions. J. Complex. 29(5): 389-395 (2013) - 2012
- [j6]Xue-Min Zi, Runchu Zhang, Min-Qian Liu
On optimal two-level nonregular factorial split-plot designs. J. Complex. 28(4): 459-467 (2012) - [c2]Ling Wei, Min-Qian Liu:
Attribute Characteristics of Object (Property) Oriented Concept Lattices. RSCTC 2012: 341-348 - 2011
- [j5]Fang Pang, Min-Qian Liu
Geometric isomorphism check for symmetric factorial designs. J. Complex. 27(5): 441-448 (2011)
2000 – 2009
- 2009
- [j4]Min-Qian Liu
An algorithm for constructing mixed-level k-circulant supersaturated designs. Comput. Stat. Data Anal. 53(7): 2465-2470 (2009) - [j3]Fasheng Sun, Min-Qian Liu
An algorithmic approach to finding factorial designs with generalized minimum aberration. J. Complex. 25(1): 75-84 (2009) - [c1]Min-Qian Liu, Ling Wei, Wei Zhao:
The Reduction Theory of Object Oriented Concept Lattices and Property Oriented Concept Lattices. RSKT 2009: 587-593 - 2008
- [j2]Nam-Ky Nguyen
An algorithmic approach to constructing mixed-level orthogonal and near-orthogonal arrays. Comput. Stat. Data Anal. 52(12): 5269-5276 (2008) - 2004
- [j1]Kai-Tai Fang, Gennian Ge, Min-Qian Liu
Combinatorial constructions for optimal supersaturated designs. Discret. Math. 279(1-3): 191-202 (2004)
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-12-05 21:39 CET 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: