|
Search the dblp DataBase
Stanley P. Y. Fung:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Francis Y. L. Chin, Stanley P. Y. Fung
Improved Competitive Algorithms for Online Scheduling with Partial Job Values. [Citation Graph (0, 0)][DBLP] COCOON, 2003, pp:425-434 [Conf]
- Feifeng Zheng, Stanley P. Y. Fung, Wun-Tat Chan, Francis Y. L. Chin, Chung Keung Poon, Prudence W. H. Wong
Improved On-Line Broadcast Scheduling with Deadlines. [Citation Graph (0, 0)][DBLP] COCOON, 2006, pp:320-329 [Conf]
- Stanley P. Y. Fung, Francis Y. L. Chin, Chung Keung Poon
Laxity Helps in Broadcast Scheduling. [Citation Graph (0, 0)][DBLP] ICTCS, 2005, pp:251-264 [Conf]
- Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu
Efficient Algorithms for Finding a Longest Common Increasing Subsequence. [Citation Graph (0, 0)][DBLP] ISAAC, 2005, pp:665-674 [Conf]
- Francis Y. L. Chin, Stanley P. Y. Fung
Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees. [Citation Graph (0, 0)][DBLP] ISAAC, 2001, pp:172-184 [Conf]
- Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang
Approximation for minimum triangulation of convex polyhedra. [Citation Graph (0, 0)][DBLP] SODA, 2001, pp:128-137 [Conf]
- Yair Bartal, Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Ron Lavi, Jiri Sgall, Tomás Tichý
Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs. [Citation Graph (0, 0)][DBLP] STACS, 2004, pp:187-198 [Conf]
- Man-yee Chan, Joseph Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao
Linear-Time Haplotype Inference on Pedigrees Without Recombinations. [Citation Graph (0, 0)][DBLP] WABI, 2006, pp:56-67 [Conf]
- Francis Y. L. Chin, Stanley P. Y. Fung
Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help? [Citation Graph (0, 0)][DBLP] Algorithmica, 2003, v:37, n:3, pp:149-164 [Journal]
- Stanley P. Y. Fung, Francis Y. L. Chin, Chung Keung Poon
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2005, v:32, n:1, pp:1-12 [Journal]
- Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang
Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes. [Citation Graph (0, 0)][DBLP] Discrete & Computational Geometry, 2001, v:26, n:4, pp:499-511 [Journal]
- Stanley P. Y. Fung, Francis Y. L. Chin, Hong Shen
Online scheduling of unit jobs with bounded importance ratio. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:581-598 [Journal]
- Feifeng Zheng, Francis Y. L. Chin, Stanley P. Y. Fung, Chung Keung Poon, Yinfeng Xu
A tight lower bound for job scheduling with cancellation. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:97, n:1, pp:1-3 [Journal]
- Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Jiri Sgall, Tomás Tichý
Online competitive algorithms for maximizing weighted throughput of unit jobs. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2006, v:4, n:2, pp:255-276 [Journal]
- Francis Y. L. Chin, Stanley P. Y. Fung
Improved competitive algorithms for online scheduling with partial job values. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:325, n:3, pp:467-478 [Journal]
- Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zheng
Online Interval Scheduling: Randomized and Multiprocessor Cases. [Citation Graph (0, 0)][DBLP] COCOON, 2007, pp:176-186 [Conf]
- Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu
Efficient algorithms for finding a longest common increasing subsequence. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 2007, v:13, n:3, pp:277-288 [Journal]
Online Preemptive Scheduling with Immediate Decision or Notification and Penalties. [Citation Graph (, )][DBLP]
Temperature Aware Online Scheduling with a Low Cooling Factor. [Citation Graph (, )][DBLP]
Improved Randomized Online Scheduling of Unit Length Intervals and Jobs. [Citation Graph (, )][DBLP]
Bounded Delay Packet Scheduling in a Bounded Buffer [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|