default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFengming Wang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j6]Zan Li, Fengming Wang, Chengjie Wang, Qingpei Hu
, Dan Yu:
Reliability modeling and evaluation of lifetime delayed degradation process with nondestructive testing. Reliab. Eng. Syst. Saf. 208: 107358 (2021)
2010 – 2019
- 2016
- [j5]Eric Allender, Fengming Wang:
On the power of algebraic branching programs of width two. Comput. Complex. 25(1): 217-253 (2016) - [j4]Troy Lee, Nikos Leonardos, Michael E. Saks, Fengming Wang:
Hellinger volume and number-on-the-forehead communication complexity. J. Comput. Syst. Sci. 82(6): 1064-1074 (2016) - [c6]Xiang Ci, Fengming Wang, Yantao Gan, Xiaofeng Meng:
Efficient skew handling in online aggregation in the cloud. ICDE Workshops 2016: 5-11 - 2015
- [c5]Xiang Ci, Fengming Wang, Xiaofeng Meng:
Needle in a Haystack: Max/Min Online Aggregation in the Cloud. DASFAA Workshops 2015: 234-239 - 2014
- [i5]Troy Lee, Nikos Leonardos, Michael E. Saks, Fengming Wang:
Hellinger volume and number-on-the-forehead communication complexity. CoRR abs/1407.5425 (2014) - 2011
- [j3]Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang:
Extracting Kolmogorov complexity with applications to dimension zero-one laws. Inf. Comput. 209(4): 627-636 (2011) - [c4]Eric Allender, Fengming Wang:
On the Power of Algebraic Branching Programs of Width Two. ICALP (1) 2011: 736-747 - [c3]Fengming Wang:
NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth. TAMC 2011: 164-170 - [i4]Eric Allender, Fengming Wang:
On the power of algebraic branching programs of width two. Electron. Colloquium Comput. Complex. TR11 (2011) - [i3]Fengming Wang:
NEXP does not have non-uniform quasi-polynomial-size ACC circuits of o(loglog n) depth. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [c2]Eric Allender, Vikraman Arvind, Fengming Wang:
Uniform Derandomization from Pathetic Lower Bounds. APPROX-RANDOM 2010: 380-393 - [i2]Eric Allender, Vikraman Arvind, Fengming Wang:
Uniform Derandomization from Pathetic Lower Bounds. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2007
- [j2]Aduri Pavan, Fengming Wang:
Robustness of PSPACE-complete sets. Inf. Process. Lett. 103(3): 102-104 (2007) - 2006
- [c1]Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang:
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. ICALP (1) 2006: 335-345 - 2005
- [i1]Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang:
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws. Electron. Colloquium Comput. Complex. TR05 (2005)
1990 – 1999
- 1990
- [j1]Fengming Wang, Dimitris Anastassiou, Arun N. Netravali:
Time-recursive deinterlacing for IDTV and pyramid coding. Signal Process. Image Commun. 2(3): 365-374 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
