| 2008 |
|---|
| 51 | EE | 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 |
| 50 | EE | Zhixiang Chen,
Bin Fu,
Minghui Jiang,
Binhai Zhu:
On Recovering Syntenic Blocks from Comparative Maps.
COCOA 2008: 319-327 |
| 49 | EE | Bin Fu,
Zhiyu Zhao:
Separating Sublinear Time Computations by Approximate Diameter.
COCOA 2008: 79-88 |
| 48 | EE | Bin Fu,
Zhixiang Chen:
A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model.
COCOON 2008: 82-91 |
| 47 | EE | Bin Fu,
Ming-Yang Kao,
Lusheng Wang:
Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences.
TAMC 2008: 234-245 |
| 46 | EE | 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) |
| 45 | EE | 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) |
| 2007 |
|---|
| 44 | EE | Bin Fu,
Zhixiang Chen,
Mahdi Abdelguerfi:
An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem.
AAIM 2007: 317-326 |
| 43 | | Zhiyu Zhao,
Bin Fu:
A Flexible Algorithm for Pairwise Protein Structure Alignment.
BIOCOMP 2007: 16-22 |
| 42 | EE | 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 |
| 41 | EE | Mahdi Abdelguerfi,
Zhixiang Chen,
Bin Fu:
On the Complexity of Approximation Streaming Algorithms for the k -Center Problem.
FAW 2007: 160-171 |
| 40 | EE | 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 |
| 39 | | Bin Fu,
Sai Aravalli,
John Abraham:
Software Protection by Hardware and Obfuscation.
Security and Management 2007: 367-373 |
| 38 | EE | Zhixiang Chen,
Bin Fu:
On the complexity of Rocchio's similarity-based relevance feedback algorithm.
JASIST 58(10): 1392-1400 (2007) |
| 37 | EE | Zhixiang Chen,
Bin Fu:
Erratum.
JASIST 58(14): 2414 (2007) |
| 36 | EE | 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 | EE | Bin Fu,
Zhixiang Chen:
Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem.
AAIM 2006: 149-160 |
| 34 | EE | Zhixiang Chen,
Bin Fu,
Binhai Zhu:
The Approximability of the Exemplar Breakpoint Distance Problem.
AAIM 2006: 291-302 |
| 33 | EE | Bin Fu,
Golden G. Richard III,
Yixin Chen:
Some new approaches for preventing software tampering.
ACM Southeast Regional Conference 2006: 655-660 |
| 32 | EE | 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 | EE | Bin Fu:
Theory and Application of Width Bounded Geometric Separator.
STACS 2006: 277-288 |
| 30 | EE | 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 | EE | Zhixiang Chen,
Bin Fu,
Yong Tang,
Binhai Zhu:
A PTAS for a Disc Covering Problem Using Width-Bounded Separators.
COCOON 2005: 490-503 |
| 28 | EE | Zhixiang Chen,
Bin Fu:
A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm.
COCOON 2005: 955-964 |
| 27 | EE | Zhixiang Chen,
Bin Fu:
On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm.
ISAAC 2005: 216-225 |
| 26 | EE | Bin Fu,
Sorinel Adrian Oprisan,
Lizhe Xu:
Multi-directional Width-Bounded Geometric Separator and Protein Folding.
ISAAC 2005: 995-1006 |
| 25 | EE | Bin Fu:
Theory and Application of Width Bounded Geometric Separator
Electronic Colloquium on Computational Complexity (ECCC)(013): (2005) |
| 2004 |
|---|
| 24 | EE | 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 | EE | Bin Fu,
Richard Beigel:
Diagnosis in the Presence of Intermittent Faults.
ISAAC 2004: 427-441 |
| 2003 |
|---|
| 22 | EE | 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 | EE | Bin Fu,
Richard Beigel:
A Comparison of Resource-Bounded Molecular Computation Models.
Algorithmica 24(2): 87-95 (1999) |
| 18 | EE | Richard Beigel,
Bin Fu:
Molecular Computing, Bounded Nondeterminism, and Efficient Recursion.
Algorithmica 25(2-3): 222-238 (1999) |
| 1998 |
|---|
| 17 | EE | 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 | EE | Richard Beigel,
Bin Fu:
Circuits Over PP and PL.
IEEE Conference on Computational Complexity 1997: 24-35 |
| 14 | EE | 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 |
