Marco Pedicini

Associate Professor in Computer Science
Department of Mathematics and Physics
Roma Tre University 
Research Associate
Istituto per le Applicazioni del Calcolo "Mauro Picone"
Associate Professor in Computer Science
Department of Mathematics and Physics
Roma Tre University
Research Associate
Istituto per le Applicazioni del Calcolo "Mauro Picone"
Linear Logic and its applications to design and evaluation of functional programming languages.
Representation of real numbers in noninteger bases. Pisot Numbers and their properties.
Genetic Networks. Characterization of Limit Cycles. Immune System Simulation.
@@article{CianfrigliaOnofriPedicini+2024, url = {https://doi.org/10.1515/jmc20230026}, title = {mRLWECPABE: A revocable CPABE for postquantum cryptography}, title = {}, author = {Marco Cianfriglia and Elia Onofri and Marco Pedicini}, pages = {20230026}, volume = {18}, number = {1}, journal = {Journal of Mathematical Cryptology}, doi = {doi:10.1515/jmc20230026}, year = {2024}, lastchecked = {20240304} }
@InProceedings{GGOP2023, author="Giordani, Ginevra and Grassi, Lorenzo and Onofri, Silvia and Pedicini, Marco", editor="El Mrabet, Nadia and De Feo, Luca and Duquesne, Sylvain", title="Invertible Quadratic Nonlinear Functions over {\$}{\$}{\backslash}mathbb {\{}F{\}}{\_}p^n{\$}{\$}via Multiple Local Maps", booktitle="Progress in Cryptology  AFRICACRYPT 2023", year="2023", publisher="Springer Nature Switzerland", address="Cham", pages="151176", abstract="The construction of invertible nonlinear layers over {\$}{\$}{\backslash}mathbb {\{}F{\}}{\_}p^n{\$}{\$}Fpnthat minimize the multiplicative cost is crucial for the design of symmetric primitives targeting Multi Party Computation (MPC), ZeroKnowledge proofs (ZK), and Fully Homomorphic Encryption (FHE). At the current state of the art, only few nonlinear functions are known to be invertible over {\$}{\$}{\backslash}mathbb {\{}F{\}}{\_}p{\$}{\$}Fp, as the power maps {\$}{\$}x{\backslash}mapsto x^d{\$}{\$}x↦xdfor {\$}{\$}{\backslash}gcd (d,p1)=1{\$}{\$}gcd(d,p1)=1. When working over {\$}{\$}{\backslash}mathbb {\{}F{\}}{\_}p^n{\$}{\$}Fpnfor {\$}{\$}n{\backslash}ge 2{\$}{\$}n≥2, a possible way to construct invertible nonlinear layers {\$}{\$}{\backslash}mathcal S{\$}{\$}Sover {\$}{\$}{\backslash}mathbb {\{}F{\}}{\_}p^n{\$}{\$}Fpnis by making use of a local map {\$}{\$}F:{\backslash}mathbb {\{}F{\}}{\_}p^m{\backslash}rightarrow {\backslash}mathbb {\{}F{\}}{\_}p{\$}{\$}F:Fpm{\textrightarrow}Fpfor {\$}{\$}m{\backslash}le n{\$}{\$}m≤n, that is, {\$}{\$}{\backslash}mathcal S{\_}F(x{\_}0, x{\_}1, {\backslash}ldots , x{\_}{\{}n1{\}}) = y{\_}0{\backslash}Vert y{\_}1{\backslash}Vert {\backslash}ldots {\backslash}Vert y{\_}{\{}n1{\}}{\$}{\$}SF(x0,x1,{\ldots},xn1)=y0{\textbardbl}y1{\textbardbl}{\ldots}{\textbardbl}yn1where {\$}{\$}y{\_}i = F(x{\_}i, x{\_}{\{}i+1{\}}, {\backslash}ldots , x{\_}{\{}i+m1{\}}){\$}{\$}yi=F(xi,xi+1,{\ldots},xi+m1). This possibility has been recently studied by Grassi, Onofri, Pedicini and Sozzi at FSE/ToSC 2022. Given a quadratic local map {\$}{\$}F:{\backslash}mathbb {\{}F{\}}{\_}p^m {\backslash}rightarrow {\backslash}mathbb {\{}F{\}}{\_}p{\$}{\$}F:Fpm{\textrightarrow}Fpfor {\$}{\$}m{\backslash}in {\backslash}{\{}1,2,3{\backslash}{\}}{\$}{\$}m∈{\{}1,2,3{\}}, they proved that the shiftinvariant nonlinear function {\$}{\$}{\backslash}mathcal S{\_}F{\$}{\$}SFover {\$}{\$}{\backslash}mathbb {\{}F{\}}{\_}p^n{\$}{\$}Fpndefined as before is never invertible for any {\$}{\$}n{\backslash}ge 2{\backslash}cdot m1{\$}{\$}n≥2{\textperiodcentered}m1.", isbn="9783031376795" }
@article{COOP2023, abstract = {Algebraic Cryptanalysis is a widely used technique that tackles the problem of breaking ciphers mainly relying on the ability to express a cryptosystem as a solvable polynomial system. Each output bit/word can be expressed as a polynomial equation in the cipher's inputsnamely the key and the plaintext or the initialisation vector bits/words. A part of research in this area consists in finding suitable algebraic structures where polynomial systems can be effectively solved, e.g., by computing Gr{\"o}bner bases. In 2009, Dinur and Shamir proposed the cube attack, a chosen plaintext algebraic cryptanalysis technique for the offline acquisition of an equivalent system by means of monomial reduction; interpolation on cubes in the space of variables enables retrieving a linear polynomial system, hence making it exploitable in the online phase to recover the secret key. Since its introduction, this attack has received both many criticisms and endorsements from the crypto community; this work aims at providing, under a unified notation, a complete stateoftheart review of recent developments by categorising contributions in five classes. We conclude the work with an indepth description of the kite attack framework, a cipherindependent tool that implements cube attacks on GPUs. Mickey2.0 is adopted as a showcase.}, author = {Cianfriglia, Marco and Onofri, Elia and Onofri, Silvia and Pedicini, Marco}, date = {2023/05/04}, dateadded = {20240305 08:39:00 +0100}, datemodified = {20240305 08:39:00 +0100}, doi = {10.1007/s0020002300602w}, id = {Cianfriglia2023}, isbn = {14320622}, journal = {Applicable Algebra in Engineering, Communication and Computing}, title = {Fourteen years of cube attacks}, url = {https://doi.org/10.1007/s0020002300602w}, year = {2023}, bdskurl1 = {https://doi.org/10.1007/s0020002300602w}}
@article{GrassiOPS22, author = {Lorenzo Grassi and Silvia Onofri and Marco Pedicini and Luca Sozzi}, title = {Invertible Quadratic NonLinear Layers for MPC/FHE/ZKFriendly Schemes over {\unicode{54589}}\({}_{\mbox{p\({}^{\mbox{n}}\)}}\)}: : Application to Poseidon}, journal = {Transactions on Symmetric Cryptology}, number = {3}, year = {2022}, issn = {ISSN 2519173X}, url = {https://tosc.iacr.org/index.php/ToSC/issue/archive} }
@article{DBLP:journals/iacr/CianfrigliaOOP22, author = {Marco Cianfriglia and Elia Onofri and Silvia Onofri and Marco Pedicini}, title = {Ten years of cube attacks}, journal = {{IACR} Cryptol. ePrint Arch.}, number = {137}, year = {2022}, url = {https://eprint.iacr.org/2022/137}, timestamp = {Fri, 18 Feb 2022 14:25:16 +0100}, biburl = {https://dblp.org/rec/journals/iacr/CianfrigliaOOP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/GrassiOPS21, author = {Lorenzo Grassi and Silvia Onofri and Marco Pedicini and Luca Sozzi}, title = {Invertible Quadratic NonLinear Layers for MPC/FHE/ZKFriendly Schemes over {\unicode{54589}}\({}_{\mbox{p\({}^{\mbox{n}}\)}}\)}, journal = {{IACR} Cryptol. ePrint Arch.}, number = {1695}, year = {2021}, url = {https://eprint.iacr.org/2021/1695}, timestamp = {Mon, 17 Jan 2022 17:05:16 +0100}, biburl = {https://dblp.org/rec/journals/iacr/GrassiOPS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{Onofri2021, author = {Onofri, Elia and Pedicini, Marco}, booktitle = {De Cifris Cryptanalysis Selected papers from the ITASEC2020 Workshop De Cifris Cryptanalysis: Cryptanalysis a Key Tool in Securing and Breaking Ciphers}, dateadded = {20211214 19:34:07 +0100}, datemodified = {20211214 20:03:18 +0100}, editor = {La Scala, Roberto and Pedicini, Marco and Visconti, Andrea}, number = {2}, publisher = {Arcne editrice}, series = {Collectio Ciphrarum}, title = {Novel notation on Cube Attacks}, volume = {1}, year = {2022}}
@inproceedings{Cianfriglia2021, author = {Cianfriglia, Marco and Pedicini, Marco}, booktitle = {De Cifris Cryptanalysis Selected papers from the ITASEC2020 Workshop De Cifris Cryptanalysis: Cryptanalysis a Key Tool in Securing and Breaking Ciphers}, editor = {La Scala, Roberto and Pedicini, Marco and Visconti, Andrea}, pages = {3138}, publisher = {Aracne editrice}, series = {Collectio Ciphrarum}, title = {Unboxing the Kite Attack}, volume = {1}, year = {2022}}
@Article{Cianfriglia2019, author="Cianfriglia, Marco and Guarino, Stefano and Bernaschi, Massimo and Lombardi, Flavio and Pedicini, Marco", title="Kite attack: reshaping the cube attack for a flexible GPUbased maxterm search", journal="Journal of Cryptographic Engineering", year="2019", month="May", day="27", abstract="Dinur and Shamir's cube attack has attracted significant attention in the literature. Nevertheless, the lack of implementations achieving effective results casts doubts on its practical relevance. On the theoretical side, promising results have been recently achieved leveraging on division trails. The present paper follows a more practical approach and aims at giving new impetus to this line of research by means of a cipherindependent flexible framework that is able to carry out the cube attack on GPU/CPU clusters. We address all issues posed by a GPU implementation, providing evidence in support of parallel variants of the attack and identifying viable directions for solving open problems in the future. We report the results of running our GPUbased cube attack against roundreduced versions of three wellknown ciphers: Trivium, Grain128 and SNOW 3G. Our attack against Trivium improves the state of the art, permitting full key recovery for Trivium reduced to (up to) 781 initialization rounds (out of 1152) and finding the firstever maxterm after 800 rounds. In this paper, we also present the first standard cube attack (i.e., neither dynamic nor tester) to yield maxterms for Grain128 up to 160 initialization rounds on nonprogrammable hardware. We include a thorough evaluation of the impact of system parameters and GPU architecture on the performance. Moreover, we demonstrate the scalability of our solution on multiGPU systems. We believe that our extensive set of results can be useful for the cryptographic engineering community at large and can pave the way to further results in the area.", issn="21908516", doi="10.1007/s13389019002173", url="https://doi.org/10.1007/s13389019002173" }
@article{komornik2022, title = {A quasiergodic approach to noninteger base expansions}, journal = {Journal of Number Theory}, volume = {254}, pages = {146168}, year = {2024}, issn = {0022314X}, doi = {https://doi.org/10.1016/j.jnt.2023.07.009}, url = {https://www.sciencedirect.com/science/article/pii/S0022314X23001555}, author = {Vilmos Komornik and Paola Loreti and Marco Pedicini}, keywords = {Betaexpansions, Lucas sequences}, abstract = {P. Erdős et al. proved in 1990 that every nontrivial number has a continuum of expansions on twoletter alphabets in every base smaller than the Golden ratio, and that this property fails for the Golden ratio base. It was shown in a recent paper of Baiocchi et al. that if we replace the powers of the Golden ratio by the closely related Fibonacci sequence, then the resulting integer base expansions still have the continuum expansion property. The proof heavily relied on the special properties of the Golden ratio. The difficulty came from the fact that the new expansions do not have any more the ergodic structure of noninteger base expansions. In this paper we introduce a new “quasiergodic” approach that allows us to handle many more general cases. We apply this approach to Baker's generalized Golden ratios.} }
@ARTICLE{Onofri2022, author={Castiglione, Filippo and Nardini, Christine and Onofri, Elia and Pedicini, Marco and Tieri, Paolo}, journal={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, title={Explainable Drug Repurposing Approach From Biased Random Walks}, year={2023}, volume={20}, number={2}, pages={10091019}, keywords={Drugs;Diseases;Databases;Standards;Data mining;Sparse matrices;Simultaneous localization and mapping;Drug repurposing;explainable artificial intelligence;network medicine;Markov chain;biased random walk}, doi={10.1109/TCBB.2022.3191392}}
@incollection{Castiglione2018, title = "Quantitative Modelling Approaches", editor = "Shoba Ranganathan and Michael Gribskov and Kenta Nakai and Christian Schönbach", booktitle = "Encyclopedia of Bioinformatics and Computational Biology", publisher = "Academic Press", address = "Oxford", pages = "874  883", year = "2019", isbn = "9780128114322", doi = "https://doi.org/10.1016/B9780128096338.204548", url = "http://www.sciencedirect.com/science/article/pii/B9780128096338204548", author = "Filippo Castiglione and Emiliano Mancini and Marco Pedicini and Abdul Salam Jarrah", keywords = "Computation", keywords = "Dynamics", keywords = "Mathematical modelling", keywords = "Networks", keywords = "Simulation", keywords = "Stochasticity ", abstract = "Abstract Computational biology aims at disentangling the complexity of biological phenomena by providing tools/algorithms to analyse experimental data or models to predict outcomes of the biological system based on experimental and clinical data. Bioinformatics tools are used to analyse and interpret large scale experimental data and to distil useful information necessary to set up mathematical/computational models. In turn, computational models replicate the dynamics of complex biological systems thus offering in silico evaluations of a hypothesis. Models can be used to predict changes in the behaviour of a system over time and further unravel the complexity of the phenomena under study. Together, these methodologies have the potential to reshape our understanding of biology at all levels of details eventually allowing the optimization of existing therapies or even the formulation of new ones. In this article, we present succinct and informal descriptions of the main approaches or frameworks underlying most mathematical and computational methods currently used in quantitative studies of biological systems." }
@article{pedicini2018, author={PEDICINI M and PALUMBO M C and CASTIGLIONE F}, doi={10.1007/9783319786582}, issn={18650929}, journal={Communications in Computer and Information Science}, pages={}, title={Computing Hierarchical Transition Graphs of Asynchronous Genetic Regulatory Networks}, url={http://www.springer.com/us/book/9783319786575}, volume={830}, year=2018 }
@inproceedings{Pedicini2021, title={On the number of provable formulas}, author={Pedicini, Marco and Piazza, Mario and Puite, Quentijn W.Q.}, editor={L. Bellotti, G. Turbanti}, booktitle={Fourth Pisa Colloquium in Logic, Language and Epistemology. Essays in Honour of E. Moriconi}, publisher={Edizioni ETS}, year={2021}, pages={145166} }
@article{Lai2019, doi = {10.1017/s096012951900001x}, url = {https://doi.org/10.1017%2Fs096012951900001x}, year = 2019, month = {apr}, publisher = {Cambridge University Press ({CUP})}, pages = {132}, author = {Anna Chiara Lai and Marco Pedicini and Mario Piazza}, title = {Abstract machines, optimal reduction, and streams}, journal = {Mathematical Structures in Computer Science} }
@article{komornik2017b, author={KOMORNIK V and PEDICINI M. and PETHO A.}, doi={10.14232/actasm0150800}, issn={00016969}, journal={ACTA SCIENTIARUM MATHEMATICARUM}, pages={51  60}, title={Multiple common expansions in noninteger base}, url={http://acta.fyx.hu/acta/home.action}, volume={83}, year=2017 }
@Article{Komornik2017a, author="Komornik, V. and Pedicini, M.", title="Critical bases for ternary alphabets", journal="Acta Mathematica Hungarica", year="2017", volume="152", number="1", month="June", pages="2557", abstract="Glendinning and Sidorov discovered an important feature of the KomornikLoreti constant $q' \approx 1.78723$ in noninteger base expansions on twoletter alphabets: in bases $1 \leq q \leq q'$ only countably numbers have unique expansions, while for $q \geq q'$ there is a continuum of such numbers. We investigate the analogous question for ternary alphabets.", issn="15882632", doi="10.1007/s1047401707066", url="http://dx.doi.org/10.1007/s1047401707066" }
@Inbook{cianfriglia2017, author="Cianfriglia, Marco and Guarino, Stefano and Bernaschi, Massimo and Lombardi, Flavio and Pedicini, Marco", editor="Gollmann, Dieter and Miyaji, Atsuko and Kikuchi, Hiroaki", title="A Novel GPUBased Implementation of the Cube Attack", bookTitle="Applied Cryptography and Network Security: 15th International Conference, ACNS 2017, Kanazawa, Japan, July 1012, 2017, Proceedings", year="2017", publisher="Springer International Publishing", address="Cham", pages="184207", isbn="9783319612041", doi="10.1007/9783319612041_10", url="http://dx.doi.org/10.1007/9783319612041_10" }
@article{pedicini:JSP2013, title = "Light combinators for finite fields arithmetic ", journal = "Science of Computer Programming ", volume = "111, Part 3", number = "", pages = "365  394", year = "2015", note = "Special Issue on Foundational and Practical Aspects of Resource Analysis (FOPARA) 2009 & 2011 ", issn = "01676423", doi = "http://dx.doi.org/10.1016/j.scico.2015.04.001", url = "http://www.sciencedirect.com/science/article/pii/S0167642315000672", author = "D. Canavese and E. Cesena and R. Ouchary and M. Pedicini and L. Roversi", keywords = "Lambda calculus", keywords = "Finite fields arithmetic", keywords = "Type assignments", keywords = "Implicit computational complexity ", abstract = "Abstract This work completes the definition of a library which provides the basic arithmetic operations in binary finite fields as a set of functional terms with very specific features. Such a functional terms have type in Typeable Functional Assembly (TFA). \{TFA\} is an extension of Dual Light Affine Logic (DLAL). \{DLAL\} is a type assignment designed under the prescriptions of Implicit Computational Complexity (ICC), which characterises polynomial time costing computations. We plan to exploit the functional programming patterns of the terms in the library to implement cryptographic primitives whose runningtime efficiency can be obtained by means of the least handmade tuning as possible. We propose the library as a benchmark. It fixes a kind of lower bound on the difficulty of writing potentially interesting low cost programs inside languages that can express only computations with predetermined complexity. In principle, every known and future \{ICC\} compliant programming language for polynomially costing computations should supply a simplification over the encoding of the library we present, or some set of combinators of comparable interest and difficulty. We finally report on the applicative outcome that our library has and which is a reward we get by programming in the very restrictive scenario that \{TFA\} provides. The term of \{TFA\} which encodes the inversion in binary fields suggested us a variant of a known and efficient imperative implementation of the inversion itself given by Fong. Our variant, can outperform Fong's implementation of inversion on specific hardware architectures." }
@incollection{ year={2014}, isbn={9783319124650}, booktitle={Foundational and Practical Aspects of Resource Analysis}, series={Lecture Notes in Computer Science}, editor={Dal Lago, Ugo and Peña, Ricardo}, doi={10.1007/9783319124667_3}, title={Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion?}, url={http://dx.doi.org/10.1007/9783319124667_3}, publisher={Springer International Publishing}, author={Canavese, Daniele and Cesena, Emanuele and Ouchary, Rachid and Pedicini, Marco and Roversi, Luca}, pages={3857}, language={English} }
@Unpublished{pedicini:TFP2014, author = "M. Pedicini, G. Pellitta, M. Piazza.", title = "Sequential and Parallel Abstract Machines for Optimal Reduction", year = "2014" }
@Article{Lai2016, author="Lai, Anna Chiara and Pedicini, Marco and Rognone, Silvia", title="Quantum entanglement and the Bell matrix", journal="Quantum Information Processing", year="2016", volume="15", number="7", pages="2923  2936", abstract="We present a class of maximally entangled states generated by a highdimensional generalisation of the cnot gate. The advantage of our constructive approach is the simple algebraic structure of both entangling operator and resulting entangled states. In order to show that the method can be applied to any dimension, we introduce new sufficient conditions for global and maximal entanglement with respect to Meyer and Wallach's measure.", issn="15731332", doi="10.1007/s1112801613023", url="http://dx.doi.org/10.1007/s1112801613023" }
@article{clancy2011, author={CLANCY T and PEDICINI M. and CASTIGLIONE F and SANTONI D and NYGAARD V and LAVELLE T. J and BENSON M and HOVIG E}, doi={10.1186/17558794428}, issn={17558794}, journal={BMC MEDICAL GENOMICS}, pages={}, title={Immunological network signatures of cancer progression and survival}, url={http://dx.medra.org/10.1186/17558794428}, volume={4:28}, year=2011, }
@inproceedings{agnesse2011, author = {Agnesse, Andrea and Pedicini, Marco}, title = {Cube Attack in Finite Fields of Higher Order}, booktitle = {Proceedings of the Ninth Australasian Information Security Conference  Volume 116}, series = {AISC '11}, year = {2011}, isbn = {9781920682965}, location = {Perth, Australia}, pages = {914}, numpages = {6}, url = {http://dl.acm.org/citation.cfm?id=2460416.2460419}, url = { http://crpit.com/confpapers/CRPITV116Agnesse.pdf }, acmid = {2460419}, publisher = {Australian Computer Society, Inc.}, address = {Darlinghurst, Australia, Australia}, keywords = {algebraic cryptanalysis, cube attack}, }
@article{komornik2015, author={KOMORNIK V and LAI A. C and PEDICINI M.}, issn={14359855}, journal={JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY}, pages={11131146}, title={Generalized golden ratios of ternary alphabets}, url={http://dx.medra.org/10.4171/JEMS/277}, volume=13, year=2011, }
@incollection{pedicini:LNCS2011, year={2012}, isbn={9783642324949}, booktitle={Foundational and Practical Aspects of Resource Analysis}, volume={7177}, series={Lecture Notes in Computer Science}, editor={Peña, Ricardo and van Eekelen, Marko and Shkaravska, Olha}, doi={10.1007/9783642324956_2}, title={Typing a Core BinaryField Arithmetic in a Light Logic}, url={http://dx.doi.org/10.1007/9783642324956_2}, publisher={Springer Berlin Heidelberg}, author={Cesena, Emanuele and Pedicini, Marco and Roversi, Luca}, pages={1935}, language={English} }
@misc{pedicini2009, author={PEDICINI M. and PIAZZA M}, note={preprint sottomesso per la publicazione su rivista.}, pages={122}, title={Elementary computation and von Neumann Algebras}, volume={arXiv:0912.5342v1}, year=2009, }
@inproceedings{pedicini20101, address={LONDON  GBR}, author={PEDICINI M. and PIAZZA M}, booktitle={New Essays In Logic and Philosophy of Science}, location={Milan}, month={810 Ottobre 2007}, pages={183194}, publisher={College Pubblications}, title={An application of von Neumann Algebras to computational complexity}, volume=1, year=2010, }
@article{pedicini2010, author={PEDICINI M. and BARRENÄS F and CLANCY T and CASTIGLIONE F and HOVIG E and KANDURI K and SANTONI D and BENSON M}, doi={10.1371/journal.pcbi.1001032}, issn={1553734X}, journal={PLOS COMPUTATIONAL BIOLOGY}, pages={e1001032}, title={Combining network modeling and gene expression microarray analysis to explore the dynamics of Th1 and Th2 cell regulation}, url={http://dx.medra.org/10.1371/journal.pcbi.1001032}, volume={6 (12)}, year=2010, }
@inbook{castiglione2010, address={ANNERLEY  AUS}, author={CASTIGLIONE F and SANTONI D and PEDICINI M.}, chapter={Implementing agent's rules with gene regulatory networks in mesoscopiclevel models of cellular interactions.}, isbn={9780980733020}, publisher={iConcept Press Pty Ltd.}, title={A PRACTICAL GUIDE TO BIOINFORMATICS ANALYSIS}, year=2010, }
@article{santoni2008, author={SANTONI D and PEDICINI M. and CASTIGLIONE F}, doi={10.1093/bioinformatics/btn135}, issn={13674803}, journal={BIOINFORMATICS}, pages={13741380}, title={Implementation of a regulatory gene network to simulate the TH1/2 differentiation in an agentbased model of hypersensitivity reactions}, url={http://dx.medra.org/10.1093/bioinformatics/btn135}, volume=24, year=2008, }
@inproceedings{pedicini20071, author={PEDICINI M. and PIAZZA M}, booktitle={CiE 2007}, location={Siena, Italy}, title={Elementary Complexity into the Hyperfinite II1 Factor}, year=2007, }
@inproceedings{baillot2006, author={BAILLOT P and PEDICINI M.}, booktitle={LCC'06}, location={Seattle, USA}, note={online proceedings: http://www.easychair.org/FLoC06/LCC.html}, title={An embedding of the BSS model of computation in light affine lambdacalculus}, year=2006, }
@article{pedicini2007, author={PEDICINI M. and QUAGLIA F}, doi={10.1145/1243996.1243997}, issn={15293785}, journal={ACM TRANSACTIONS ON COMPUTATIONAL LOGIC}, pages={136}, title={PELCR: Parallel Environment for Optimal LambdaCalculus Reduction}, url={http://dx.medra.org/10.1145/1243996.1243997}, volume=8, year=2007, }
@article{cosentino2006, author={COSENTINO A and PEDICINI M. and QUAGLIA F}, doi={10.1016/j.entcs.2005.09.025}, issn={15710661}, journal={ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE}, pages={107117}, title={Supporting Function Calls within PELCR}, url={http://dx.medra.org/10.1016/j.entcs.2005.09.025}, volume=135, year=2006, }
@article{pedicini2002, author={PEDICINI M. and QUAGLIA F}, doi={10.1007/3540457062_89}, issn={03029743}, journal={LECTURE NOTES IN COMPUTER SCIENCE}, pages={648655}, title={Scheduling vs Communication in PELCR}, url={http://dx.medra.org/10.1007/3540457062_89}, volume=2400, year=2002, }
@inproceedings{quaglia2000, title = {A Parallel Implementation for Optimal LambdaCalculus Reduction.}, author = {Pedicini, Marco and Quaglia, Francesco}, booktitle = {PPDP}, pages = {314}, year = 2000, ee = \url{http://doi.acm.org/10.1145/351268.351270}, bibsource = {DBLP, http://dblp.unitrier.de} }
@article{baillot2000, author={BAILLOT P and PEDICINI M.}, issn={01692968}, journal={FUNDAMENTA INFORMATICAE}, note={http://iospress.metapress.com/link.asp?id=9d1cd4ucuha04uvt}, pages={131}, title={Elementary complexity and geometry of interaction}, volume=45, year=2000, }
@book{loreti2005, address={PROVIDENCE  USA}, author={LORETI P and PEDICINI M.}, isbn={9780821835388}, publisher={AMS}, title={An objectoriented approach to idempotent analysis: Integral equations as optimal control problems}, volume=377, year=2005, }
@article{loreti2001, author={LORETI P and PEDICINI M.}, doi={10.1023/A:1002824402949}, issn={10679073}, journal={MATHEMATICAL NOTES}, note={Paper appeared in russian and then in english}, pages={235244}, title={An idempotent analogue of resolvent kernels for a deterministic optimal control problem}, url={http://dx.medra.org/10.1023/A:1002824402949}, volume=69, year=2001, }
@article{pedicini2005, author={PEDICINI M.}, doi={10.1016/j.tcs.2004.11.002}, issn={03043975}, journal={THEORETICAL COMPUTER SCIENCE}, pages={313336}, title={Greedy expansions and sets with deleted digits}, url={http://dx.medra.org/10.1016/j.tcs.2004.11.002}, volume=332, year=2005, }
@article{komornik2000, author={KOMORNIK V and LORETI P and PEDICINI M.}, doi={10.1006/jnth.1999.2456}, issn={0022314X}, journal={JOURNAL OF NUMBER THEORY}, pages={218237}, title={An approximation property of Pisot numbers}, url={http://dx.medra.org/10.1006/jnth.1999.2456}, volume=80, year=2000, }
@incollection{baillot1999, year={1999}, isbn={9783540657637}, booktitle={Typed Lambda Calculi and Applications}, volume={1581}, series={Lecture Notes in Computer Science}, editor={Girard, JeanYves}, doi={10.1007/3540489592_4}, title={Elementary Complexity and Geometry of Interaction}, url={http://dx.doi.org/10.1007/3540489592_4}, publisher={Springer Berlin Heidelberg}, author={Baillot, Patrick and Pedicini, Marco}, pages={2533}, language={English} }
@incollection{mascari1998, title = {Types and Dynamics in Partially Additive Categories.}, author = {Mascari, Gianfranco and Pedicini, Marco}, booktitle = {Gunawardena, Jeremy (ed.), Idempotency. Based on a Workshop, Bristol, UK, October 37, 1994, Cambridge: Cambridge University Press. 112132 }, year = 1998, language = {English}, abstract = {{A challenging problem in studying complex systems is to model the internal structure of the system and its dynamical evolution in an integrated view. An algorithm computes a function with domain consisting of all its possible inputs and as codomain all possible outputs. In order to ``compare'' algorithms computing the same function (e.g. with respect to time or space complexity) it is necessary to model the ``dynamic behavior'' of the algorithm. The main approach for modeling the dynamic behavior $Bh ({\cal P})$ of an algorithm is ``the dynamic system paradigm'': $Bh ({\cal P})$ is obtained as the action of a (control) monoid on a (state) space.\par Various mathematical structures have been considered for attacking such a problem; among others, deterministic automata and stochastic automata. In order to capture the fine structure of computation, an attempt to describe the ``macroscopic'' global dynamic behavior of an algorithm in terms of the ``microscopic'' local dynamic behavior of its components has recently been proposed within a logical approach to computing called ``geometry of interaction'' developed within $C^*$algebras. We propose an algebraic approach to ``structured dynamics'' inspired by the geometry of interaction and based on a ``many objects'' generalization of semirings: partially additive categories.}}, keywords = {{time complexity; dynamic behavior of algorithm; $C^*$algebras; complex systems; internal structure; dynamical evolution; space complexity; deterministic automata; stochastic automata; geometry of interaction; generalization of semirings; partially additive categories}}, classmath = {{*18B20 Categories of automata, etc. 68Q25 Analysis of algorithms and problem complexity 68Q70 Algebraic theory of automata 68Q45 Formal languages 16Y60 Semirings 18E05 Additive categories, etc.}} }
@inproceedings{danos1997, address={BERLIN  DEU}, author={DANOS V and PEDICINI M. and REGNIER L}, booktitle={Computer science logic (Utrecht, 1996)}, doi={10.1007/3540631720_33}, location={Utrecht}, pages={7688}, publisher={SpringerVerlag}, title={Directed virtual reductions}, url={http://dx.medra.org/10.1007/3540631720_33}, volume=1258, year=1997, }
@article{pedicini1996, title = "Remarks on Elementary Linear Logic: Preliminary Report ", journal = "Electronic Notes in Theoretical Computer Science ", volume = "3", number = "0", pages = "208  219", year = "1996", note = "Linear Logic 96 Tokyo Meeting ", issn = "15710661", doi = "http://dx.doi.org/10.1016/S15710661(05)804190", url = "http://www.sciencedirect.com/science/article/pii/S1571066105804190", author = "Marco Pedicini" }
@article{mascari1994, author={MASCARI G. F and PEDICINI M.}, doi={10.1016/03043975(94)902631}, issn={03043975}, journal={THEORETICAL COMPUTER SCIENCE}, pages={111137}, title={Head linear reduction and pure proof net extraction}, url={http://dx.medra.org/10.1016/03043975(94)902631}, volume=135, year=1994, }
+39 06 57338519, fax: +39 06 57338080
marco.pedicini@uniroma3.it