Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations
Quantum Neural Networks
Tight Lower Bounds on the Size of Sweeping Automata
Logic over Words on Denumerable Ordinals
Distance Realization Problems with Applications to Internet Tomography
Spectral Methods for Matrix Rigidity with Applications to Size–Depth Trade-offs and Communication Complexity
Low Complexity Variants of the Arrow Distributed Directory
A Polynomial-time Algorithm for the Bistable Roommates Problem
A Slight Sharpening of LMN
Papers to Appear in Forthcoming Issues