ProfessorsProfessors of Università degli Studi di TorinoLuca Roversi

Luca Roversi

Università degli Studi di Torino

H-index: 20

Europe-Italy

About Luca Roversi

Luca Roversi, With an exceptional h-index of 20 and a recent h-index of 10 (since 2020), a distinguished researcher at Università degli Studi di Torino, specializes in the field of Theoretical Computer Science, (Unconvetional) Computational Models, Structural Proof Theory, Computational Complexity.

His recent articles reflect a diverse array of research interests and contributions to the field:

Algorithmically Expressive, Always-Terminating Model for Reversible Computation

Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem

Certifying expressive power and algorithms of reversible primitive permutations with Lean

" Termination of Rewriting on Reversible Boolean Circuits as a free 3-Category problem" Adriano Barile, Stefano Berardi and Luca Roversi ICTCS 2023 24th Italian Conference on …

Certifying algorithms and relevant properties of Reversible Primitive Permutations with Lean

UN ASSETTO MOODLE PER L’ESAME ONLINE DI UN CORSO DI PROGRAMMAZIONE

Splitting recursion schemes into reversible and classical interacting threads

Interleaving classical and reversible

Luca Roversi Information

University	Università degli Studi di Torino
Position	Professor of Computer Science
Citations(all)	1397
Citations(since 2020)	246
Cited By	712
hIndex(all)	20
hIndex(since 2020)	10
i10Index(all)	37
i10Index(since 2020)	10
Email	Access Email
University Profile Page	Università degli Studi di Torino
Google Scholar	View Google Scholar Profile

Luca Roversi Skills & Research Interests

Theoretical Computer Science

(Unconvetional) Computational Models

Structural Proof Theory

Computational Complexity

Top articles of Luca Roversi

Title	Journal	Author(s)	Publication Date
Algorithmically Expressive, Always-Terminating Model for Reversible Computation	arXiv preprint arXiv:2402.19012	Matteo Palazzo Luca Roversi	2024/2/29
Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem	arXiv preprint arXiv:2401.02091	Adriano Barile Stefano Berardi Luca Roversi	2024/1/4
Certifying expressive power and algorithms of reversible primitive permutations with Lean	Journal of Logical and Algebraic Methods in Programming	Giacomo Maletto Luca Roversi	2024/1/1
" Termination of Rewriting on Reversible Boolean Circuits as a free 3-Category problem" Adriano Barile, Stefano Berardi and Luca Roversi ICTCS 2023 24th Italian Conference on …	LECTURE NOTES IN NETWORKS AND SYSTEMS	Adriano Barile Stefano Berardi Luca Roversi	2023
Certifying algorithms and relevant properties of Reversible Primitive Permutations with Lean		Giacomo Maletto Luca Roversi	2022/6/28
UN ASSETTO MOODLE PER L’ESAME ONLINE DI UN CORSO DI PROGRAMMAZIONE		Felice Cardone Sergio Rabellino Luca Roversi	2022
Splitting recursion schemes into reversible and classical interacting threads		Armando B Matos Luca Paolini Luca Roversi	2021/6/23
Interleaving classical and reversible	arXiv preprint arXiv:2102.09436	Armando B Matos Luca Paolini Luca Roversi	2021/2/18
Probabilistic Soft Type Assignment	arXiv preprint arXiv:2007.01733	Gianluca Curzi Luca Roversi	2020/7/3
A class of recursive permutations which is primitive recursive complete	Theoretical Computer Science	Luca Paolini Mauro Piccolo Luca Roversi	2020/4/12
The fixed point problem of a simple reversible language	Theoretical Computer Science	Armando B Matos Luca Paolini Luca Roversi	2020/4/12
On the expressivity of total reversible programming languages		Armando B Matos Luca Paolini Luca Roversi	2020
A type-assignment of linear erasure and duplication	Theoretical Computer Science	Gianluca Curzi Luca Roversi	2020/10/12