Skip to content

Author

P. Ferragina

We have 7 of 443 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

#diffusion models Book Open access Nov 2026

Learn to Compress or Compress to Learn? Shannon and Turing meet again in the LLM era

The year 1948 gave birth to two transformative pillars of modern computing: Claude Shannon's information theory, which gave rise to data compression, and Alan Turing's writings on intelligent machinery, which ignited the field of artificial intelligence. Today, nearly eight decades later, we are witnessing a profound h...

P. Ferragina · 0 citations
Jul 2026

Extended Depth-First Representations of k2-trees

It is demonstrated that depth-first layouts of $k^2$-trees provide a practical and efficient alternative to traditional layouts, improving both compression and computational performance in matrix operations.

Gabriel Carmona, P. Ferragina, Giovanni Manzini et al. · 0 citations
#natural language process... Preprint Sep 2026

CodeGraph: Open-Taxonomy Knowledge Graph for Source Code with Wikidata Grounding

A pipeline for building an open-taxonomy semantic annotation of source code using a code-specialised Large Language Model, and a calibrated quality-assurance protocol that quantifies annotation precision by combining a small human gold set with an LLM-as-a-judge filter are presented.

Federico Pennino, Andrea Gurioli, Stefano Zacchiroli et al. · 1 citation
Conference Open access 2026

Oblivious Complex Queries on Variable-Length Strings

A practical design that combines Ring ORAM to hide access patterns to outsourced data, with a Patricia trie for space-efficient search over variable-length strings to support search over variable-length string datasets in an ORAM scenario, while retaining efficient storage and access both on the client and the server i...

Mariagiovanna Rotundo, Giuseppe Persiano, P. Ferragina · 0 citations
Conference Open access 2026

Achieving Obliviousness in Compressed Data Structures

The first oblivious implementations of Rank and Select that require only a single ORAM access per operation, use O(1) client-side space, and add negligible client computation overhead are presented.

Mariagiovanna Rotundo, P. Ferragina · 0 citations
Preprint Aug 2026

Diffuse to Compress: Leveraging Diffusion LMs for Lossless Compression

It is argued that replacing autoregressive LLMs with DLMs within the same compression framework could overcome the throughput bottleneck caused by their one-symbol-per-step limitation, and the newly proposed DLM-based framework advances the state of the art in lossless text compression.

Angelo Nardone, P. Ferragina · 0 citations

LLM-based Source Code Compression via Thresholded Symbol Ranking

This work introduces LLM-based compressors deploying two novel symbol-ranking variants that bound predictions to the top-$T$ ranks, and conducts the first large-scale evaluation of LLM-based source code compression across 30 LLMs, including general-domain, code-specialized, and quantized models.

Angelo Nardone, P. Ferragina · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.