![](https://www.dpmms.cam.ac.uk/files/styles/portrait/public/portraits/rrw1.jpg?itok=PNSISNGg)
Professor of Mathematics for Operational Research
Research Interests: Mathematics for operational research and systems, models in telecommunications and operations management, control of queues, stochastic networks, on-line bin-packing, ergodicity of markov processes, optimal search, stochastic scheduling, dynamic resource allocation, financial mathematics
Publications
Optimal Scheduling of Peer-to-Peer File Dissemination
– CoRR
(2006)
abs/cs/0606110,
On the sum-of-squares algorithm for bin packing
– Proceedings of the thirty-second annual ACM symposium on Theory of computing
(2000)
208
(doi: 10.1145/335305.335331)
Bin packing with discrete item sizes, part II: Tight bounds on First Fit.
– Random Structures and Algorithms
(2000)
10,
69
A study of simple usage-based charging schemes for broadband networks
– Telecommunication Systems
(2000)
15,
323
(doi: 10.1023/A:1019103214455)
Measurement-Based Usage Charges in Communications Networks
– Operations Research
(2000)
48,
535
(doi: 10.1287/opre.48.4.535.12424)
Monotone optimal policies for left-skip-free Markov decision processes
(1999)
19,
191
A Self Organizing Bin Packing Heuristic.
– ALGORITHM ENGINEERING AND EXPERIMENTATION
(1999)
1619,
246
Models and algorithms for planning and scheduling problems: Cambridge Workshop
(1999)
Optimal robot scheduling for web search engines
– Journal of Scheduling
(1998)
1,
15
- <
- 5 of 8