The following pages link to Bin Fu (Q313968):
Displayed 50 items.
- The label cut problem with respect to path length and label frequency (Q313969) (← links)
- On testing monomials in multivariate polynomials (Q391220) (← links)
- Algebraic data retrieval algorithms for multi-channel wireless data broadcast (Q391229) (← links)
- On the approximability of the exemplar adjacency number problem for genomes with gene repetitions (Q401311) (← links)
- Investigation on transient dynamic behaviors of low-tension undersea cables (Q415902) (← links)
- Coordinated scheduling of production and delivery with production window and delivery capacity constraints (Q417989) (← links)
- Concentration independent random number generation in tile self-assembly (Q511914) (← links)
- Linear and sublinear time algorithms for the basis of abelian groups (Q553345) (← links)
- Theory and application of width bounded geometric separators (Q632801) (← links)
- Approximation schemes for parallel machine scheduling with availability constraints (Q642981) (← links)
- Separating NE from some nonuniform nondeterministic complexity classes (Q652627) (← links)
- Separating sublinear time computations by approximate diameter (Q849140) (← links)
- Competitive algorithms for unbounded one-way trading (Q897958) (← links)
- Sublinear time width-bounded separators and their application to the protein side-chain packing problem (Q927195) (← links)
- Exponential inapproximability and FPTAS for scheduling with availability constraints (Q1029337) (← links)
- On recovering syntenic blocks from comparative maps (Q1041433) (← links)
- (Q1125446) (redirect page) (← links)
- Molecular computing, bounded nondeterminism, and efficient recursion (Q1125447) (← links)
- Exponential-time and subexponential-time sets (Q1261474) (← links)
- A comparison of resource-bounded molecular computation models (Q1293873) (← links)
- On symmetric differences of NP-hard sets with weakly P-selective sets (Q1314375) (← links)
- Circuits over PP and PL (Q1567408) (← links)
- Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (Q1702134) (← links)
- Second-order sliding mode disturbance observer-based adaptive fuzzy tracking control for near-space vehicles with prescribed tracking performance (Q1720898) (← links)
- Sublinear time motif discovery from multiple sequences (Q1736589) (← links)
- An improved FPT algorithm for almost forest deletion problem (Q1751414) (← links)
- Partial sublinear time approximation and inapproximation for maximum coverage (Q1791009) (← links)
- Constant factor approximation algorithm for \(l\)-pseudoforest deletion problem (Q1791042) (← links)
- The complexity of influence maximization problem in the deterministic linear threshold model (Q1928515) (← links)
- Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials (Q1944393) (← links)
- Hardness of sparse sets and minimal circuit size problem (Q2019493) (← links)
- Polyhedral circuits and their applications (Q2039640) (← links)
- Streaming algorithms for multitasking scheduling with shared processing (Q2166248) (← links)
- An approximation algorithm for the \(l\)-pseudoforest deletion problem (Q2285146) (← links)
- Constant time approximation scheme for largest well predicted subset (Q2377379) (← links)
- Fast face recognition based on fractal theory (Q2423091) (← links)
- On the inapproximability of the exemplar conserved interval distance problem of genomes (Q2427442) (← links)
- A PTAS for a disc covering problem using width-bounded separators (Q2498985) (← links)
- Randomized parameterized algorithms for the kidney exchange problem (Q2632525) (← links)
- Self-assembly with Geometric Tiles (Q2843295) (← links)
- NE Is Not NP Turing Reducible to Nonexponentially Dense NP Sets (Q2894481) (← links)
- A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing (Q2897992) (← links)
- Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP (Q2897993) (← links)
- Erratum: The Approximability of the Exemplar Breakpoint Distance Problem (Q2898011) (← links)
- Flipping Tiles: Concentration Independent Coin Flips in Tile Self-Assembly (Q2948410) (← links)
- Probabilistic Analysis of a Motif Discovery Algorithm for Multiple Sequences (Q3058527) (← links)
- XML Reconstruction View Selection in XML Databases: Complexity Analysis and Approximation Scheme (Q3066448) (← links)
- Discovering almost any hidden motif from multiple sequences (Q3189008) (← links)
- MAKESPAN MINIMIZATION WITH MACHINE AVAILABILITY CONSTRAINTS (Q3397506) (← links)
- Efficient Algorithms for Model-Based Motif Discovery from Multiple Sequences (Q3502650) (← links)