In this work we study optimal coding strategies for bidirectional relaying under the condition of arbitrarily varying channels. We consider a three-node network where a relay node ...
Rafael F. Wyrembelski, Igor Bjelakovic, Holger Boc...
We present a linear time and space suffix array (SA) construction algorithm called the SA-IS algorithm. The SA-IS algorithm is novel because of the LMS-substrings used for the pro...
Construction operations are often repetitive not only in terms of time (the same tasks are performed over and over) but also in terms of space (the same tasks are repeated at seve...
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
Abstract—In order to increase their stealth, malware commonly use the self-modification property of programs. By doing so, programs can hide their real code so that it is diffi...
Guillaume Bonfante, Jean-Yves Marion, Daniel Reyna...