We present the first o(n)-space polynomial-time algorithm for computing length of a longest common subsequence. Given two strings n, runs in O(n3) time with O(nlog1.5?n2log?n) bits space.

Abstract In this paper we devise a generative random network model with core–periphery properties whose core nodes act as sublinear dominators , that is, if the has n nodes, size o ( ) and dominates entire network. We show instances generated by exhibit power law degree distributions, incorporates small-world phenomena. also fit our in variety of real-world networks.

We provide a version of Korovkin-type theorems for monotone sublinear operators in vector lattices
 and discuss the possibilities further extensions generalizations. 
 .