4 citations · 5 across the 2 of their papers we have counts for
4 papers
Is this the simplest (and most surprising) sorting algorithm ever?
Stanley P. Y. Fung
We present an extremely simple sorting algorithm. It may look like it is obviously wrong, but we prove that it is in fact correct. We compare it with other simple sorting algorithm…
Optimal Online Two-way Trading with Bounded Number of Transactions
Stanley P. Y. Fung
We consider a two-way trading problem, where investors buy and sell a stock whose price moves within a certain range. Naturally they want to maximize their profit. Investors can pe…
Improved Randomized Online Scheduling of Intervals and Jobs
Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zheng
We study the online preemptive scheduling of intervals and jobs (with restarts). Each interval or job has an arrival time, a deadline, a length and a weight. The objective is to ma…
Bounded Delay Packet Scheduling in a Bounded Buffer
Stanley P. Y. Fung
We study the problem of buffer management in QoS-enabled network switches in the bounded delay model where each packet is associated with a weight and a deadline. We consider the m…