The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bin Fu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. Richard Beigel, Bin Fu
    Circuits Over PP and PL. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:24-35 [Conf]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. Bin Fu, Wei Wang
    A 2O(n1-(1/d)log n) Time Algorithm for d-Dimensional Protein Folding in the HP-Model. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:630-644 [Conf]
  14. Richard Beigel, Bin Fu
    Molecular Computing, Bounded Nondeterminism, and Efficient Recursion. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:816-826 [Conf]
  15. 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]
  16. Bin Fu, Richard Beigel
    Diagnosis in the Presence of Intermittent Faults. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:427-441 [Conf]
  17. 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]
  18. 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]
  19. Bin Fu, Keshab K. Parhi
    Generalized Multiplication Free Arithmetic Codes. [Citation Graph (0, 0)][DBLP]
    ISCAS, 1995, pp:437-440 [Conf]
  20. Bin Fu, Keshab K. Parhi
    Two VLSI Design Advances in Arithmetic Coding. [Citation Graph (0, 0)][DBLP]
    ISCAS, 1995, pp:1440-1443 [Conf]
  21. Bin Fu, James Broberg, Zahir Tari
    Task Assignment Strategy for Overloaded Systems. [Citation Graph (0, 0)][DBLP]
    ISCC, 2003, pp:1119-1125 [Conf]
  22. Bin Fu, Richard Beigel
    A Comparison of Resource-Bounded Molecular Computation Models. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:6-11 [Conf]
  23. 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]
  24. Bin Fu
    Theory and Application of Width Bounded Geometric Separator. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:277-288 [Conf]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. 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]
  38. 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]
  39. Mahdi Abdelguerfi, Zhixiang Chen, Bin Fu
    On the Complexity of Approximation Streaming Algorithms for the k -Center Problem. [Citation Graph (0, 0)][DBLP]
    FAW, 2007, pp:160-171 [Conf]
  40. 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]

  41. On the Approximability of Some Haplotyping Problems. [Citation Graph (, )][DBLP]


  42. A Linear Kernel for Co-Path/Cycle Packing. [Citation Graph (, )][DBLP]


  43. Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints. [Citation Graph (, )][DBLP]


  44. Linear Time Probabilistic Algorithms for the Singular Haplotype Reconstruction Problem from SNP Fragments. [Citation Graph (, )][DBLP]


  45. A Flexible Algorithm for Pairwise Protein Structure Alignment. [Citation Graph (, )][DBLP]


  46. New Algorithm and Web Server for Finding Proteins with Similar 3D Structures. [Citation Graph (, )][DBLP]


  47. A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model. [Citation Graph (, )][DBLP]


  48. Separating NE from Some Nonuniform Nondeterministic Complexity Classes. [Citation Graph (, )][DBLP]


  49. Constant Time Approximation Scheme for Largest Well Predicted Subset. [Citation Graph (, )][DBLP]


  50. Software Protection by Hardware and Obfuscation. [Citation Graph (, )][DBLP]


  51. DiscFinder: a data-intensive scalable cluster finder for astrophysics. [Citation Graph (, )][DBLP]


  52. Linear and Sublinear Time Algorithms for Basis of Abelian Groups. [Citation Graph (, )][DBLP]


  53. Analysis of uncertain data: Selection of probes for information gathering. [Citation Graph (, )][DBLP]


  54. Analysis of uncertain data: Evaluation of given hypotheses. [Citation Graph (, )][DBLP]


  55. Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences. [Citation Graph (, )][DBLP]


  56. Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability. [Citation Graph (, )][DBLP]


  57. Separating Sublinear Time Computations by Approximate Diameter. [Citation Graph (, )][DBLP]


  58. On Recovering Syntenic Blocks from Comparative Maps. [Citation Graph (, )][DBLP]


  59. Makespan Minimization with Machine Availability Constraints. [Citation Graph (, )][DBLP]


  60. O((logn)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems. [Citation Graph (, )][DBLP]


  61. Improved Sublinear Time Algorithm for Width-Bounded Separators. [Citation Graph (, )][DBLP]


  62. Approximation Schemes for Scheduling with Availability Constraints. [Citation Graph (, )][DBLP]


  63. Efficient protein alignment algorithm for protein search. [Citation Graph (, )][DBLP]


  64. A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing [Citation Graph (, )][DBLP]


  65. Sublinear Time Motif Discovery from Multiple Sequences [Citation Graph (, )][DBLP]


  66. XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme [Citation Graph (, )][DBLP]


  67. The Complexity of Testing Monomials in Multivariate Polynomials [Citation Graph (, )][DBLP]


  68. Algorithms for Testing Monomials in Multivariate Polynomials [Citation Graph (, )][DBLP]


  69. Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials [Citation Graph (, )][DBLP]


  70. Linear and Sublinear Time Algorithms for the Basis of Abelian Groups. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002