Stanley P. Y. Fung

According to our database1, Stanley P. Y. Fung authored at least 34 papers between 2001 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Online two-way trading: Randomization and advice.
Theor. Comput. Sci., 2021

2019
Optimal Online Two-Way Trading with Bounded Number of Transactions.
Algorithmica, 2019

2017
Temperature aware online algorithms for minimizing flow time.
Theor. Comput. Sci., 2017

2016
Haplotype Inference on Pedigrees Without Recombinations.
Encyclopedia of Algorithms, 2016

2015
Maximizing Throughput in Energy-Harvesting Sensor Nodes.
Proceedings of the Algorithms for Sensor Systems, 2015

2014
Temperature aware online scheduling for throughput maximisation: The effect of the cooling factor.
Sustain. Comput. Informatics Syst., 2014

Online scheduling with preemption or non-completion penalties.
J. Sched., 2014

Improved Randomized Online Scheduling of Intervals and Jobs.
Theory Comput. Syst., 2014

Online Scheduling of Unit Length Jobs with Commitment and Penalties.
Proceedings of the Theoretical Computer Science, 2014

2013
Temperature aware online algorithms for scheduling equal length jobs.
Theor. Comput. Sci., 2013

Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints.
J. Comb. Optim., 2013

2012
On-line scheduling of equal-length intervals on parallel machines.
Inf. Process. Lett., 2012

2010
Bounded delay packet scheduling in a bounded buffer.
Oper. Res. Lett., 2010

Temperature Aware Online Scheduling with a Low Cooling Factor.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Online Preemptive Scheduling with Immediate Decision or Notification and Penalties.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009
Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops.
SIAM J. Comput., 2009

2008
Improved on-line broadcast scheduling with deadlines.
J. Sched., 2008

Online interval scheduling: randomized and multiprocessor cases.
J. Comb. Optim., 2008

Lower bounds on online deadline scheduling with preemption penalties.
Inf. Process. Lett., 2008

Improved Randomized Online Scheduling of Unit Length Intervals and Jobs.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

2007
Approximation Algorithms for Some Optimal 2D and 3D Triangulations.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Efficient algorithms for finding a longest common increasing subsequence.
J. Comb. Optim., 2007

2006
Online competitive algorithms for maximizing weighted throughput of unit jobs.
J. Discrete Algorithms, 2006

A tight lower bound for job scheduling with cancellation.
Inf. Process. Lett., 2006

Linear-Time Haplotype Inference on Pedigrees Without Recombinations.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

2005
Online scheduling of unit jobs with bounded importance ratio.
Int. J. Found. Comput. Sci., 2005

Approximating the minimum triangulation of convex 3-polytopes with bounded degrees.
Comput. Geom., 2005

Laxity Helps in Broadcast Scheduling.
Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2004
Improved competitive algorithms for online scheduling with partial job values.
Theor. Comput. Sci., 2004

Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs.
Proceedings of the STACS 2004, 2004

2003
Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?
Algorithmica, 2003

2001
Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes.
Discret. Comput. Geom., 2001

Approximation for minimum triangulation of convex polyhedra.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001


  Loading...