Fengming Wang

ScholarGPS® ID: 31085106958635

Affiliation

Rutgers, The State University of New Jersey, New Brunswick, Newark and Camden, United States

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Metrics Summary

Publication Count

Predicted Citations

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Hellinger volume and number-on-the-forehead communication complexity (journal article) Lee, Troy \| Leonardos, Nikos \| Saks, Michael \| Wang, Fengming Journal of Computer and System Sciences, volume 82, issue 6, pages 1064-1074 (2016). 10.1016/j.jcss.2016.03.005 Cited by (1) \| Cite \| Source \| Open Access
On the power of algebraic branching programs of width two (journal article) Allender, Eric \| Wang, Fengming computational complexity, volume 25, issue 1, pages 217-253 (2016). 10.1007/s00037-015-0114-7 Cited by (11) \| Cite \| Source \| Open Access
Uniform derandomization from pathetic lower bounds (journal article) Allender, Eric \| Arvind, V. \| Santhanam, Rahul \| Wang, Fengming Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, volume 370, issue 1971, pages 3512-3535 (2012). 10.1098/rsta.2011.0318 Cited by (2) \| Cite \| Source \| Open Access
Extracting Kolmogorov complexity with applications to dimension zero-one laws (journal article) Fortnow, Lance \| Hitchcock, John M. \| Pavan, A. \| Vinodchandran, N.V. \| Wang, Fengming Information and Computation, volume 209, issue 4, pages 627-636 (2011). 10.1016/j.ic.2010.09.006 Cited by (9) \| Cite \| Source \| Open Access
NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth (book chapter) In Theory and Applications of Models of Computation Wang, Fengming Springer Berlin Heidelberg (2011) 10.1007/978-3-642-20877-5_17 Cited by (5) \| Cite \| Source
On the Power of Algebraic Branching Programs of Width Two (book chapter) In Automata, Languages and Programming Allender, Eric \| Wang, Fengming Springer Berlin Heidelberg (2011) 10.1007/978-3-642-22006-7_62 Cited by (4) \| Cite \| Source \| Open Access
Uniform Derandomization from Pathetic Lower Bounds (book chapter) In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Allender, Eric \| Arvind, V. \| Wang, Fengming Springer Berlin Heidelberg (2010) 10.1007/978-3-642-15369-3_29 Cited by (1) \| Cite \| Source \| Open Access
Robustness of PSPACE-complete sets (journal article) Pavan, A. \| Wang, Fengming Information Processing Letters, volume 103, issue 3, pages 102-104 (2007). 10.1016/j.ipl.2007.02.018 Cite \| Source \| Open Access