The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sergio De Agostino: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Piera Barcaccia, Antonella Cresti, Sergio De Agostino
    Pattern Matching in Text Compressed with the ID Heuristic. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1998, pp:113-118 [Conf]
  2. Sergio De Agostino
    Work-Optimal Parallel Decoders for LZ2 Data Compression. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2000, pp:393-399 [Conf]
  3. Sergio De Agostino
    Almost Work-Optimal PRAM EREW Decoders of LZ Compressed Text. [Citation Graph (0, 0)][DBLP]
    DCC, 2003, pp:422- [Conf]
  4. Sergio De Agostino
    Bounded Size Dictionary Compression: Relaxing the LRU Deletion Heuristic. [Citation Graph (0, 0)][DBLP]
    DCC, 2005, pp:456- [Conf]
  5. Sergio De Agostino
    Lossless Image Compression by Block Matching on a Mesh of Trees. [Citation Graph (0, 0)][DBLP]
    DCC, 2006, pp:443- [Conf]
  6. Sergio De Agostino, James A. Storer
    Parallel Algorithms for Optimal Compression Using Dictionaries with the Prefix Property. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1992, pp:52-61 [Conf]
  7. D. Belinskaya, Sergio De Agostino, James A. Storer
    Near Optimal Compression with Respect to a Static Dictionary on a Practical Massively Parallel Architecture. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1995, pp:172-181 [Conf]
  8. Luigi Cinque, Eernesto Grande, Sergio De Agostino
    LZ1 Compression of Binary Images Using a Simple Rectangle Greedy Matching Technique. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2001, pp:492- [Conf]
  9. Luigi Cinque, Franco Liberati, Sergio De Agostino
    A Simple Lossless Compression Heuristic for RGB Images. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2004, pp:533- [Conf]
  10. Luigi Cinque, Sergio De Agostino, Franco Liberati
    A Parallel Algorithm for Lossless Image Compression by Block Matching. [Citation Graph (0, 0)][DBLP]
    DCC, 2002, pp:450- [Conf]
  11. Luigi Cinque, Sergio De Agostino
    A Parallel Decoder for Lossless Image Compression by Block Matching. [Citation Graph (0, 0)][DBLP]
    DCC, 2007, pp:183-192 [Conf]
  12. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:132-141 [Conf]
  13. Sergio De Agostino
    Speeding up Parallel Decoding of LZ Compressed Text on the PRAM EREW. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2000, pp:2-7 [Conf]
  14. Sergio De Agostino, Riccardo Silvestri
    Bounded Size Dictionary Compression: SCk-Completeness and NC Algorithms. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:522-532 [Conf]
  15. Luigi Cinque, Sergio De Agostino, Franco Liberati, Bart J. Westgeest
    A Simple Lossless Compression Heuristic for Grey Scale Images. [Citation Graph (0, 0)][DBLP]
    Stringology, 2004, pp:48-55 [Conf]
  16. Sergio De Agostino, Rossella Petreschi, Andrea Sterbini
    An O(n³) Recognition Algorithm for Bithreshold Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:4, pp:416-425 [Journal]
  17. Pierluigi Crescenzi, Sergio De Agostino, Riccardo Silvestri
    A note on the spatiality degree of graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:63, n:, pp:- [Journal]
  18. Sergio De Agostino, Riccardo Silvestri
    Bounded size dictionary compression: SCk-completeness and NC algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:180, n:2, pp:101-112 [Journal]
  19. Sergio De Agostino, Riccardo Silvestri
    A Worst-Case Analysis of the LZ2 Compression Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:139, n:2, pp:258-268 [Journal]
  20. Sergio De Agostino, Rossella Petreschi
    Parallel Recognition Algorithms for Graphs with Restricted Neighbourhoods. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1990, v:1, n:2, pp:123-130 [Journal]
  21. Sergio De Agostino, Rossella Petreschi
    On PVchunk Operations and Matrogenic Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1992, v:3, n:1, pp:11-20 [Journal]
  22. Luigi Cinque, Sergio De Agostino, Franco Liberati, Bart J. Westgeest
    A simple lossless compression heuristic for grey scale images. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1111-1119 [Journal]
  23. Sergio De Agostino
    Bounded Size Dictionary Compression: Relaxing the Lru Deletion Heuristic. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1273-1280 [Journal]
  24. Sergio De Agostino, James A. Storer
    On-Line Versus Off-Line Computation in Dynamic Text Compression. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:3, pp:169-174 [Journal]
  25. Daniel P. Bovet, Sergio De Agostino, Rossella Petreschi
    Parallelism and the Feedback Vertex Set Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:28, n:2, pp:81-85 [Journal]
  26. Sergio De Agostino
    Parallelism and dictionary based data compression. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2001, v:135, n:1-2, pp:43-56 [Journal]
  27. Luigi Cinque, Sergio De Agostino, Franco Liberati
    A Work-Optimal Parallel Implementation of Lossless Image Compression by Block Matching. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2003, v:10, n:1, pp:13-20 [Journal]
  28. Sergio De Agostino
    A Parallel Decoding Algorithm for LZ2 Data Compression. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1995, v:21, n:12, pp:1957-1961 [Journal]
  29. Sergio De Agostino
    Almost work-optimal pram erew decoders of LZ compressed text. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2004, v:14, n:3-4, pp:351-359 [Journal]
  30. Gian Carlo Bongiovanni, Pierluigi Crescenzi, Sergio De Agostino
    Max Sat and Min Set Cover Approximation Algorithms are P-Complete. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1995, v:5, n:, pp:293-298 [Journal]
  31. Sergio De Agostino
    Erratum to "P-complete Problems in Data Compression". [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:325-326 [Journal]
  32. Sergio De Agostino
    P-complete Problems in Data Compression. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:127, n:1, pp:181-186 [Journal]
  33. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:205, n:1-2, pp:261-282 [Journal]
  34. Sergio De Agostino
    Bounded size dictionary compression: Relaxing the LRU deletion heuristic. [Citation Graph (0, 0)][DBLP]
    Stringology, 2005, pp:135-142 [Conf]

  35. Practical Parallel Algorithms for Dictionary Data Compression. [Citation Graph (, )][DBLP]


  36. Lossless Image Compression by Block Matching on Practical Massively Parallel Architectures. [Citation Graph (, )][DBLP]


  37. Speeding up Lossless Image Compression: Experimental Results on a Parallel Machine. [Citation Graph (, )][DBLP]


  38. Compressing Bi-Level Images by Block Matching on a Tree Architecture. [Citation Graph (, )][DBLP]


Search in 0.061secs, Finished in 0.062secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002