Bin Fu

	2009
61		John Abraham, Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Zhu: On the Approximability of Some Haplotyping Problems. AAIM 2009: 3-14
60		Bin Fu, Yumei Huo, Hairong Zhao: Makespan Minimization with Machine Availability Constraints. COCOA 2009: 430-437
59		Bin Fu, Angsheng Li, Liyu Zhang: Separating NE from Some Nonuniform Nondeterministic Complexity Classes. COCOON 2009: 486-495
58		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
57		Bin Fu, Yumei Huo, Hairong Zhao: Exponential inapproximability and FPTAS for scheduling with availability constraints. Theor. Comput. Sci. 410(27-29): 2663-2674 (2009)
	2008
56		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
55		Zaixin Lu, Zhiyu Zhao, Sergio Garcia, Bin Fu: New Algorithm and Web Server for Finding Proteins with Similar 3D Structures. BIOCOMP 2008: 674-680
54		Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu: On Recovering Syntenic Blocks from Comparative Maps. COCOA 2008: 319-327
53		Bin Fu, Zhiyu Zhao: Separating Sublinear Time Computations by Approximate Diameter. COCOA 2008: 79-88
52		Bin Fu, Zhixiang Chen: A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model. COCOON 2008: 82-91
51		Bin Fu, Ming-Yang Kao, Lusheng Wang: Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences. TAMC 2008: 234-245
50		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)
49		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)
48		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)
47		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)
46		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)
	2007
45		Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi: An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem. AAIM 2007: 317-326
44		Zhiyu Zhao, Bin Fu: A Flexible Algorithm for Pairwise Protein Structure Alignment. BIOCOMP 2007: 16-22
43		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
42		Mahdi Abdelguerfi, Zhixiang Chen, Bin Fu: On the Complexity of Approximation Streaming Algorithms for the k -Center Problem. FAW 2007: 160-171
41		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
40		Bin Fu, Sai Aravalli, John Abraham: Software Protection by Hardware and Obfuscation. Security and Management 2007: 367-373
39		Li Chen, Bin Fu: Linear and Sublinear Time Algorithms for the Basis of Abelian Groups. Electronic Colloquium on Computational Complexity (ECCC) 14(052): (2007)
38		Zhixiang Chen, Bin Fu: On the complexity of Rocchio's similarity-based relevance feedback algorithm. JASIST 58(10): 1392-1400 (2007)
37		Zhixiang Chen, Bin Fu: Erratum. JASIST 58(14): 2414 (2007)
36		Bin Fu, Wei Wang: Geometric Separators and Their Applications to Protein Folding in the HP-Model. SIAM J. Comput. 37(4): 1014-1029 (2007)
	2006
35		Bin Fu, Zhixiang Chen: Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem. AAIM 2006: 149-160
34		Zhixiang Chen, Bin Fu, Binhai Zhu: The Approximability of the Exemplar Breakpoint Distance Problem. AAIM 2006: 291-302
33		Bin Fu, Golden G. Richard III, Yixin Chen: Some new approaches for preventing software tampering. ACM Southeast Regional Conference 2006: 655-660
32		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
31		Bin Fu: Theory and Application of Width Bounded Geometric Separator. STACS 2006: 277-288
30		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)
	2005
29		Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu: A PTAS for a Disc Covering Problem Using Width-Bounded Separators. COCOON 2005: 490-503
28		Zhixiang Chen, Bin Fu: A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm. COCOON 2005: 955-964
27		Zhixiang Chen, Bin Fu: On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm. ISAAC 2005: 216-225
26		Bin Fu, Sorinel Adrian Oprisan, Lizhe Xu: Multi-directional Width-Bounded Geometric Separator and Protein Folding. ISAAC 2005: 995-1006
25		Bin Fu: Theory and Application of Width Bounded Geometric Separator Electronic Colloquium on Computational Complexity (ECCC)(013): (2005)
	2004
24		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
23		Bin Fu, Richard Beigel: Diagnosis in the Presence of Intermittent Faults. ISAAC 2004: 427-441
	2003
22		Bin Fu, James Broberg, Zahir Tari: Task Assignment Strategy for Overloaded Systems. ISCC 2003: 1119-1125
21		Bin Fu, Zahir Tari: A Dynamic Load Distribution Strategy for Systems Under High Task Variation and Heavy Traffic. SAC 2003: 1031-1037
	2000
20		Richard Beigel, Bin Fu: Circuits over PP and PL. J. Comput. Syst. Sci. 60(2): 422-441 (2000)
	1999
19		Bin Fu, Richard Beigel: A Comparison of Resource-Bounded Molecular Computation Models. Algorithmica 24(2): 87-95 (1999)
18		Richard Beigel, Bin Fu: Molecular Computing, Bounded Nondeterminism, and Efficient Recursion. Algorithmica 25(2-3): 222-238 (1999)
	1998
17		Richard Beigel, Bin Fu: Solving Intractable Problems with DNA Computing. IEEE Conference on Computational Complexity 1998: 154-
	1997
16		Richard Beigel, Bin Fu: Molecular Computing, Bounded Nondeterminism, and Efficient Recursion. ICALP 1997: 816-826
15		Richard Beigel, Bin Fu: Circuits Over PP and PL. IEEE Conference on Computational Complexity 1997: 24-35
14		Bin Fu, Richard Beigel: A Comparison of Resource-Bounded Molecular Computation Models. ISTCS 1997: 6-11
	1995
13		Bin Fu, Keshab K. Parhi: Two VLSI Design Advances in Arithmetic Coding. ISCAS 1995: 1440-1443
12		Bin Fu, Keshab K. Parhi: Generalized Multiplication Free Arithmetic Codes. ISCAS 1995: 437-440
11		Bin Fu: With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets. SIAM J. Comput. 24(5): 1082-1090 (1995)
	1994
10		Bin Fu, Hong-Zhou Li, Yong Zhong: An Application of the Translational Method. Mathematical Systems Theory 27(2): 183-186 (1994)
9		Bin Fu, Hong-Zhou Li: Closeness of NP-Hard Sets to Other Complexity Classes. SIAM J. Comput. 23(2): 255-260 (1994)
	1993
8		Bin Fu: With Quasi-linear Queries, EXP is not Polynomial Time Turing Reducible to ?Sparse Sets. Structure in Complexity Theory Conference 1993: 185-191
7		Bin Fu: On Lower Bounds of the Closeness Between Complexity Classes. Mathematical Systems Theory 26(2): 187-202 (1993)
6		Shouwen Tang, Bin Fu, Tran Liu: Exponential-Time and Subexponential-Time Sets. Theor. Comput. Sci. 115(2): 371-381 (1993)
5		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)
	1992
4		Bin Fu, Hong-Zhou Li: On Symmetric Differences of NP-hard Sets with Weakly-P-Selective Sets. ISAAC 1992: 439-448
3		Bin Fu, Hong-Zhou Li: On Closeness of NP-Hard Sets to Other Complexity Classes. Structure in Complexity Theory Conference 1992: 243-248
2		Bin Fu, Hong-Zhou Li, Yong Zhong: Some Properties of Exponential Time Complexity Classes. Structure in Complexity Theory Conference 1992: 50-57
	1991
1		Shouwen Tang, Bin Fu, Tian Liu: Exponential Time and Subexponential Time Sets. Structure in Complexity Theory Conference 1991: 230-237

Coauthor Index

1	Mahdi Abdelguerfi	[42] [45]
2	John Abraham	[40] [61]
3	Francisco J. Alanis	[47]
4	Sai Aravalli	[40]
5	Richard Beigel	[14] [15] [16] [17] [18] [19] [20] [23]
6	James Broberg	[22]
7	Li Chen	[39]
8	Yixin Chen	[33]
9	Zhixiang Chen	[27] [28] [29] [30] [32] [34] [35] [37] [38] [42] [43] [45] [46] [48] [49] [52] [54] [56] [61]
10	Richard H. Fowler	[32] [49] [61]
11	Sergio Garcia	[55]
12	Yumei Huo	[57] [60]
13	Minghui Jiang	[54]
14	Ming-Yang Kao	[51] [58]
15	Angsheng Li	[59]
16	Hong-Zhou Li	[2] [3] [4] [5] [9] [10]
17	Rongfeng Li	[41]
18	Wenxin Li	[41]
19	Tian Liu	[1]
20	Tran Liu	[6]
21	Zaixin Lu	[55]
22	Sorinel Adrian Oprisan	[26] [50]
23	Keshab K. Parhi	[12] [13]
24	Golden G. Richard III	[33]
25	Robert T. Schweller	[46] [56]
26	Christopher M. Summa	[47]
27	Shouwen Tang	[1] [6]
28	Yong Tang	[29] [30]
29	Zahir Tari	[21] [22]
30	Lusheng Wang	[51] [58]
31	Wei Wang	[24] [36]
32	Minghui Wu	[41]
33	Jinhui Xu	[43]
34	Lizhe Xu	[26] [50]
35	Zhuoqun Xu	[41]
36	Boting Yang (Bo-Ting Yang)	[43] [46] [56]
37	Liyu Zhang	[59]
38	Hairong Zhao	[57] [60]
39	Zhiyu Zhao	[43] [44] [46] [47] [53] [55] [56]
40	Yong Zhong	[2] [10]
41	Binhai Zhu	[29] [30] [32] [34] [43] [46] [49] [54] [56] [61]

Colors in the list of coauthors