On the Treewidth of Dynamic Graphs
On the Usefulness of Predicates
On the Weak Computability of Continuous Real Functions
On tiered small jump operators
On Time-Bounded Incompressibility of Compressible Strings and Sequences
On tractability and congruence distributivity
On Tractable Exponential Sums
On Unique Games with Negative Weights
On Universality in Real Computation
On Weak Odd Domination and Graph-based Quantum Secret Sharing
One-in-Two-Matching Problem is NP-complete
One-way communication complexity and the Neciporuk lower bound on formula size
One-Way Functions in Worst-Case Cryptography: Algebraic and Security Properties
Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets
Open Questions in the Theory of Semifeasible Computation
Optimal accessing and non-accessing structures for graph protocols
Optimal bounds for sign-representing the intersection of two halfspaces by polynomials
Optimal Lower Bounds for Projective List Update Algorithms
Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems
Oracle Complexity and Nontransitivity in Pattern Recognition