Sergio De Agostino

Sergio De Agostino: Weakly split graphs and regular cellulations of the 3-sphere. Ars Comb. 108: 239-247 (2013)

Sergio De Agostino: LZW Data Compression on Large Scale and Extreme Distributed Systems. Stringology 2012: 18-27

Sergio De Agostino: Lempel-Ziv Data Compression on Parallel and Distributed Systems. Algorithms 4(3): 183-199 (2011)

Sergio De Agostino: Lempel-Ziv Data Compression on Parallel and Distributed Systems. CCP 2011: 193-202

Luigi Cinque, Sergio De Agostino, Luca Lombardi: Binary Image Compression via Monochromatic Pattern Substitution: A Sequential Speed-Up. Stringology 2011: 220-225

Luigi Cinque, Sergio De Agostino, Luca Lombardi: Scalability and Communication in Parallel Low-Complexity Lossless Compression. Mathematics in Computer Science 3(4): 391-406 (2010)

Luigi Cinque, Sergio De Agostino, Luca Lombardi: Binary Image Compression via Monochromatic Pattern Substitution: Effectiveness and Scalability. Stringology 2010: 103-115

Luigi Cinque, Sergio De Agostino, Luca Lombardi: Practical Parallel Algorithms for Dictionary Data Compression. DCC 2009: 441

Sergio De Agostino: Compressing Bi-Level Images by Block Matching on a Tree Architecture. Stringology 2009: 137-145

Luigi Cinque, Sergio De Agostino: Lossless Image Compression by Block Matching on Practical Massively Parallel Architectures. Stringology 2008: 26-34

Luigi Cinque, Sergio De Agostino, Luca Lombardi: Speeding up Lossless Image Compression: Experimental Results on a Parallel Machine. Stringology 2008: 35-45

Luigi Cinque, Sergio De Agostino: A Parallel Decoder for Lossless Image Compression by Block Matching. DCC 2007: 183-192

Sergio De Agostino: Bounded Size Dictionary Compression: Relaxing the Lru Deletion Heuristic. Int. J. Found. Comput. Sci. 17(6): 1273-1280 (2006)

Sergio De Agostino: Lossless Image Compression by Block Matching on a Mesh of Trees. DCC 2006: 443

Luigi Cinque, Sergio De Agostino, Franco Liberati, Bart J. Westgeest: A simple lossless compression heuristic for grey scale images. Int. J. Found. Comput. Sci. 16(6): 1111-1119 (2005)

Sergio De Agostino: Bounded Size Dictionary Compression: Relaxing the LRU Deletion Heuristic. DCC 2005: 456

Ray R. Hashemi, Mahmood Bahar, Sergio De Agostino: An extended self-organizing map (ESOM) for hierarchical clustering. SMC 2005: 2856-2860

Sergio De Agostino: Bounded size dictionary compression: Relaxing the LRU deletion heuristic. Stringology 2005: 135-142

Sergio De Agostino: Almost work-optimal pram erew decoders of LZ compressed text. Parallel Processing Letters 14(3-4): 351-359 (2004)

Luigi Cinque, Franco Liberati, Sergio De Agostino: A Simple Lossless Compression Heuristic for RGB Images. Data Compression Conference 2004: 533

Luigi Cinque, Sergio De Agostino, Franco Liberati, Bart J. Westgeest: A Simple Lossless Compression Heuristic for Grey Scale Images. Stringology 2004: 48-55

Sergio De Agostino, Riccardo Silvestri: Bounded size dictionary compression: SC^k-completeness and NC algorithms. Inf. Comput. 180(2): 101-112 (2003)

Luigi Cinque, Sergio De Agostino, Franco Liberati: A Work-Optimal Parallel Implementation of Lossless Image Compression by Block Matching. Nord. J. Comput. 10(1): 13-20 (2003)

Sergio De Agostino: Almost Work-Optimal PRAM EREW Decoders of LZ Compressed Text. DCC 2003: 422

Pierluigi Crescenzi, Sergio De Agostino, Riccardo Silvestri: A note on the spatiality degree of graphs. Ars Comb. 63 (2002)

Luigi Cinque, Sergio De Agostino, Franco Liberati: A Parallel Algorithm for Lossless Image Compression by Block Matching. DCC 2002: 450

Sergio De Agostino: A Work-Optimal Parallel Implementation of Lossless Image Compression by Block Matching. Stringology 2002: 1-8

Sergio De Agostino: Parallelism and dictionary based data compression. Inf. Sci. 135(1-2): 43-56 (2001)

Luigi Cinque, Eernesto Grande, Sergio De Agostino: LZ1 Compression of Binary Images Using a Simple Rectangle Greedy Matching Technique. Data Compression Conference 2001: 492

Sergio De Agostino: Erratum to "P-complete Problems in Data Compression". Theor. Comput. Sci. 234(1-2): 325-326 (2000)

Sergio De Agostino: Work-Optimal Parallel Decoders for LZ2 Data Compression. Data Compression Conference 2000: 393-399

Sergio De Agostino: Speeding up Parallel Decoding of LZ Compressed Text on the PRAM EREW. SPIRE 2000: 2-7

Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim: The Parallel Complexity of Approximating the High Degree Subgraph Problem. Theor. Comput. Sci. 205(1-2): 261-282 (1998)

Piera Barcaccia, Antonella Cresti, Sergio De Agostino: Pattern Matching in Text Compressed with the ID Heuristic. Data Compression Conference 1998: 113-118

Sergio De Agostino, Riccardo Silvestri: Bounded Size Dictionary Compression: SC^k-Completeness and NC Algorithms. STACS 1998: 522-532

Sergio De Agostino, Rossella Petreschi, Andrea Sterbini: An O(n³) Recognition Algorithm for Bithreshold Graphs. Algorithmica 17(4): 416-425 (1997)

Sergio De Agostino, Riccardo Silvestri: A Worst-Case Analysis of the LZ2 Compression Algorithm. Inf. Comput. 139(2): 258-268 (1997)

Sergio De Agostino, James A. Storer: On-Line Versus Off-Line Computation in Dynamic Text Compression. Inf. Process. Lett. 59(3): 169-174 (1996)

Sergio De Agostino: A Parallel Decoding Algorithm for LZ2 Data Compression. Parallel Computing 21(12): 1957-1961 (1995)

Gian Carlo Bongiovanni, Pierluigi Crescenzi, Sergio De Agostino: Max Sat and Min Set Cover Approximation Algorithms are P-Complete. Parallel Processing Letters 5: 293-298 (1995)

D. Belinskaya, Sergio De Agostino, James A. Storer: Near Optimal Compression with Respect to a Static Dictionary on a Practical Massively Parallel Architecture. Data Compression Conference 1995: 172-181

Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim: The Parallel Complexity of Approximating the High Degree Subgraph Problem. ISAAC 1995: 132-141

Sergio De Agostino: P-complete Problems in Data Compression. Theor. Comput. Sci. 127(1): 181-186 (1994)

Sergio De Agostino, Rossella Petreschi: On PV_chunk Operations and Matrogenic Graphs. Int. J. Found. Comput. Sci. 3(1): 11-20 (1992)

Sergio De Agostino, James A. Storer: Parallel Algorithms for Optimal Compression Using Dictionaries with the Prefix Property. Data Compression Conference 1992: 52-61

Sergio De Agostino, Rossella Petreschi: Parallel Recognition Algorithms for Graphs with Restricted Neighbourhoods. Int. J. Found. Comput. Sci. 1(2): 123-130 (1990)

Daniel P. Bovet, Sergio De Agostino, Rossella Petreschi: Parallelism and the Feedback Vertex Set Problem. Inf. Process. Lett. 28(2): 81-85 (1988)