The following pages link to Bin Fu (Q313968):
Displayed 50 items.
- Non-breaking Similarity of Genomes with Gene Repetitions (Q3506914) (← links)
- A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model (Q3511316) (← links)
- Geometric Separators and Their Applications to Protein Folding in the HP-Model (Q3519385) (← links)
- Constant Time Approximation Scheme for Largest Well Predicted Subset (Q3578343) (← links)
- A Linear Kernel for Co-Path/Cycle Packing (Q3578360) (← links)
- Coordinated Scheduling of Production and Delivery with Production Window and Delivery Capacity Constraints (Q3578368) (← links)
- Approximation Schemes for Scheduling with Availability Constraints (Q3587338) (← links)
- Improved Sublinear Time Algorithm for Width-Bounded Separators (Q3587340) (← links)
- O((logn)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems (Q3587356) (← links)
- Lower Bounds on the Approximation of the Exemplar Conserved Interval Distance Problem of Genomes (Q3591316) (← links)
- MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING (Q3607489) (← links)
- On the Complexity of Approximation Streaming Algorithms for the k-Center Problem (Q3612586) (← links)
- Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability (Q3630208) (← links)
- Makespan Minimization with Machine Availability Constraints (Q3637090) (← links)
- Linear and Sublinear Time Algorithms for Basis of Abelian Groups (Q3652237) (← links)
- SeparatingPH fromPP by relativization (Q4025322) (← links)
- On lower bounds of the closeness between complexity classes (Q4032931) (← links)
- (Q4246731) (← links)
- (Q4258581) (← links)
- (Q4263688) (← links)
- (Q4265108) (← links)
- (Q4285070) (← links)
- An application of the translational method (Q4285626) (← links)
- Closeness of NP-Hard Sets to Other Complexity Classes (Q4291555) (← links)
- Generalized multiplication-free arithmetic codes (Q4361497) (← links)
- Molecular computing, bounded nondeterminism, and efficient recursion (Q4572009) (← links)
- (Q4641275) (← links)
- With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets (Q4857596) (← links)
- (Q4879803) (← links)
- Sublinear Time Approximate Sum via Uniform Random Sampling (Q4925287) (← links)
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
- The Complexity of Testing Monomials in Multivariate Polynomials (Q5199135) (← links)
- Algorithms for Testing Monomials in Multivariate Polynomials (Q5199136) (← links)
- Algebraic Algorithm for Scheduling Data Retrieval in Multi-channel Wireless Data Broadcast Environments (Q5199141) (← links)
- Minimum Interval Cover and Its Application to Genome Sequencing (Q5199157) (← links)
- Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem (Q5199158) (← links)
- Competitive Algorithms for Unbounded One-Way Trading (Q5251632) (← links)
- Separating NE from Some Nonuniform Nondeterministic Complexity Classes (Q5323096) (← links)
- Optimal Data Retrieval Scheduling in the Multichannel Wireless Broadcast Environments (Q5369887) (← links)
- On the Complexity of Approximate Sum of Sorted List (Q5405940) (← links)
- Sublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem (Q5434395) (← links)
- The Approximability of the Exemplar Breakpoint Distance Problem (Q5434407) (← links)
- An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem (Q5434450) (← links)
- Theory and Application of Width Bounded Geometric Separator (Q5449806) (← links)
- Automata, Languages and Programming (Q5466500) (← links)
- (Q5469769) (← links)
- Separating Sublinear Time Computations by Approximate Diameter (Q5505645) (← links)
- On Recovering Syntenic Blocks from Comparative Maps (Q5505670) (← links)
- Algorithms and Computation (Q5712132) (← links)
- Computing and Combinatorics (Q5716969) (← links)