Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Fengming Wang
@article{DBLP:journals/ress/LiWWHY21,
author = {Zan Li and
Fengming Wang and
Chengjie Wang and
Qingpei Hu and
Dan Yu},
title = {Reliability modeling and evaluation of lifetime delayed degradation
process with nondestructive testing},
journal = {Reliab. Eng. Syst. Saf.},
volume = {208},
pages = {107358},
year = {2021},
url = {https://doi.org/10.1016/j.ress.2020.107358},
doi = {10.1016/J.RESS.2020.107358},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ress/LiWWHY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AllenderW16,
author = {Eric Allender and
Fengming Wang},
title = {On the power of algebraic branching programs of width two},
journal = {Comput. Complex.},
volume = {25},
number = {1},
pages = {217--253},
year = {2016},
url = {https://doi.org/10.1007/s00037-015-0114-7},
doi = {10.1007/S00037-015-0114-7},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/AllenderW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LeeLSW16,
author = {Troy Lee and
Nikos Leonardos and
Michael E. Saks and
Fengming Wang},
title = {Hellinger volume and number-on-the-forehead communication complexity},
journal = {J. Comput. Syst. Sci.},
volume = {82},
number = {6},
pages = {1064--1074},
year = {2016},
url = {https://doi.org/10.1016/j.jcss.2016.03.005},
doi = {10.1016/J.JCSS.2016.03.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/LeeLSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icde/CiWGM16,
author = {Xiang Ci and
Fengming Wang and
Yantao Gan and
Xiaofeng Meng},
title = {Efficient skew handling in online aggregation in the cloud},
booktitle = {32nd {IEEE} International Conference on Data Engineering Workshops,
{ICDE} Workshops 2016, Helsinki, Finland, May 16-20, 2016},
pages = {5--11},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/ICDEW.2016.7495608},
doi = {10.1109/ICDEW.2016.7495608},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icde/CiWGM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dasfaa/CiWM15,
author = {Xiang Ci and
Fengming Wang and
Xiaofeng Meng},
editor = {An Liu and
Yoshiharu Ishikawa and
Tieyun Qian and
Sarana Nutanong and
Muhammad Aamir Cheema},
title = {Needle in a Haystack: Max/Min Online Aggregation in the Cloud},
booktitle = {Database Systems for Advanced Applications - {DASFAA} 2015 International
Workshops, SeCoP, BDMS, and Posters, Hanoi, Vietnam, April 20-23,
2015, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9052},
pages = {234--239},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-22324-7\_21},
doi = {10.1007/978-3-319-22324-7\_21},
timestamp = {Tue, 25 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dasfaa/CiWM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LeeLSW14,
author = {Troy Lee and
Nikos Leonardos and
Michael E. Saks and
Fengming Wang},
title = {Hellinger volume and number-on-the-forehead communication complexity},
journal = {CoRR},
volume = {abs/1407.5425},
year = {2014},
url = {http://arxiv.org/abs/1407.5425},
eprinttype = {arXiv},
eprint = {1407.5425},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LeeLSW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/FortnowHPVW11,
author = {Lance Fortnow and
John M. Hitchcock and
Aduri Pavan and
N. V. Vinodchandran and
Fengming Wang},
title = {Extracting Kolmogorov complexity with applications to dimension zero-one
laws},
journal = {Inf. Comput.},
volume = {209},
number = {4},
pages = {627--636},
year = {2011},
url = {https://doi.org/10.1016/j.ic.2010.09.006},
doi = {10.1016/J.IC.2010.09.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/FortnowHPVW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AllenderW11,
author = {Eric Allender and
Fengming Wang},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {On the Power of Algebraic Branching Programs of Width Two},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {736--747},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_62},
doi = {10.1007/978-3-642-22006-7\_62},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AllenderW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/Wang11,
author = {Fengming Wang},
editor = {Mitsunori Ogihara and
Jun Tarui},
title = {{NEXP} Does Not Have Non-uniform Quasipolynomial-Size {ACC} Circuits
of \emph{o}(loglog\emph{n}) Depth},
booktitle = {Theory and Applications of Models of Computation - 8th Annual Conference,
{TAMC} 2011, Tokyo, Japan, May 23-25, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6648},
pages = {164--170},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20877-5\_17},
doi = {10.1007/978-3-642-20877-5\_17},
timestamp = {Sun, 25 Oct 2020 23:06:59 +0100},
biburl = {https://dblp.org/rec/conf/tamc/Wang11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AllenderW11,
author = {Eric Allender and
Fengming Wang},
title = {On the power of algebraic branching programs of width two},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-083}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/083},
eprinttype = {ECCC},
eprint = {TR11-083},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AllenderW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Wang11,
author = {Fengming Wang},
title = {{NEXP} does not have non-uniform quasi-polynomial-size {ACC} circuits
of o(loglog n) depth},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-017}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/017},
eprinttype = {ECCC},
eprint = {TR11-017},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Wang11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AllenderAW10,
author = {Eric Allender and
Vikraman Arvind and
Fengming Wang},
editor = {Maria J. Serna and
Ronen Shaltiel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {Uniform Derandomization from Pathetic Lower Bounds},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 13th International Workshop, {APPROX} 2010, and 14th
International Workshop, {RANDOM} 2010, Barcelona, Spain, September
1-3, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6302},
pages = {380--393},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15369-3\_29},
doi = {10.1007/978-3-642-15369-3\_29},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/AllenderAW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AllenderAW10,
author = {Eric Allender and
Vikraman Arvind and
Fengming Wang},
title = {Uniform Derandomization from Pathetic Lower Bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-069}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/069},
eprinttype = {ECCC},
eprint = {TR10-069},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AllenderAW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PavanW07,
author = {Aduri Pavan and
Fengming Wang},
title = {Robustness of PSPACE-complete sets},
journal = {Inf. Process. Lett.},
volume = {103},
number = {3},
pages = {102--104},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2007.02.018},
doi = {10.1016/J.IPL.2007.02.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PavanW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FortnowHPVW06,
author = {Lance Fortnow and
John M. Hitchcock and
Aduri Pavan and
N. V. Vinodchandran and
Fengming Wang},
editor = {Michele Bugliesi and
Bart Preneel and
Vladimiro Sassone and
Ingo Wegener},
title = {Extracting Kolmogorov Complexity with Applications to Dimension Zero-One
Laws},
booktitle = {Automata, Languages and Programming, 33rd International Colloquium,
{ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {4051},
pages = {335--345},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11786986\_30},
doi = {10.1007/11786986\_30},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FortnowHPVW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-105,
author = {Lance Fortnow and
John M. Hitchcock and
Aduri Pavan and
N. V. Vinodchandran and
Fengming Wang},
title = {Extracting Kolmogorov Complexity with Applications to Dimension Zero-One
Laws},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-105}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-105/index.html},
eprinttype = {ECCC},
eprint = {TR05-105},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-105.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/spic/WangAN90,
author = {Fengming Wang and
Dimitris Anastassiou and
Arun N. Netravali},
title = {Time-recursive deinterlacing for {IDTV} and pyramid coding},
journal = {Signal Process. Image Commun.},
volume = {2},
number = {3},
pages = {365--374},
year = {1990},
url = {https://doi.org/10.1016/0923-5965(90)90012-7},
doi = {10.1016/0923-5965(90)90012-7},
timestamp = {Mon, 24 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/spic/WangAN90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2023-09-27 22:49 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:
