Wen An Liu

VLDB 2026 Research / reviewers in the wild / expert

dblp:14/3140 · DBLP profile ↗

← Back

21ranked-venue papers

15as first author

1since 2021 · last 2022

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 21 · 15 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author

Year	Publication	Venue	Position
2022	Adjoining to (K, s, t)-Wythoff's game its P-generators as moves Wen An Liu	Discret. Appl. Math.	2
2019	One-Pile Nim games with arbitrarily many random players Wen An Liu, Jing Wang 0046, Jia Wei Duan	Discret. Appl. Math.	1
2019	Multi-player End-Nim games Wen An Liu	Theor. Comput. Sci.	1
2018	Multi-player Small Nim with Passes Wen An Liu, Jing Jing Zhou	Discret. Appl. Math.	1
2017	Variants of (d, t)-Wythoff's game Aviezri S. Fraenkel, Wen An Liu	Discret. Appl. Math.	4
2017	Misère Nim with multi-player Wen An Liu, Jia Wei Duan	Discret. Appl. Math.	1
2017	Multi-player Wythoff's game and its variants Wen An Liu, Ming Yue Wang	Discret. Appl. Math.	1
2017	Multi-player subtraction games Wen An Liu, Ming Yue Wang	Theor. Comput. Sci.	1
2016	Nim with one or two dynamic restrictions Wen An Liu	Discret. Appl. Math.	1
2016	Rényi-Berlekamp-Ulam searching game with bi-interval queries and two lies Shu Min Xing, Wen An Liu, Kun Meng	Discret. Appl. Math.	2
2016	One pile misère bounded Nim with two alliances abstract The game of n -person one-pile bounded Nim with two alliances is investigated: Given an integer m ≥ 1 and a pile of counters, each player is allowed to remove ℓ counters from the pile, where ℓ ∈ { 1 , 2 , … , m } . Suppose that n ≥ 2 players form two alliances and that each player is in exactly one alliance. Also assume that each player will support his alliance’s interests. Under misère play convention, all unsafe positions of two alliances are determined for some structures of two alliances. We also point out that some conclusions given by A.R. Kelly are not correct. Moreover, we present a possible explanation for Kelly’s inaccurate conclusions. Wen An Liu	Discret. Appl. Math.	2
2015	General restrictions of Wythoff-like games Wen An Liu, Meile Zhao	Theor. Comput. Sci.	1
2014	Adjoining to (s, t)-Wythoff's game its P-positions as moves Wen An Liu	Discret. Appl. Math.	1
2012	Minimum average-case queries of q+1-ary search game with small sets Kun Meng, Chuang Lin 0002, Wen An Liu, Yang Yang 0004, Gyula O. H. Katona	Discret. Appl. Math.	3
2011	Q-ary Rényi-Ulam pathological liar game with one lie Kun Meng, Chuang Lin 0002, Wen An Liu, Yang Yang 0004	Discret. Appl. Math.	3
2007	Q-ary search with one lie and bi-interval queries Wen An Liu, Kun Meng, Shu Min Xing	Inf. Process. Lett.	1
2006	Searching for a counterfeit coin with b-balance Wen An Liu, Huan Huan Cui, Bing Qing Ma	Discret. Appl. Math.	1
2006	Minimal average cost of searching for a counterfeit coin: Restricted model Wen An Liu, Hong Yong Ma	Discret. Appl. Math.	1
2005	Searching for two counterfeit coins with two-arms balance Wen An Liu, Zan Kan Nie	Discret. Appl. Math.	1
2005	Searching for a counterfeit coin with two unreliable weighings Wen An Liu, Qimin Zhang, Zan Kan Nie	Discret. Appl. Math.	1
2004	Optimal detection of two counterfeit coins with two-arms balance Wen An Liu, Zan Kan Nie	Discret. Appl. Math.	1