Lei Wang

Available identifiers

zbMath Open wang.lei.4MaRDI QIDQ2357381

List of research outcomes

Publication	Date of Publication	Type
A space efficient algorithm for the longest common subsequence in \(k\)-length substrings	2017-06-13	Paper
A note on the largest number of red nodes in red-black trees	2017-05-29	Paper
An algorithmic analysis of a combinatorial game	2016-06-30	Paper
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions	2014-07-25	Paper
Submodularity helps in Nash and nonsymmetric bargaining games	2014-06-19	Paper
An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints	2014-04-28	Paper
A dynamic programming solution to a generalized LCS problem	2014-04-14	Paper
Combinatorial problems with discounted price functions in multi-agent systems	2012-08-29	Paper
Single-parameter combinatorial auctions with partially public valuations	2010-10-19	Paper
Efficiency, Fairness and Competitiveness in Nash Bargaining Games	2009-01-22	Paper

Research outcomes over time

This page was built for person: Lei Wang