Luca Versari

Orcid: 0000-0003-3495-1325

According to our database1, Luca Versari authored at least 31 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Users prefer Jpegli over same-sized libjpeg-turbo or MozJPEG.
CoRR, 2024

2023
Language Model Beats Diffusion - Tokenizer is Key to Visual Generation.
CoRR, 2023

High-Fidelity Image Compression with Score-based Generative Models.
CoRR, 2023

2022
Temporal Coding in Spiking Neural Networks With Alpha Synaptic Function: Learning With Backpropagation.
IEEE Trans. Neural Networks Learn. Syst., 2022

Proximity Search for Maximal Subgraph Enumeration.
SIAM J. Comput., 2022

2021
Compression Techniques for Large Graphs: Theory and Practice.
PhD thesis, 2021

Recursively Fertile Self-replicating Neural Agents.
Proceedings of the 2021 Conference on Artificial Life, 2021

2020
Efficient Estimation of Graph Trussness.
CoRR, 2020

Intelligent Matrix Exponentiation.
CoRR, 2020

Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs.
Algorithmica, 2020

Zuckerli: A New Compressed Representation for Graphs.
IEEE Access, 2020

Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs.
IEEE Access, 2020

Temporal Coding in Spiking Neural Networks with Alpha Synaptic Function.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

2019
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties.
SIAM J. Discret. Math., 2019

A fast discovery algorithm for large common connected induced subgraphs.
Discret. Appl. Math., 2019

Committee Draft of JPEG XL Image Coding System.
CoRR, 2019

2018
Listing Maximal Subgraphs in Strongly Accessible Set Systems.
CoRR, 2018

Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Listing Subgraphs by Cartesian Decomposition.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Efficient Algorithms for Listing k Disjoint st-Paths in Graphs.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes.
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2018

Learning Analytics in Competitive Programming Training Systems.
Proceedings of the 22nd International Conference Information Visualisation, 2018

Discovering $k$-Trusses in Large-Scale Networks.
Proceedings of the 2018 IEEE High Performance Extreme Computing Conference, 2018

Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
Measuring the clustering effect of BWT via RLE.
Theor. Comput. Sci., 2017

Listing Maximal Independent Sets with Minimal Space and Bounded Delay.
Proceedings of the String Processing and Information Retrieval, 2017

On-Line Pattern Matching on Similar Texts.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

A Fast Algorithm for Large Common Connected Induced Subgraphs.
Proceedings of the Algorithms for Computational Biology, 2017

2016
Directing Road Networks by Listing Strong Orientations.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016


  Loading...