A measure & conquer approach for the analysis of exact algorithms.
On approximating the ideal random access machine by physical machines.
On the expressiveness and complexity of randomization in finite state monitors.
A unified approach to scheduling on unrelated parallel machines.