Erratum: a counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution.
Automated complexity analysis based on ordered resolution.
Lattice computers for approximating Euclidean space.
Dynamic planar convex hull operations in near-logarithmaic amortized time.
Universal-stability results and performance bounds for greedy contention-resolution protocols.
Adversarial queuing theory.