Authors: ANDREEV AE CLEMENTI A CRESCENZI P DAHLHAUS E DEAGOSTINO S ROLIM JDP

Citation: Ae. Andreev et al., THE PARALLEL COMPLEXITY OF APPROXIMATING THE HIGH-DEGREE SUBGRAPH PROBLEM, Theoretical computer science, 205(1-2), 1998, pp. 261-282

Authors: DEAGOSTINO S SILVESTRI R

Citation: S. Deagostino et R. Silvestri, A WORST-CASE ANALYSIS OF THE LZ2 COMPRESSION ALGORITHM, Information and computation, 139(2), 1997, pp. 258-268

Authors: DEAGOSTINO S PETRESCHI H STERBINI A

Citation: S. Deagostino et al., AN O(N(3)) RECOGNITION ALGORITHM FOR BITHRESHOLD GRAPHS, Algorithmica, 17(4), 1997, pp. 416-425

Authors: DEAGOSTINO S STORER JA

Citation: S. Deagostino et Ja. Storer, ONLINE VERSUS OFF-LINE COMPUTATION IN DYNAMIC TEXT COMPRESSION, Information processing letters, 59(3), 1996, pp. 169-174

Authors: DEAGOSTINO S

Citation: S. Deagostino, A PARALLEL DECODING ALGORITHM FOR LZ2 DATA-COMPRESSION, Parallel computing, 21(12), 1995, pp. 1957-1961

Authors: DEAGOSTINO S

Citation: S. Deagostino, P-COMPLETE PROBLEMS IN DATA-COMPRESSION, Theoretical computer science, 127(1), 1994, pp. 181-186