Lei Wang

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A space efficient algorithm for the longest common subsequence in \(k\)-length substrings Theoretical Computer Science	2017-06-13	Paper
A note on the largest number of red nodes in red-black trees Journal of Discrete Algorithms	2017-05-29	Paper
An algorithmic analysis of a combinatorial game International Journal of Applied Mathematics and Statistics	2016-06-30	Paper
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions 2009 50th Annual IEEE Symposium on Foundations of Computer Science	2014-07-25	Paper
Submodularity helps in Nash and nonsymmetric bargaining games SIAM Journal on Discrete Mathematics	2014-06-19	Paper
An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints Journal of Discrete Algorithms	2014-04-28	Paper
A dynamic programming solution to a generalized LCS problem Information Processing Letters	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 Algorithmic Game Theory	2010-10-19	Paper
Efficiency, Fairness and Competitiveness in Nash Bargaining Games Lecture Notes in Computer Science	2009-01-22	Paper

Research outcomes over time

This page was built for person: Lei Wang