Luca Roversi - RankMe

65 papers B 4C 5Misc 1Journal 37Unranked 16

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Exploring Topologies in Quantum Annealing: A Hardware-Aware Perspective. CoRR Mario Bifulco, Luca Roversi
2025	—	`conf`	Exploring an implementation of quantum learning pipeline for support vector machines. BigHPC@ITADATA Mario Bifulco, Luca Roversi
2025	J	`jnl`	Exploring an implementation of quantum learning pipeline for support vector machines. CoRR Mario Bifulco, Luca Roversi
2025	J	`jnl`	Reversible Computation with Stacks and "Reversible Management of Failures". CoRR Matteo Palazzo, Luca Roversi
2025	J	`jnl`	Termination of rewriting on reversible Boolean circuits as a free 3-category problem. Theor. Comput. Sci. Adriano Barile, Stefano Berardi, Luca Roversi
2025	C	`conf`	Towards a Characterization of Two-Way Bijections in a Reversible Computational Model. RC Matteo Palazzo, Luca Roversi
2025	J	`jnl`	Towards a Characterization of Two-way Bijections in a Reversible Computational Model. CoRR Matteo Palazzo, Luca Roversi
2024	C	`conf`	Algorithmically Expressive, Always-Terminating Model for Reversible Computation. RC Matteo Palazzo, Luca Roversi
2024	J	`jnl`	Algorithmically Expressive, Always-Terminating Model for Reversible Computation. CoRR Matteo Palazzo, Luca Roversi
2024	J	`jnl`	Certifying expressive power and algorithms of reversible primitive permutations with Lean. J. Log. Algebraic Methods Program. Giacomo Maletto, Luca Roversi
2024	—	`conf`	Host-Core Calculi for Non-classical Computations: A First Insight. ICTCS Matteo Palazzo, Luca Paolini, Luca Roversi, Margherita Zorzi
2024	—	`ed.`	Proceedings of the 25th Italian Conference on Theoretical Computer Science, Torino, Italy, September 11-13, 2024. ICTCS Ugo de'Liguoro, Matteo Palazzo, Luca Roversi
2024	J	`jnl`	Quantum-Classical Sentiment Analysis. CoRR Mario Bifulco, Luca Roversi
2024	J	`jnl`	Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem. CoRR Adriano Barile, Stefano Berardi, Luca Roversi
2023	—	`conf`	Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem. ICTCS Adriano Barile, Stefano Berardi, Luca Roversi
2022	C	`conf`	Certifying Algorithms and Relevant Properties of Reversible Primitive Permutations with Lean. RC Giacomo Maletto, Luca Roversi
2022	J	`jnl`	Certifying algorithms and relevant properties of Reversible Primitive Permutations with Lean. CoRR Giacomo Maletto, Luca Roversi
2022	J	`jnl`	Programming the Interaction with Quantum Coprocessors. ERCIM News Ferruccio Damiani, Luca Paolini, Luca Roversi
2021	J	`jnl`	Interleaving classical and reversible. CoRR Armando B. Matos, Luca Paolini, Luca Roversi
2021	C	`conf`	Splitting Recursion Schemes into Reversible and Classical Interacting Threads. RC Armando B. Matos, Luca Paolini, Luca Roversi
2021	J	`jnl`	Splitting recursion schemes into reversible and classical interacting threads. CoRR Armando B. Matos, Luca Paolini, Luca Roversi
2020	J	`jnl`	A class of Recursive Permutations which is Primitive Recursive complete. Theor. Comput. Sci. Luca Paolini, Mauro Piccolo, Luca Roversi
2020	J	`jnl`	A type-assignment of linear erasure and duplication. Theor. Comput. Sci. Gianluca Curzi, Luca Roversi
2020	C	`conf`	On the Expressivity of Total Reversible Programming Languages. RC Armando B. Matos, Luca Paolini, Luca Roversi
2020	J	`jnl`	Probabilistic Soft Type Assignment. CoRR Gianluca Curzi, Luca Roversi
2020	J	`jnl`	The fixed point problem of a simple reversible language. Theor. Comput. Sci. Armando B. Matos, Luca Paolini, Luca Roversi
2019	J	`jnl`	A type-assignment of linear erasure and duplication. CoRR Gianluca Curzi, Luca Roversi
2019	J	`jnl`	Introducing Yet Another REversible Language. CoRR Claudio Grandi, Dariush Moshiri, Luca Roversi
2018	J	`jnl`	On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions. New Gener. Comput. Luca Paolini, Mauro Piccolo, Luca Roversi
2018	—	`conf`	Quantum programming made easy. Linearity-TLLA@FLoC Luca Paolini, Luca Roversi, Margherita Zorzi
2018	J	`jnl`	Subatomic systems need not be subatomic. CoRR Luca Roversi
2018	—	`conf`	The Fixed Point Problem for General and for Linear SRL Programs is Undecidable. ICTCS Armando B. Matos, Luca Paolini, Luca Roversi
2016	J	`jnl`	A deep inference system with a self-dual binder which is complete for linear lambda calculus. J. Log. Comput. Luca Roversi
2015	—	`conf`	A Certified Study of a Reversible Programming Language. TYPES Luca Paolini, Mauro Piccolo, Luca Roversi
2015	—	`conf`	A Class of Reversible Primitive Recursive Functions. ICTCS Luca Paolini, Mauro Piccolo, Luca Roversi
2015	J	`jnl`	Light combinators for finite fields arithmetic. Sci. Comput. Program. Daniele Canavese, Emanuele Cesena, Rachid Ouchary, Marco Pedicini, Luca Roversi
2013	—	`conf`	Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion? FOPARA Daniele Canavese, Emanuele Cesena, Rachid Ouchary, Marco Pedicini, Luca Roversi
2012	J	`jnl`	Communication, and concurrency with logic-based restriction inside a calculus of structures CoRR Luca Roversi
2012	J	`jnl`	Extending a system in the calculus of structures with a self-dual quantifier CoRR Luca Roversi
2012	J	`jnl`	Intersection Types from a Proof-theoretic Perspective. Fundam. Informaticae Elaine Pimentel, Simona Ronchi Della Rocca, Luca Roversi
2011	J	`jnl`	A Modular Database Architecture Enabled to Comparative Sequence Analysis. Trans. Large Scale Data Knowl. Centered Syst. Paola Bonfante, Francesca Cordero, Stefano Ghignone, Dino Ienco, Luisa Lanfranco, Giorgio Leonardi, Rosa Meo, Stefania Montani, Luca Roversi, Alessia Visconti
2011	—	`conf`	Linear Lambda Calculus and Deep Inference. TLCA Luca Roversi
2011	J	`jnl`	Typing a Core Binary Field Arithmetic in a Light Logic CoRR Emanuele Cesena, Marco Pedicini, Luca Roversi
2011	—	`conf`	Typing a Core Binary-Field Arithmetic in a Light Logic. FOPARA Emanuele Cesena, Marco Pedicini, Luca Roversi
2010	J	`jnl`	Linear lambda calculus with explicit substitutions as proof-search in Deep Inference CoRR Luca Roversi
2010	—	`conf`	Safe Recursion on Notation into a Light Logic by Levels DICE Luca Roversi, Luca Vercelli
2009	B	`conf`	A By-Level Analysis of Multiplicative Exponential Linear Logic. MFCS Marco Gaboardi, Luca Roversi, Luca Vercelli
2009	—	`conf`	A Local Criterion for Polynomial-Time Stratified Computations. FOPARA Luca Roversi, Luca Vercelli
2009	Misc	`conf`	Taming Modal Impredicativity: Superlazy Reduction. LFCS Ugo Dal Lago, Luca Roversi, Luca Vercelli
2008	—	`conf`	Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets. TYPES Luca Roversi, Luca Vercelli
2008	J	`jnl`	Taming Modal Impredicativity: Superlazy Reduction CoRR Ugo Dal Lago, Luca Roversi, Luca Vercelli
2008	J	`jnl`	Weak Affine Light Typing is complete with respect to Safe Recursion on Notation CoRR Luca Roversi
2007	J	`jnl`	Weak Affine Light Typing: Polytime intensional expressivity, soundness and completeness CoRR Luca Roversi
2003	—	`conf`	Higher-Order Linear Ramified Recurrence. TYPES Ugo Dal Lago, Simone Martini, Luca Roversi
2002	J	`jnl`	Intuitionistic Light Affine Logic. ACM Trans. Comput. Log. Andrea Asperti, Luca Roversi
2001	B	`conf`	Intersection Logic. CSL Simona Ronchi Della Rocca, Luca Roversi
2001	—	`ed.`	Theoretical Computer Science, 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001, Proceedings ICTCS Antonio Restivo, Simona Ronchi Della Rocca, Luca Roversi
2000	J	`jnl`	Light Affine Logic (Proof Nets, Programming Notation, P-Time Correctness and Completeness) CoRR Andrea Asperti, Luca Roversi
2000	J	`jnl`	Light Affine Logic as a Programming Language: A First Contribution. Int. J. Found. Comput. Sci. Luca Roversi
1999	B	`conf`	A P-Time Completeness Proof for Light Logics. CSL Luca Roversi
1999	J	`jnl`	The call-by-value [lambda]-calculus: a semantic investigation. Math. Struct. Comput. Sci. Alberto Pravato, Simona Ronchi Della Rocca, Luca Roversi
1998	—	`conf`	A Polymorphic Language Which Is Typable and Poly-step. ASIAN Luca Roversi
1997	J	`jnl`	Lambda Calculus and Intuitionistic Linear Logic. Stud Logica Simona Ronchi Della Rocca, Luca Roversi
1996	B	`conf`	A Type-Free Resource-Aware Lambda-Calculus. CSL Luca Roversi
1995	—	`conf`	Categorical semantics of the call-by-value lambda-calculus. TLCA Alberto Pravato, Simona Ronchi Della Rocca, Luca Roversi