Learn More
—We present in this paper two efficient algorithms for linear time suffix array construction. These two algorithms archive their linear time complexities using the techniques of divide-and-conquer and recursion. What distinguish the proposed algorithms from other linear time suffix array construction algorithms (SACAs) are the variable-length leftmost(More)
Semiquantum key distribution allows a quantum party to share a random key with a "classical" party who only can prepare and measure qubits in the computational basis or reorder some qubits when he has access to a quantum channel. In this work, we present a protocol where a secret key can be established between a quantum user and an almost classical user who(More)
We present a new suffix array construction algorithm that aims to build, in external memory, the suffix array for an input string of length <i>n</i> measured in the magnitude of tens of Giga characters over a constant or integer alphabet. The core of this algorithm is adapted from the framework of the original internal memory SA-DS algorithm that samples(More)