: Recent Progress in String Algorithms.
: Oracles versus Proof Techniques that Do Not Relativize.
: Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynominals.
Lane A. Hemachandra
: Algorithms from Complexity Theory: Polynominal-Time Operations for Complex Sets.
: Complexity Cores and Hard Problem Instances.
: Computing Puiseux-Series Solutions to Determinantal Equations via Combinatorial Relaxation.
: Simultaneous Solution of Families of Problems.
: On the Complexity of Isometric Embedding in the Hypercube.