Learning via Queries.
Sparse Dynamic Programming II: Convex and Concave Cost Functions.
Sparse Dynamic Programming I: Linear Cost Functions.
On Pointers versus Addresses.
The Pagenumber of Genus g Graphs is O(g).
Monotone Circuits for Matching Require Linear Depth.
How Fair is Fair Queuing?
The Membership Problem in Aperiodic Transformation Monoids.
An Efficient Algorithm for a Task Allocation Problem.
A Little Knowledge Goes a Long Way: Knowledge-Based Derivations and Correctness Proofs for a Family of Protocols.
Reasoning about Systems with Many Processes.