The SCEAS System
| |||||||

## Search the dblp DataBase
Bin Fu:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Bin Fu, Golden Richard III, Yixin Chen
**Some new approaches for preventing software tampering.**[Citation Graph (0, 0)][DBLP] ACM Southeast Regional Conference, 2006, pp:655-660 [Conf] - Zhixiang Chen, Bin Fu, Binhai Zhu
**The Approximability of the Exemplar Breakpoint Distance Problem.**[Citation Graph (0, 0)][DBLP] AAIM, 2006, pp:291-302 [Conf] - Bin Fu, Zhixiang Chen
**Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem.**[Citation Graph (0, 0)][DBLP] AAIM, 2006, pp:149-160 [Conf] - Richard Beigel, Bin Fu
**Circuits Over PP and PL.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1997, pp:24-35 [Conf] - Richard Beigel, Bin Fu
**Solving Intractable Problems with DNA Computing.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1998, pp:154-0 [Conf] - Bin Fu
**With Quasi-linear Queries, EXP is not Polynomial Time Turing Reducible to ?Sparse Sets.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1993, pp:185-191 [Conf] - Bin Fu, Hong-Zhou Li
**On Closeness of NP-Hard Sets to Other Complexity Classes.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1992, pp:243-248 [Conf] - Bin Fu, Hong-Zhou Li, Yong Zhong
**Some Properties of Exponential Time Complexity Classes.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1992, pp:50-57 [Conf] - Shouwen Tang, Bin Fu, Tian Liu
**Exponential Time and Subexponential Time Sets.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:230-237 [Conf] - Zhixiang Chen, Bin Fu
**A Quadratic Lower Bound for Rocchio's Similarity-Based Relevance Feedback Algorithm.**[Citation Graph (0, 0)][DBLP] COCOON, 2005, pp:955-964 [Conf] - Zhixiang Chen, Richard H. Fowler, Bin Fu, Binhai Zhu
**Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes.**[Citation Graph (0, 0)][DBLP] COCOON, 2006, pp:245-254 [Conf] - Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu
**A PTAS for a Disc Covering Problem Using Width-Bounded Separators.**[Citation Graph (0, 0)][DBLP] COCOON, 2005, pp:490-503 [Conf] - Bin Fu, Wei Wang
**A 2**[Citation Graph (0, 0)][DBLP]^{O(n1-(1/d)log n)}Time Algorithm for d-Dimensional Protein Folding in the HP-Model. ICALP, 2004, pp:630-644 [Conf] - Richard Beigel, Bin Fu
**Molecular Computing, Bounded Nondeterminism, and Efficient Recursion.**[Citation Graph (0, 0)][DBLP] ICALP, 1997, pp:816-826 [Conf] - Bin Fu, Sorinel Adrian Oprisan, Lizhe Xu
**Multi-directional Width-Bounded Geometric Separator and Protein Folding.**[Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:995-1006 [Conf] - Bin Fu, Richard Beigel
**Diagnosis in the Presence of Intermittent Faults.**[Citation Graph (0, 0)][DBLP] ISAAC, 2004, pp:427-441 [Conf] - Bin Fu, Hong-Zhou Li
**On Symmetric Differences of NP-hard Sets with Weakly-P-Selective Sets.**[Citation Graph (0, 0)][DBLP] ISAAC, 1992, pp:439-448 [Conf] - Zhixiang Chen, Bin Fu
**On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm.**[Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:216-225 [Conf] - Bin Fu, Keshab K. Parhi
**Generalized Multiplication Free Arithmetic Codes.**[Citation Graph (0, 0)][DBLP] ISCAS, 1995, pp:437-440 [Conf] - Bin Fu, Keshab K. Parhi
**Two VLSI Design Advances in Arithmetic Coding.**[Citation Graph (0, 0)][DBLP] ISCAS, 1995, pp:1440-1443 [Conf] - Bin Fu, James Broberg, Zahir Tari
**Task Assignment Strategy for Overloaded Systems.**[Citation Graph (0, 0)][DBLP] ISCC, 2003, pp:1119-1125 [Conf] - Bin Fu, Richard Beigel
**A Comparison of Resource-Bounded Molecular Computation Models.**[Citation Graph (0, 0)][DBLP] ISTCS, 1997, pp:6-11 [Conf] - Bin Fu, Zahir Tari
**A Dynamic Load Distribution Strategy for Systems Under High Task Variation and Heavy Traffic.**[Citation Graph (0, 0)][DBLP] SAC, 2003, pp:1031-1037 [Conf] - Bin Fu
**Theory and Application of Width Bounded Geometric Separator.**[Citation Graph (0, 0)][DBLP] STACS, 2006, pp:277-288 [Conf] - Bin Fu, Richard Beigel
**A Comparison of Resource-Bounded Molecular Computation Models.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1999, v:24, n:2, pp:87-95 [Journal] - Richard Beigel, Bin Fu
**Molecular Computing, Bounded Nondeterminism, and Efficient Recursion.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1999, v:25, n:2-3, pp:222-238 [Journal] - Bin Fu
**Theory and Application of Width Bounded Geometric Separator**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:013, pp:- [Journal] - Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu
**A PTAS for a disc covering problem using width-bounded separators.**[Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2006, v:11, n:2, pp:203-217 [Journal] - Richard Beigel, Bin Fu
**Circuits over PP and PL.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2000, v:60, n:2, pp:422-441 [Journal] - Bin Fu
**On Lower Bounds of the Closeness Between Complexity Classes.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1993, v:26, n:2, pp:187-202 [Journal] - Bin Fu, Hong-Zhou Li, Yong Zhong
**An Application of the Translational Method.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1994, v:27, n:2, pp:183-186 [Journal] - Bin Fu
**With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1995, v:24, n:5, pp:1082-1090 [Journal] - Bin Fu, Hong-Zhou Li
**Closeness of NP-Hard Sets to Other Complexity Classes.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1994, v:23, n:2, pp:255-260 [Journal] - Bin Fu, Hong-Zhou Li
**On Symmetric Differences of NP-Hard Sets with Weakly P-Selective Sets.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1993, v:120, n:2, pp:279-291 [Journal] - Shouwen Tang, Bin Fu, Tran Liu
**Exponential-Time and Subexponential-Time Sets.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1993, v:115, n:2, pp:371-381 [Journal] - Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi
**An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem.**[Citation Graph (0, 0)][DBLP] AAIM, 2007, pp:317-326 [Conf] - Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zhiyu Zhao, Binhai Zhu
**Non-breaking Similarity of Genomes with Gene Repetitions.**[Citation Graph (0, 0)][DBLP] CPM, 2007, pp:119-130 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] ICIAR, 2007, pp:1242-1253 [Conf] - Mahdi Abdelguerfi, Zhixiang Chen, Bin Fu
**On the Complexity of Approximation Streaming Algorithms for the**[Citation Graph (0, 0)][DBLP]*k*-Center Problem. FAW, 2007, pp:160-171 [Conf] - Bin Fu, Wei Wang
**Geometric Separators and Their Applications to Protein Folding in the HP-Model.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:37, n:4, pp:1014-1029 [Journal] **On the Approximability of Some Haplotyping Problems.**[Citation Graph (, )][DBLP]**A Linear Kernel for Co-Path/Cycle Packing.**[Citation Graph (, )][DBLP]**Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints.**[Citation Graph (, )][DBLP]**Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments.**[Citation Graph (, )][DBLP]**A Flexible Algorithm for Pairwise Protein Structure Alignment.**[Citation Graph (, )][DBLP]**New Algorithm and Web Server for Finding Proteins with Similar 3D Structures.**[Citation Graph (, )][DBLP]**A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model.**[Citation Graph (, )][DBLP]**Separating NE from Some Nonuniform Nondeterministic Complexity Classes.**[Citation Graph (, )][DBLP]**Constant Time Approximation Scheme for Largest Well Predicted Subset.**[Citation Graph (, )][DBLP]**Software Protection by Hardware and Obfuscation.**[Citation Graph (, )][DBLP]**DiscFinder: a data-intensive scalable cluster finder for astrophysics.**[Citation Graph (, )][DBLP]**Linear and Sublinear Time Algorithms for Basis of Abelian Groups.**[Citation Graph (, )][DBLP]**Analysis of uncertain data: Selection of probes for information gathering.**[Citation Graph (, )][DBLP]**Analysis of uncertain data: Evaluation of given hypotheses.**[Citation Graph (, )][DBLP]**Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences.**[Citation Graph (, )][DBLP]**Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability.**[Citation Graph (, )][DBLP]**Separating Sublinear Time Computations by Approximate Diameter.**[Citation Graph (, )][DBLP]**On Recovering Syntenic Blocks from Comparative Maps.**[Citation Graph (, )][DBLP]**Makespan Minimization with Machine Availability Constraints.**[Citation Graph (, )][DBLP][Citation Graph (, )][DBLP]*O*((log*n*)^{2}) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems.**Improved Sublinear Time Algorithm for Width-Bounded Separators.**[Citation Graph (, )][DBLP]**Approximation Schemes for Scheduling with Availability Constraints.**[Citation Graph (, )][DBLP]**Efficient protein alignment algorithm for protein search.**[Citation Graph (, )][DBLP]**A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing**[Citation Graph (, )][DBLP]**Sublinear Time Motif Discovery from Multiple Sequences**[Citation Graph (, )][DBLP]**XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme**[Citation Graph (, )][DBLP]**The Complexity of Testing Monomials in Multivariate Polynomials**[Citation Graph (, )][DBLP]**Algorithms for Testing Monomials in Multivariate Polynomials**[Citation Graph (, )][DBLP]**Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials**[Citation Graph (, )][DBLP]**Linear and Sublinear Time Algorithms for the Basis of Abelian Groups.**[Citation Graph (, )][DBLP]
Search in 0.009secs, Finished in 0.011secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |