Lei Wang

Affiliations:
  • Instagram, Menlo Park, CA, USA
  • Facebook Inc., Menlo Park, CA, USA (former)
  • Microsoft AdCenter, Bellevue, WA, USA (former)
  • Georgia Institute of Technology, Atlanta, GA, USA (PhD 2013)


According to our database1, Lei Wang authored at least 26 papers between 2008 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Efficient Computation of Longest Common Subsequences with Multiple Substring Inclusive Constraints.
J. Comput. Biol., 2019

2017
A space efficient algorithm for the longest common subsequence in k-length substrings.
Theor. Comput. Sci., 2017

A note on the largest number of red nodes in red-black trees.
J. Discrete Algorithms, 2017

2016
A simple linear space algorithm for computing a longest common increasing subsequence.
CoRR, 2016

2015
A Practical O(R<i>log log</i> n+n) time Algorithm for Computing the Longest Common Subsequence.
CoRR, 2015

An Efficient Dynamic Programming Algorithm for STR-IC-SEQ-EC-LCS Problem.
CoRR, 2015

An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring inclusive constraints.
CoRR, 2015

An Efficient Dynamic Programming Algorithm for SEQ-IC-SEQ-EC-LCS Problem.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2015

2014
Submodularity Helps in Nash and Nonsymmetric Bargaining Games.
SIAM J. Discret. Math., 2014

An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints.
J. Discrete Algorithms, 2014

2013
A dynamic programming solution to a generalized LCS problem.
Inf. Process. Lett., 2013

An Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains
CoRR, 2013

Complete Solutions for a Combinatorial Puzzle in Linear Time.
CoRR, 2013

Budget smoothing for internet ad auctions: a game theoretic approach.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2011
Some approximation algorithms for multi-agent systems.
PhD thesis, 2011

On the Approximation Ratio of k-Lookahead Auction.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Black-Box Reductions in Mechanism Design.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
Approximability of combinatorial problems with multi-agent submodular cost functions.
SIGecom Exch., 2010

Speeding up the Algorithms for the Subset-Sum Problem with the Bitset Class.
Proceedings of the 2010 International Conference on Software Engineering Research & Practice, 2010

Single-Parameter Combinatorial Auctions with Partially Public Valuations.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

Combinatorial Problems with Discounted Price Functions in Multi-agent Systems.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009
An Optimal Algorithm for Prufer Codes.
J. Softw. Eng. Appl., 2009

Optimal Approximation Algorithms for Multi-agent Combinatorial Problems with Discounted Price Functions
CoRR, 2009

2008
Continuity Properties of Equilibria in Some Fisher and Arrow-Debreu Market Models.
Electron. Colloquium Comput. Complex., 2008

Efficiency, Fairness and Competitiveness in Nash Bargaining Games.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

An Efficient Algorithm for the Longest Pattern Subsequence Problem.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2008


  Loading...