default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStanley P. Y. Fung
Person information
- affiliation: University of Leicester, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j22]Stanley P. Y. Fung
:
Online two-way trading: Randomization and advice. Theor. Comput. Sci. 856: 41-50 (2021)- [i4]Stanley P. Y. Fung:
Is this the simplest (and most surprising) sorting algorithm ever? CoRR abs/2110.01111 (2021)
2010 – 2019
- 2019
- [j21]Stanley P. Y. Fung:
Optimal Online Two-Way Trading with Bounded Number of Transactions. Algorithmica 81(11-12): 4238-4257 (2019) - 2017
- [j20]Martin Birks, Stanley P. Y. Fung:
Temperature aware online algorithms for minimizing flow time. Theor. Comput. Sci. 661: 18-34 (2017) - [c18]Stanley P. Y. Fung:
Optimal Online Two-Way Trading with Bounded Number of Transactions. COCOON 2017: 212-223 - [i3]Stanley P. Y. Fung:
Optimal Online Two-way Trading with Bounded Number of Transactions. CoRR abs/1706.05320 (2017) - 2016
- [r2]Mee Yee Chan, Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao:
Haplotype Inference on Pedigrees Without Recombinations. Encyclopedia of Algorithms 2016: 894-897 - 2015
- [c17]Stanley P. Y. Fung:
Maximizing Throughput in Energy-Harvesting Sensor Nodes. ALGOSENSORS 2015: 129-141 - 2014
- [j19]Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zheng:
Improved Randomized Online Scheduling of Intervals and Jobs. Theory Comput. Syst. 55(1): 202-228 (2014) - [j18]Stanley P. Y. Fung:
Online scheduling with preemption or non-completion penalties. J. Sched. 17(2): 173-183 (2014) - [j17]Martin Birks, Stanley P. Y. Fung:
Temperature aware online scheduling for throughput maximisation: The effect of the cooling factor. Sustain. Comput. Informatics Syst. 4(3): 151-159 (2014) - [c16]Stanley P. Y. Fung:
Online Scheduling of Unit Length Jobs with Commitment and Penalties. IFIP TCS 2014: 54-65 - 2013
- [j16]Martin Birks, Daniel Cole, Stanley P. Y. Fung, Huichao Xue:
Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints. J. Comb. Optim. 26(2): 237-250 (2013) - [j15]Martin Birks, Stanley P. Y. Fung:
Temperature aware online algorithms for scheduling equal length jobs. Theor. Comput. Sci. 508: 54-65 (2013) - [c15]Martin Birks, Stanley P. Y. Fung:
Temperature Aware Online Algorithms for Minimizing Flow Time. TAMC 2013: 20-31 - 2012
- [j14]Stanley P. Y. Fung, Chung Keung Poon, Duncan K. W. Yung:
On-line scheduling of equal-length intervals on parallel machines. Inf. Process. Lett. 112(10): 376-379 (2012) - [i2]Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zheng:
Improved Randomized Online Scheduling of Intervals and Jobs. CoRR abs/1204.2933 (2012) - 2011
- [c14]Martin Birks, Daniel Cole, Stanley P. Y. Fung, Huichao Xue:
Online Algorithms for Maximizing Weighted Throughput of Unit Jobs with Temperature Constraints. FAW-AAIM 2011: 319-329 - [c13]Martin Birks, Stanley P. Y. Fung:
Temperature Aware Online Algorithms for Scheduling Equal Length Jobs. FAW-AAIM 2011: 330-342 - 2010
- [j13]Stanley P. Y. Fung:
Bounded delay packet scheduling in a bounded buffer. Oper. Res. Lett. 38(5): 396-398 (2010) - [c12]Stanley P. Y. Fung:
Online Preemptive Scheduling with Immediate Decision or Notification and Penalties. COCOON 2010: 389-398 - [c11]Martin Birks, Stanley P. Y. Fung:
Temperature Aware Online Scheduling with a Low Cooling Factor. TAMC 2010: 105-116
2000 – 2009
- 2009
- [j12]Mee Yee Chan, Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao:
Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops. SIAM J. Comput. 38(6): 2179-2197 (2009) - [i1]Stanley P. Y. Fung:
Bounded Delay Packet Scheduling in a Bounded Buffer. CoRR abs/0907.2741 (2009) - 2008
- [j11]Stanley P. Y. Fung:
Lower bounds on online deadline scheduling with preemption penalties. Inf. Process. Lett. 108(4): 214-218 (2008) - [j10]Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zheng:
Online interval scheduling: randomized and multiprocessor cases. J. Comb. Optim. 16(3): 248-262 (2008) - [j9]Stanley P. Y. Fung, Feifeng Zheng, Wun-Tat Chan, Francis Y. L. Chin, Chung Keung Poon, Prudence W. H. Wong:
Improved on-line broadcast scheduling with deadlines. J. Sched. 11(4): 299-308 (2008) - [c10]Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zheng:
Improved Randomized Online Scheduling of Unit Length Intervals and Jobs. WAOA 2008: 53-66 - 2007
- [j8]Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu:
Efficient algorithms for finding a longest common increasing subsequence. J. Comb. Optim. 13(3): 277-288 (2007) - [c9]Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zheng:
Online Interval Scheduling: Randomized and Multiprocessor Cases. COCOON 2007: 176-186 - [r1]Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang:
Approximation Algorithms for Some Optimal 2D and 3D Triangulations. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j7]Feifeng Zheng, Francis Y. L. Chin, Stanley P. Y. Fung, Chung Keung Poon, Yinfeng Xu:
A tight lower bound for job scheduling with cancellation. Inf. Process. Lett. 97(1): 1-3 (2006) - [j6]Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Jirí Sgall, Tomás Tichý:
Online competitive algorithms for maximizing weighted throughput of unit jobs. J. Discrete Algorithms 4(2): 255-276 (2006) - [c8]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. COCOON 2006: 320-329 - [c7]Bethany 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. WABI 2006: 56-67 - 2005
- [j5]Stanley P. Y. Fung, Francis Y. L. Chin, Chung Keung Poon:
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees. Comput. Geom. 32(1): 1-12 (2005) - [j4]Stanley P. Y. Fung, Francis Y. L. Chin, Hong Shen:
Online scheduling of unit jobs with bounded importance ratio. Int. J. Found. Comput. Sci. 16(3): 581-598 (2005) - [c6]Stanley P. Y. Fung, Francis Y. L. Chin, Chung Keung Poon:
Laxity Helps in Broadcast Scheduling. ICTCS 2005: 251-264 - [c5]Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Deshi Ye, Hong Zhu:
Efficient Algorithms for Finding a Longest Common Increasing Subsequence. ISAAC 2005: 665-674 - 2004
- [j3]Francis Y. L. Chin, Stanley P. Y. Fung:
Improved competitive algorithms for online scheduling with partial job values. Theor. Comput. Sci. 325(3): 467-478 (2004) - [c4]Yair Bartal, Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Ron Lavi, Jirí Sgall, Tomás Tichý:
Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs. STACS 2004: 187-198 - 2003
- [j2]Francis Y. L. Chin, Stanley P. Y. Fung:
Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help? Algorithmica 37(3): 149-164 (2003) - [c3]Francis Y. L. Chin, Stanley P. Y. Fung:
Improved Competitive Algorithms for Online Scheduling with Partial Job Values. COCOON 2003: 425-434 - 2001
- [j1]Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang:
Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes. Discret. Comput. Geom. 26(4): 499-511 (2001) - [c2]Francis Y. L. Chin, Stanley P. Y. Fung:
Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees. ISAAC 2001: 172-184 - [c1]Francis Y. L. Chin, Stanley P. Y. Fung, Cao An Wang:
Approximation for minimum triangulation of convex polyhedra. SODA 2001: 128-137
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
