default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergio De Agostino
Person information
- affiliation: Sapienza University of Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Sergio De Agostino:
Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing. Discret. Appl. Math. 342: 200-206 (2024)- 2023
- [c30]Sergio De Agostino:
A Worst Case Analysis of the LZ2 Compression Algorithm with Bounded Size Dictionaries. PSC 2023: 107-113 - 2020
- [c29]Sergio De Agostino:
Greedy versus Optimal Analysis of Bounded Size Dictionary Compression and On-the-Fly Distributed Computing. Stringology 2020: 74-83
2010 – 2019
- 2017
- [j25]Sergio De Agostino
, Bruno Carpentieri, Raffaele Pizzolante:
Concurrent vs. Exclusive Reading in Parallel Decoding of LZ-Compressed Files. Algorithms 10(1): 21 (2017) - [j24]Raffaele Pizzolante, Bruno Carpentieri, Sergio De Agostino:
Adaptive Vector Quantization for Lossy Compression of Image Sequences. Algorithms 10(2): 51 (2017) - 2015
- [j23]Sergio De Agostino:
The greedy approach to dictionary-based static text compression on a distributed system. J. Discrete Algorithms 34: 54-61 (2015) - [c28]Sergio De Agostino:
Approximating dictionary-based optimal data compression on a distributed system. Conf. Computing Frontiers 2015: 44:1-44:2 - 2013
- [j22]Sergio De Agostino:
Weakly split graphs and regular cellulations of the 3-sphere. Ars Comb. 108: 239-247 (2013) - [j21]Luigi Cinque, Sergio De Agostino, Luca Lombardi:
Binary Image Compression via Monochromatic Pattern Substitution: Sequential and Parallel Implementations. Math. Comput. Sci. 7(2): 155-166 (2013) - 2012
- [c27]Sergio De Agostino:
LZW Data Compression on Large Scale and Extreme Distributed Systems. Stringology 2012: 18-27 - 2011
- [j20]Sergio De Agostino:
Lempel-Ziv Data Compression on Parallel and Distributed Systems. Algorithms 4(3): 183-199 (2011) - [c26]Sergio De Agostino:
Lempel-Ziv Data Compression on Parallel and Distributed Systems. CCP 2011: 193-202 - [c25]Luigi Cinque, Sergio De Agostino, Luca Lombardi:
Binary Image Compression via Monochromatic Pattern Substitution: A Sequential Speed-Up. Stringology 2011: 220-225 - 2010
- [j19]Luigi Cinque, Sergio De Agostino, Luca Lombardi:
Scalability and Communication in Parallel Low-Complexity Lossless Compression. Math. Comput. Sci. 3(4): 391-406 (2010) - [c24]Luigi Cinque, Sergio De Agostino, Luca Lombardi:
Binary Image Compression via Monochromatic Pattern Substitution: Effectiveness and Scalability. Stringology 2010: 103-115
2000 – 2009
- 2009
- [c23]Luigi Cinque, Sergio De Agostino, Luca Lombardi:
Practical Parallel Algorithms for Dictionary Data Compression. DCC 2009: 441 - [c22]Sergio De Agostino:
Compressing Bi-Level Images by Block Matching on a Tree Architecture. Stringology 2009: 137-145 - 2008
- [c21]Luigi Cinque, Sergio De Agostino:
Lossless Image Compression by Block Matching on Practical Massively Parallel Architectures. Stringology 2008: 26-34 - [c20]Luigi Cinque, Sergio De Agostino, Luca Lombardi:
Speeding up Lossless Image Compression: Experimental Results on a Parallel Machine. Stringology 2008: 35-45 - 2007
- [c19]Luigi Cinque, Sergio De Agostino:
A Parallel Decoder for Lossless Image Compression by Block Matching. DCC 2007: 183-192 - 2006
- [j18]Sergio De Agostino:
Bounded Size Dictionary Compression: Relaxing the Lru Deletion Heuristic. Int. J. Found. Comput. Sci. 17(6): 1273-1280 (2006) - [c18]Sergio De Agostino:
Lossless Image Compression by Block Matching on a Mesh of Trees. DCC 2006: 443 - 2005
- [j17]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) - [c17]Sergio De Agostino:
Bounded Size Dictionary Compression: Relaxing the LRU Deletion Heuristic. DCC 2005: 456 - [c16]Ray R. Hashemi, Mahmood Bahar, Sergio De Agostino:
An extended self-organizing map (ESOM) for hierarchical clustering. SMC 2005: 2856-2860 - [c15]Sergio De Agostino:
Bounded size dictionary compression: Relaxing the LRU deletion heuristic. Stringology 2005: 135-142 - 2004
- [j16]Sergio De Agostino:
Almost work-optimal pram erew decoders of LZ compressed text. Parallel Process. Lett. 14(3-4): 351-359 (2004) - [c14]Luigi Cinque, Franco Liberati, Sergio De Agostino:
A Simple Lossless Compression Heuristic for RGB Images. Data Compression Conference 2004: 533 - [c13]Luigi Cinque, Sergio De Agostino, Franco Liberati, Bart J. Westgeest:
A Simple Lossless Compression Heuristic for Grey Scale Images. Stringology 2004: 48-55 - 2003
- [j15]Sergio De Agostino, Riccardo Silvestri:
Bounded size dictionary compression: SCk-completeness and NC algorithms. Inf. Comput. 180(2): 101-112 (2003) - [j14]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) - [c12]Sergio De Agostino:
Almost Work-Optimal PRAM EREW Decoders of LZ Compressed Text. DCC 2003: 422 - 2002
- [j13]Pierluigi Crescenzi, Sergio De Agostino, Riccardo Silvestri:
A note on the spatiality degree of graphs. Ars Comb. 63 (2002) - [c11]Luigi Cinque, Sergio De Agostino, Franco Liberati:
A Parallel Algorithm for Lossless Image Compression by Block Matching. DCC 2002: 450 - [c10]Sergio De Agostino:
A Work-Optimal Parallel Implementation of Lossless Image Compression by Block Matching. Stringology 2002: 1-8 - 2001
- [j12]Sergio De Agostino:
Parallelism and dictionary based data compression. Inf. Sci. 135(1-2): 43-56 (2001) - [c9]Luigi Cinque, Eernesto Grande, Sergio De Agostino:
LZ1 Compression of Binary Images Using a Simple Rectangle Greedy Matching Technique. Data Compression Conference 2001: 492 - 2000
- [j11]Sergio De Agostino:
Erratum to "P-complete Problems in Data Compression". Theor. Comput. Sci. 234(1-2): 325-326 (2000) - [c8]Sergio De Agostino:
Work-Optimal Parallel Decoders for LZ2 Data Compression. Data Compression Conference 2000: 393-399 - [c7]Sergio De Agostino:
Speeding up Parallel Decoding of LZ Compressed Text on the PRAM EREW. SPIRE 2000: 2-7
1990 – 1999
- 1998
- [j10]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) - [c6]Piera Barcaccia, Antonella Cresti, Sergio De Agostino:
Pattern Matching in Text Compressed with the ID Heuristic. Data Compression Conference 1998: 113-118 - [c5]Sergio De Agostino, Riccardo Silvestri:
Bounded Size Dictionary Compression: SCk-Completeness and NC Algorithms. STACS 1998: 522-532 - 1997
- [j9]Sergio De Agostino, Rossella Petreschi, Andrea Sterbini:
An O(n³) Recognition Algorithm for Bithreshold Graphs. Algorithmica 17(4): 416-425 (1997) - [j8]Sergio De Agostino, Riccardo Silvestri:
A Worst-Case Analysis of the LZ2 Compression Algorithm. Inf. Comput. 139(2): 258-268 (1997) - [c4]Sergio De Agostino:
A parallel decoder for LZ2 compression using the ID update heuristic. SEQUENCES 1997: 368-373 - 1996
- [j7]Sergio De Agostino, James A. Storer:
On-Line Versus Off-Line Computation in Dynamic Text Compression. Inf. Process. Lett. 59(3): 169-174 (1996) - 1995
- [j6]Sergio De Agostino:
A Parallel Decoding Algorithm for LZ2 Data Compression. Parallel Comput. 21(12): 1957-1961 (1995) - [j5]Gian Carlo Bongiovanni, Pierluigi Crescenzi, Sergio De Agostino:
Max Sat and Min Set Cover Approximation Algorithms are P-Complete. Parallel Process. Lett. 5: 293-298 (1995) - [c3]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 - [c2]Alexander E. Andreev, Andrea 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 - 1994
- [j4]Sergio De Agostino:
P-complete Problems in Data Compression. Theor. Comput. Sci. 127(1): 181-186 (1994) - 1992
- [j3]Sergio De Agostino, Rossella Petreschi:
On PVchunk Operations and Matrogenic Graphs. Int. J. Found. Comput. Sci. 3(1): 11-20 (1992) - [c1]Sergio De Agostino, James A. Storer:
Parallel Algorithms for Optimal Compression Using Dictionaries with the Prefix Property. Data Compression Conference 1992: 52-61 - 1990
- [j2]Sergio De Agostino, Rossella Petreschi:
Parallel Recognition Algorithms for Graphs with Restricted Neighbourhoods. Int. J. Found. Comput. Sci. 1(2): 123-130 (1990)
1980 – 1989
- 1988
- [j1]Daniel P. Bovet, Sergio De Agostino, Rossella Petreschi:
Parallelism and the Feedback Vertex Set Problem. Inf. Process. Lett. 28(2): 81-85 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
