Observability of Turing Machines: a Refinement of the Theory of Computation
Observation of implicit complexity by non confluence
Ogden's Lemma for Regular Tree Languages
On "P = NP: Linear Programming Formulation of the Traveling Salesman Problem": A reply to Hofman's Claim of a "Counter-Example"
On a new complete invariant of acyclic graphs
On a New Type of Information Processing for Efficient Management of Complex Systems
On a variant of Monotone NAE-3SAT and the Triangle-Free Cut problem
On acceptance conditions for membrane systems: characterisations of L and NL
On Approximability of Block Sorting
On Approximating Four Covering and Packing Problems
On Approximating Restricted Cycle Covers
On Approximation Lower Bounds for TSP with Bounded Metrics
On Arthur Merlin Games in Communication Complexity
On Bounded Integer Programming
On Canonical Forms of Complete Problems via First-order Projections
On Complexity of Isoperimetric Problems on Trees
On Computational Power of Quantum Read-Once Branching Programs
On computing fixed points for generalized sandpiles
On Computing the Shadows and Slices of Polytopes
On Exact Algorithms for Permutation CSP