A fast and low-cost comparison-free sorting engine with unary computing: late breaking results

This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP -optimization problems. The emphasis is on proving tight nonapproximability results via consideration of measures ...

In this paper, we propose a novel sorting algorithm that sorts input data integer elements on-the-fly without any comparison operations between the data—comparison-free sorting. We present a complete hardware structure, associated timing diagrams, ...

For a string w, a factorisation is any tuple ( u 1 , u 2 , , u k ) of strings that satisfies w = u 1 u 2 u k . A factorisation is called equality-free if each two factors are different, its size is the number of factors (counting each occurrence of ...