NP Trees and Carnap's Modal Logic.
On the Average Communication Complexity of Asynchronous Distributed Algorithms.
Las Vegas Algorithms for Linear and Integer Programming when the Dimension is Small.
Three Logics for Branching Bisimulation.
The Isomorphism Conjecture Fails Relative to a Random Oracle.
Provably Correct Theories of Action.
Nearly Optimal Algorithms and Bounds for Multilayer Channel Routing.
Decomposition of Magic Rewriting.
A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees.