| 2013 | ||
|---|---|---|
| j39 | Zhixiang Chen, Bin Fu: Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials. J. Comb. Optim. 25(2): 234-254 (2013) | |
| j38 | Bin Fu, Lusheng Wang: Constant time approximation scheme for largest well predicted subset. J. Comb. Optim. 25(3): 352-367 (2013) | |
| c83 | ||
| c82 | Bin Fu, Wenfeng Li, Zhiyong Peng: Sublinear Time Approximate Sum via Uniform Random Sampling. COCOON 2013: 713-720 | |
| 2012 | ||
| j37 | Bin Fu, Wenxin Li, Minghui Wu, Rongfeng Li, Zhuoqun Xu: A Document Rectification Approach Dealing with both Perspective Distortion and Warping Based on Text Flow Curve Fitting. Int. J. Image Graphics 12(1) (2012) | |
| j36 | Zaixin Lu, Wei Zhang, Weili Wu, Joonmo Kim, Bin Fu: The complexity of influence maximization problem in the deterministic linear threshold model. J. Comb. Optim. 24(3): 374-378 (2012) | |
| j35 | Bin Fu, Yumei Huo, Hairong Zhao: Coordinated scheduling of production and delivery with production window and delivery capacity constraints. Theor. Comput. Sci. 422: 39-51 (2012) | |
| j34 | ||
| c81 | Richard Beigel, Bin Fu: A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing. FAW-AAIM 2012: 172-181 | |
| c80 | Bin Fu: Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP. FAW-AAIM 2012: 182-191 | |
| c79 | Zhixiang Chen, Bin Fu, Binhai Zhu: Erratum: The Approximability of the Exemplar Breakpoint Distance Problem. FAW-AAIM 2012: 368 | |
| c78 | Bin Fu, Eugene Fink, Garth A. Gibson, Jaime G. Carbonell: Fast Approximate Matching of Astronomical Objects. CLUSTER Workshops 2012: 1-6 | |
| c77 | Bin Fu, Matthew J. Patitz, Robert T. Schweller, Robert Sheline: Self-assembly with Geometric Tiles. ICALP (1) 2012: 714-725 | |
| c76 | Zaixin Lu, Yan Shi, Weili Wu, Bin Fu: Efficient data retrieval scheduling for multi-channel wireless data broadcast. INFOCOM 2012: 891-899 | |
| c75 | Bin Fu, Zhihai Wang, Rong Pan, Guandong Xu, Peter Dolog: An Integrated Pruning Criterion for Ensemble Learning Based on Classification Accuracy and Diversity. KMO 2012: 47-58 | |
| c74 | ||
| c73 | Bin Fu, Zhihai Wang, Rong Pan, Guandong Xu, Peter Dolog: Learning Tree Structure of Label Dependency for Multi-label Learning. PAKDD (1) 2012: 159-170 | |
| i19 | Bin Fu, Wenfeng Li, Zhiyong Peng: Sublinear Time Approximate Sum via Uniform Random Sampling. CoRR abs/1202.6598 (2012) | |
| 2011 | ||
| j33 | Bin Fu, Yumei Huo, Hairong Zhao: Approximation schemes for parallel machine scheduling with availability constraints. Discrete Applied Mathematics 159(15): 1555-1565 (2011) | |
| j32 | Bin Fu, Angsheng Li, Liyu Zhang: Separating NE from some nonuniform nondeterministic complexity classes. J. Comb. Optim. 22(3): 482-493 (2011) | |
| j31 | Bin Fu: Theory and application of width bounded geometric separators. J. Comput. Syst. Sci. 77(2): 379-392 (2011) | |
| j30 | Bin Fu, Ming-Yang Kao, Lusheng Wang: Discovering almost any hidden motif from multiple sequences. ACM Transactions on Algorithms 7(2): 26 (2011) | |
| j29 | Li Chen, Bin Fu: Linear and sublinear time algorithms for the basis of abelian groups. Theor. Comput. Sci. 412(32): 4110-4122 (2011) | |
| c72 | Zhixiang Chen, Bin Fu: The Complexity of Testing Monomials in Multivariate Polynomials. COCOA 2011: 1-15 | |
| c71 | Zhixiang Chen, Bin Fu, Yang Liu, Robert T. Schweller: Algorithms for Testing Monomials in Multivariate Polynomials. COCOA 2011: 16-30 | |
| c70 | Xiaofeng Gao, Zaixin Lu, Weili Wu, Bin Fu: Algebraic Algorithm for Scheduling Data Retrieval in Multi-channel Wireless Data Broadcast Environments. COCOA 2011: 74-81 | |
| c69 | Liang Ding, Bin Fu, Binhai Zhu: Minimum Interval Cover and Its Application to Genome Sequencing. COCOA 2011: 287-298 | |
| c68 | Bin Fu, Haitao Jiang, Boting Yang, Binhai Zhu: Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem. COCOA 2011: 299-310 | |
| c67 | Zaixin Lu, Wei Zhang, Weili Wu, Bin Fu, Ding-Zhu Du: Approximation and Inapproximation for the Influence Maximization Problem in Social Networks under Deterministic Linear Threshold Model. ICDCS Workshops 2011: 160-165 | |
| c66 | Bin Fu, Louxin Zhang: A Polynomial Algebra Method for Computing Exemplar Breakpoint Distance. ISBRA 2011: 297-305 | |
| c65 | Julio López, Colin Degraf, Tiziana DiMatteo, Bin Fu, Eugene Fink, Garth A. Gibson: Recipes for Baking Black Forest Databases - Building and Querying Black Hole Merger Trees from Cosmological Simulations. SSDBM 2011: 546-554 | |
| c64 | Chuanhe Huang, Jia Ye, Bin Fu: Two Sides Approximation Algorithms for Channel Assignments in Wireless Network. WASA 2011: 36-47 | |
| e1 | Bin Fu, Ding-Zhu Du (Eds.): Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings. Lecture Notes in Computer Science 6842, Springer 2011, isbn 978-3-642-22684-7 | |
| i18 | Bin Fu, Matthew J. Patitz, Robert T. Schweller, Bobby Sheline: Self-Assembly with Geometric Tiles. CoRR abs/1104.2809 (2011) | |
| i17 | ||
| i16 | Richard Beigel, Bin Fu: A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing. Electronic Colloquium on Computational Complexity (ECCC) 18: 28 (2011) | |
| 2010 | ||
| j28 | Zaixin Lu, Zhiyu Zhao, Bin Fu: Efficient protein alignment algorithm for protein search. BMC Bioinformatics 11(S-1): 34 (2010) | |
| j27 | Lei Li, Bin Fu, Christos Faloutsos: Efficient Parallel Learning of Hidden Markov Chain Models on SMPs. IEICE Transactions 93-D(6): 1330-1342 (2010) | |
| j26 | Zhixiang Chen, Bin Fu, John Abraham: A quadratic lower bound for Rocchio's similarity-based relevance feedback algorithm with a fixed query updating factor. J. Comb. Optim. 19(2): 134-157 (2010) | |
| c63 | Zhi-Zhong Chen, Michael R. Fellows, Bin Fu, Haitao Jiang, Yang Liu, Lusheng Wang, Binhai Zhu: A Linear Kernel for Co-Path/Cycle Packing. AAIM 2010: 90-102 | |
| c62 | Bin Fu, Yumei Huo, Hairong Zhao: Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints. AAIM 2010: 141-149 | |
| c61 | Artem Chebotko, Bin Fu: XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme. COCOA (2) 2010: 97-106 | |
| c60 | Zhixiang Chen, Bin Fu: Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials. COCOA (1) 2010: 309-323 | |
| c59 | Bin Fu, Lusheng Wang: Constant Time Approximation Scheme for Largest Well Predicted Subset. COCOON 2010: 429-438 | |
| c58 | Bin Fu, Yumei Huo, Hairong Zhao: Approximation Schemes for Scheduling with Availability Constraints. FAW 2010: 77-88 | |
| c57 | Liang Ding, Bin Fu, Yunhui Fu: Improved Sublinear Time Algorithm for Width-Bounded Separators. FAW 2010: 101-112 | |
| c56 | Liang Ding, Bin Fu, Yunhui Fu, Zaixin Lu, Zhiyu Zhao: O((logn)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems. FAW 2010: 250-261 | |
| c55 | Bin Fu, Kai Ren, Julio López, Eugene Fink, Garth A. Gibson: DiscFinder: a data-intensive scalable cluster finder for astrophysics. HPDC 2010: 348-351 | |
| c54 | Zhongfeng Wang, Zhihai Wang, Bin Fu: Learning Robust Bayesian Network Classifiers in the Space of Markov Equivalent Classes. ICDM Workshops 2010: 891-898 | |
| c53 | Zhongfeng Wang, Zhihai Wang, Bin Fu: Learning Restricted Bayesian Network Classifiers with Mixed Non-i.i.d. Sampling. ICDM Workshops 2010: 899-904 | |
| i15 | Richard Beigel, Bin Fu: A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing. CoRR abs/1007.1260 (2010) | |
| i14 | Bin Fu, Yunhui Fu: Sublinear Time Motif Discovery from Multiple Sequences. CoRR abs/1007.2618 (2010) | |
| i13 | Artem Chebotko, Bin Fu: XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme. CoRR abs/1007.2671 (2010) | |
| i12 | Zhixiang Chen, Bin Fu: The Complexity of Testing Monomials in Multivariate Polynomials. CoRR abs/1007.2673 (2010) | |
| i11 | Zhixiang Chen, Bin Fu, Yang Liu, Robert T. Schweller: Algorithms for Testing Monomials in Multivariate Polynomials. CoRR abs/1007.2675 (2010) | |
| i10 | Zhixiang Chen, Bin Fu: Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials. CoRR abs/1007.2678 (2010) | |
| i9 | Bin Fu: Multivariate Polynomial Integration and Derivative Are Polynomial Time Inapproximable unless P=NP. CoRR abs/1012.2377 (2010) | |
| i8 | ||
| i7 | Zhixiang Chen, Bin Fu: The Complexity of Testing Monomials in Multivariate Polynomials. Electronic Colloquium on Computational Complexity (ECCC) 17: 114 (2010) | |
| i6 | Zhixiang Chen, Bin Fu, Yang Liu, Robert T. Schweller: Algorithms for Testing Monomials in Multivariate Polynomials. Electronic Colloquium on Computational Complexity (ECCC) 17: 122 (2010) | |
| i5 | Zhixiang Chen, Bin Fu: Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials. Electronic Colloquium on Computational Complexity (ECCC) 17: 124 (2010) | |
| i4 | Bin Fu: NE is not NP Turing Reducible to Nonexpoentially Dense NP Sets. Electronic Colloquium on Computational Complexity (ECCC) 17: 196 (2010) | |
| i3 | Bin Fu: Multivariate Polynomial Integration and Derivative Are Polynomial Time Inapproximable unless P=NP. Electronic Colloquium on Computational Complexity (ECCC) 17: 202 (2010) | |
| 2009 | ||
| j25 | Bin Fu, Yumei Huo, Hairong Zhao: Makespan Minimization with Machine Availability Constraints. Discrete Math., Alg. and Appl. 1(2): 141-152 (2009) | |
| j24 | Zaixin Lu, Zhiyu Zhao, Sergio Garcia, Krishnakumar Krishnaswamy, Bin Fu: Search Similar protein Structures with Classification, Sequence and 3D alignments. J. Bioinformatics and Computational Biology 7(5): 755-771 (2009) | |
| j23 | Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu: On recovering syntenic blocks from comparative maps. J. Comb. Optim. 18(3): 307-318 (2009) | |
| j22 | Bin Fu, Zhiyu Zhao: Separating sublinear time computations by approximate diameter. J. Comb. Optim. 18(4): 393-416 (2009) | |
| j21 | Bin Fu, Ming-Yang Kao, Lusheng Wang: Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences. SIAM J. Discrete Math. 23(4): 1715-1737 (2009) | |
| j20 | Bin Fu, Yumei Huo, Hairong Zhao: Exponential inapproximability and FPTAS for scheduling with availability constraints. Theor. Comput. Sci. 410(27-29): 2663-2674 (2009) | |
| c52 | John Abraham, Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Zhu: On the Approximability of Some Haplotyping Problems. AAIM 2009: 3-14 | |
| c51 | Bin Fu, Yumei Huo, Hairong Zhao: Makespan Minimization with Machine Availability Constraints. COCOA 2009: 430-437 | |
| c50 | Bin Fu, Angsheng Li, Liyu Zhang: Separating NE from Some Nonuniform Nondeterministic Complexity Classes. COCOON 2009: 486-495 | |
| c49 | Li Chen, Bin Fu: Linear and Sublinear Time Algorithms for Basis of Abelian Groups. ISAAC 2009: 493-502 | |
| c48 | Anatole Gershman, Eugene Fink, Bin Fu, Jaime G. Carbonell: Analysis of uncertain data: Selection of probes for information gathering. SMC 2009: 2227-2232 | |
| c47 | Anatole Gershman, Eugene Fink, Bin Fu, Jaime G. Carbonell: Analysis of uncertain data: Evaluation of given hypotheses. SMC 2009: 2556-2561 | |
| c46 | Bin Fu, Ming-Yang Kao, Lusheng Wang: Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability. TAMC 2009: 231-240 | |
| 2008 | ||
| j19 | Bin Fu, Sorinel Adrian Oprisan, Lizhe Xu: Multi-Directional Width-Bounded Geometric Separator and protein Folding. Int. J. Comput. Geometry Appl. 18(5): 389-413 (2008) | |
| j18 | Zhiyu Zhao, Bin Fu, Francisco J. Alanis, Christopher M. Summa: Feedback Algorithm and Web-Server for Protein Structure Alignment. Journal of Computational Biology 15(5): 505-524 (2008) | |
| j17 | Zhixiang Chen, Bin Fu, Robert T. Schweller, Boting Yang, Zhiyu Zhao, Binhai Zhu: Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments. Journal of Computational Biology 15(5): 535-546 (2008) | |
| j16 | Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Zhu: On the inapproximability of the exemplar conserved interval distance problem of genomes. J. Comb. Optim. 15(2): 201-221 (2008) | |
| j15 | Bin Fu, Zhixiang Chen: Sublinear time width-bounded separators and their application to the protein side-chain packing problem. J. Comb. Optim. 15(4): 387-407 (2008) | |
| c45 | Zhixiang Chen, Bin Fu, Robert T. Schweller, Boting Yang, Zhiyu Zhao, Binhai Zhu: Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments. APBC 2008: 333-342 | |
| c44 | Zaixin Lu, Zhiyu Zhao, Sergio Garcia, Bin Fu: New Algorithm and Web Server for Finding Proteins with Similar 3D Structures. BIOCOMP 2008: 674-680 | |
| c43 | Bin Fu, Zhiyu Zhao: Separating Sublinear Time Computations by Approximate Diameter. COCOA 2008: 79-88 | |
| c42 | Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu: On Recovering Syntenic Blocks from Comparative Maps. COCOA 2008: 319-327 | |
| c41 | Bin Fu, Zhixiang Chen: A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model. COCOON 2008: 82-91 | |
| c40 | Kaiguo Fan, Weigen Huang, Mingxia He, Bin Fu, Xilin Gan: Simulation Study on the Effect of Wind Direction on SAR Imaging Shallow Water Bathymetry. IGARSS (1) 2008: 409-412 | |
| c39 | Kaiguo Fan, Weigen Huang, Bin Fu, Mingxia He: Simulation Study on the Optimal Conditions for Shallow Water Bathymetry Observation by SAR. IGARSS (1) 2008: 454-457 | |
| c38 | Bin Fu, Eugene Fink, Jaime G. Carbonell: Analysis of uncertain data: Tools for representation and processing. SMC 2008: 3256-3260 | |
| c37 | Bin Fu, Ming-Yang Kao, Lusheng Wang: Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences. TAMC 2008: 234-245 | |
| 2007 | ||
| j14 | Zhixiang Chen, Bin Fu: On the complexity of Rocchio's similarity-based relevance feedback algorithm. JASIST 58(10): 1392-1400 (2007) | |
| j13 | ||
| j12 | Bin Fu, Wei Wang: Geometric Separators and Their Applications to Protein Folding in the HP-Model. SIAM J. Comput. 37(4): 1014-1029 (2007) | |
| c36 | Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi: An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem. AAIM 2007: 317-326 | |
| c35 | Zhiyu Zhao, Bin Fu: A Flexible Algorithm for Pairwise Protein Structure Alignment. BIOCOMP 2007: 16-22 | |
| c34 | Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zhiyu Zhao, Binhai Zhu: Non-breaking Similarity of Genomes with Gene Repetitions. CPM 2007: 119-130 | |
| c33 | Bin Fu, Sai Aravalli, John Abraham: Software Protection by Hardware and Obfuscation. Security and Management 2007: 367-373 | |
| c32 | Mahdi Abdelguerfi, Zhixiang Chen, Bin Fu: On the Complexity of Approximation Streaming Algorithms for the k -Center Problem. FAW 2007: 160-171 | |
| c31 | Minghui Wu, Rongfeng Li, Bin Fu, Wenxin Li, Zhuoqun Xu: A Page Content Independent Book Dewarping Method to Handle 2D Images Captured by a Digital Camera. ICIAR 2007: 1242-1253 | |
| i2 | Li Chen, Bin Fu: Linear and Sublinear Time Algorithms for the Basis of Abelian Groups. Electronic Colloquium on Computational Complexity (ECCC) 14(052) (2007) | |
| 2006 | ||
| j11 | Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu: A PTAS for a disc covering problem using width-bounded separators. J. Comb. Optim. 11(2): 203-217 (2006) | |
| c30 | Bin Fu, Golden G. Richard III, Yixin Chen: Some new approaches for preventing software tampering. ACM Southeast Regional Conference 2006: 655-660 | |
| c29 | Bin Fu, Zhixiang Chen: Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem. AAIM 2006: 149-160 | |
| c28 | Zhixiang Chen, Bin Fu, Binhai Zhu: The Approximability of the Exemplar Breakpoint Distance Problem. AAIM 2006: 291-302 | |
| c27 | Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Zhu: Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes. COCOON 2006: 245-254 | |
| c26 | Xiulin Lou, Weigen Huang, Bin Fu, Junhua Teng: A Feature-Based Approach for Automatic Registration of NOAA AVHRR Images. IGARSS 2006: 995-998 | |
| c25 | ||
| 2005 | ||
| c24 | Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu: A PTAS for a Disc Covering Problem Using Width-Bounded Separators. COCOON 2005: 490-503 | |
| c23 | Zhixiang Chen, Bin Fu: A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm. COCOON 2005: 955-964 | |
| c22 | Peng Chen, Weigen Huang, Jingsong Yang, Bin Fu, Xiulin Lou, Aiqing Shi: Comparison of ship detection algorithms in spaceborne SAR imagery. IGARSS 2005: 1750-1752 | |
| c21 | Weigen Huang, Lu Yao, Jingsong Yang, Bin Fu, Qingmei Xiao, Peng Chen: Optimal SAR parameters for ship detection. IGARSS 2005: 2554-2555 | |
| c20 | Jingsong Yang, Qingmei Xiao, Weigen Huang, Bin Fu, Peng Chen, Lu Yao: Multifrequency SAR remote sensing of ocean internal waves. IGARSS 2005: 2588-2589 | |
| c19 | Xiulin Lou, Weigen Huang, Aiqing Shi, Bin Fu: An improved front-following algorithm for oceanic front measurement with AVHRR SST imagery. IGARSS 2005: 2629-2631 | |
| c18 | Jingsong Yang, Qingmei Xiao, Weigen Huang, Bin Fu, Peng Chen, Lu Yao: Ocean features separation from multifrequency polarimetric SAR imagery. IGARSS 2005: 3892-3894 | |
| c17 | Zhixiang Chen, Bin Fu: On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm. ISAAC 2005: 216-225 | |
| c16 | Bin Fu, Sorinel Adrian Oprisan, Lizhe Xu: Multi-directional Width-Bounded Geometric Separator and Protein Folding. ISAAC 2005: 995-1006 | |
| i1 | Bin Fu: Theory and Application of Width Bounded Geometric Separator. Electronic Colloquium on Computational Complexity (ECCC)(013) (2005) | |
| 2004 | ||
| c15 | Bin Fu, Wei Wang: A 2O(n1-(1/d)log n) Time Algorithm for d-Dimensional Protein Folding in the HP-Model. ICALP 2004: 630-644 | |
| c14 | ||
| 2003 | ||
| c13 | Bin Fu, James Broberg, Zahir Tari: Task Assignment Strategy for Overloaded Systems. ISCC 2003: 1119-1125 | |
| c12 | Bin Fu, Zahir Tari: A Dynamic Load Distribution Strategy for Systems Under High Task Variation and Heavy Traffic. SAC 2003: 1031-1037 | |
| 2000 | ||
| j10 | ||
| 1999 | ||
| j9 | Bin Fu, Richard Beigel: A Comparison of Resource-Bounded Molecular Computation Models. Algorithmica 24(2): 87-95 (1999) | |
| j8 | Richard Beigel, Bin Fu: Molecular Computing, Bounded Nondeterminism, and Efficient Recursion. Algorithmica 25(2-3): 222-238 (1999) | |
| 1998 | ||
| c11 | Richard Beigel, Bin Fu: Solving Intractable Problems with DNA Computing. IEEE Conference on Computational Complexity 1998: 154- | |
| 1997 | ||
| j7 | Bin Fu, Keshab K. Parhi: Generalized multiplication-free arithmetic codes. IEEE Transactions on Communications 45(5): 497-501 (1997) | |
| c10 | Richard Beigel, Bin Fu: Circuits Over PP and PL. IEEE Conference on Computational Complexity 1997: 24-35 | |
| c9 | Richard Beigel, Bin Fu: Molecular Computing, Bounded Nondeterminism, and Efficient Recursion. ICALP 1997: 816-826 | |
| c8 | Bin Fu, Richard Beigel: A Comparison of Resource-Bounded Molecular Computation Models. ISTCS 1997: 6-11 | |
| 1995 | ||
| j6 | Bin Fu: With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets. SIAM J. Comput. 24(5): 1082-1090 (1995) | |
| c7 | ||
| c6 | ||
| 1994 | ||
| j5 | Bin Fu, Hong-Zhou Li, Yong Zhong: An Application of the Translational Method. Mathematical Systems Theory 27(2): 183-186 (1994) | |
| j4 | Bin Fu, Hong-Zhou Li: Closeness of NP-Hard Sets to Other Complexity Classes. SIAM J. Comput. 23(2): 255-260 (1994) | |
| 1993 | ||
| j3 | Bin Fu: On Lower Bounds of the Closeness Between Complexity Classes. Mathematical Systems Theory 26(2): 187-202 (1993) | |
| j2 | Shouwen Tang, Bin Fu, Tran Liu: Exponential-Time and Subexponential-Time Sets. Theor. Comput. Sci. 115(2): 371-381 (1993) | |
| j1 | Bin Fu, Hong-Zhou Li: On Symmetric Differences of NP-Hard Sets with Weakly P-Selective Sets. Theor. Comput. Sci. 120(2): 279-291 (1993) | |
| c5 | Bin Fu: With Quasi-linear Queries, EXP is not Polynomial Time Turing Reducible to ?Sparse Sets. Structure in Complexity Theory Conference 1993: 185-191 | |
| 1992 | ||
| c4 | Bin Fu, Hong-Zhou Li, Yong Zhong: Some Properties of Exponential Time Complexity Classes. Structure in Complexity Theory Conference 1992: 50-57 | |
| c3 | Bin Fu, Hong-Zhou Li: On Closeness of NP-Hard Sets to Other Complexity Classes. Structure in Complexity Theory Conference 1992: 243-248 | |
| c2 | Bin Fu, Hong-Zhou Li: On Symmetric Differences of NP-hard Sets with Weakly-P-Selective Sets. ISAAC 1992: 439-448 | |
| 1991 | ||
| c1 | Shouwen Tang, Bin Fu, Tian Liu: Exponential Time and Subexponential Time Sets. Structure in Complexity Theory Conference 1991: 230-237 | |
Colors in the list of coauthors
Last update Sat May 25 14:40:59 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page