Marco Pedicini

Number Theory and Automata:

• V. Komornik, P. Loreti, M. Pedicini. A quasi-ergodic approach to non-integer base expansions (submitted). [bibtex]

  @unpublished{komornik2022,
  author={KOMORNIK V and LORETI P and PEDICINI M},
  title={A quasi-ergodic approach to non-integer base expansions},
  year=2022
  }
  

• V. Komornik, M. Pedicini, A. Pethö. Multiple common expansions in non-integer bases, Acta Sci. Math. (Szeged) 83 (2017), 51-60. [bibtex|doi]

  @article{komornik2017b,
  author={KOMORNIK V and PEDICINI M. and PETHO A.},
  doi={10.14232/actasm-015-080-0},
  issn={0001-6969},
  journal={ACTA SCIENTIARUM MATHEMATICARUM},
  pages={51 -- 60},
  title={Multiple common expansions in non-integer base},
  url={http://acta.fyx.hu/acta/home.action},
  volume={83},
  year=2017
  }
  

• V. Komornik, M. Pedicini. Critical bases for ternary alphabets, Acta Math. Hungar, June 2017, Volume 152, Issue 1, pp 25-57. [bibtex|doi]

  @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="25--57",
  abstract="Glendinning and Sidorov discovered an important feature of the Komornik--Loreti constant
  $q' \approx 1.78723$ in non-integer base expansions on two-letter 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="1588-2632",
  doi="10.1007/s10474-017-0706-6",
  url="http://dx.doi.org/10.1007/s10474-017-0706-6"
  }
  

Computational Methods in Systems Biology:

• F. Castiglione, C. Nardini, E. Onofri, M. Pedicini, P. Tieri Explainable Drug Repurposing Approach from Biased Random Walks IEEE/ACM Transactions on Computational Biology and Bioinformatics, (in press). [bibtex].

  @article{Onofri2022,
  	author={Castiglione, Filippo and Nardini, Christine and Onofri, Elia and Pedicini, Marco and Tieri, Paolo},
  	title={Explainable Drug Repurposing Approach from Biased Random Walks},
  	journal={IEEE/ACM Transactions on Computational Biology and Bioinformatics},
  	note={in press},
  	year={2022}
  }
  

• F. Castiglione, E. Mancini, M. Pedicini, A. S. Jarrah Quantitative Modelling Approaches In book: Reference Module in Life Sciences, Elsevier (2018) [bibtex|link|doi].

  @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 = "978-0-12-811432-2",
  doi = "https://doi.org/10.1016/B978-0-12-809633-8.20454-8",
  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."
  }
  

• M. Pedicini, M. C. Palumbo, F. Castiglione. Computing Hierarchical Transition Graphs of Asynchronous Genetic Regulatory Networks Communications in Computer and Information Science, (2018), Springer-Verlag. [bibtex|link].

  @article{pedicini2018,
  author={PEDICINI M and PALUMBO M C and CASTIGLIONE F},
  doi={10.1007/978-3-319-78658-2},
  issn={1865-0929},
  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
  }
  
  

Cryptography:

• Lorenzo Grassi, Silvia Onofri, Marco Pedicini, Luca Sozzi Invertible Quadratic Non-Linear Layers for MPC-/FHE-/ZK-Friendly Schemes over $\mathbb F_{p^n}$: Application to Poseidon In Transactions on Symmetric Cryptology 2022 issue 3 (in press), ISSN 2519-173X. [bibtex].

  @article{GrassiOPS22,
  	author    = {Lorenzo Grassi and
  				Silvia Onofri and
  				Marco Pedicini and
  				Luca Sozzi},
  	title     = {Invertible Quadratic Non-Linear Layers for MPC-/FHE-/ZK-Friendly Schemes
  				over {\unicode{54589}}\({}_{\mbox{p\({}^{\mbox{n}}\)}}\)}: : Application to Poseidon},
  	journal   = {Transactions on Symmetric Cryptology},
  	number     = {3},
  	year      = {2022},
  	issn      = {ISSN 2519-173X},
  	url       = {https://tosc.iacr.org/index.php/ToSC/issue/archive}
  }
  

• Marco Cianfriglia, Elia Onofri, Silvia Onofri, Marco Pedicini Ten years of cube attacks In IACR e-print archive n.137/2022. [bibtex|pdf].

  @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}
  }
  

• Lorenzo Grassi, Silvia Onofri, Marco Pedicini, Luca Sozzi Invertible Quadratic Non-Linear Layers for MPC-/FHE-/ZK-Friendly Schemes over $\mathbb F_{p^n}$ In IACR e-print archive n.1695/2021. [bibtex|pdf].

  @article{DBLP:journals/iacr/GrassiOPS21,
  	author    = {Lorenzo Grassi and
  				Silvia Onofri and
  				Marco Pedicini and
  				Luca Sozzi},
  	title     = {Invertible Quadratic Non-Linear Layers for MPC-/FHE-/ZK-Friendly 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}
  }
  

• Elia Onofri, Marco Pedicini Novel notation on Cube Attacks In De Cifris Cryptanalysis Selected papers from the ITASEC2020 Workshop De Cifris Cryptanalysis: Cryptanalysis a Key Tool in Securing and Breaking Ciphers, (in press). [bibtex].

  @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},
  	date-added = {2021-12-14 19:34:07 +0100},
  	date-modified = {2021-12-14 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}}
  

• Marco Cianfriglia, Marco Pedicini Unboxing the Kite Attack In De Cifris Cryptanalysis Selected papers from the ITASEC2020 Workshop De Cifris Cryptanalysis: Cryptanalysis a Key Tool in Securing and Breaking Ciphers. (in press). [bibtex].

  	
  @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 = {31--38},
  publisher = {Aracne editrice},
  series = {Collectio Ciphrarum},
  title = {Unboxing the Kite Attack},
  volume = {1},
  year = {2022}}
  

• Marco Cianfriglia, Stefano Guarino, Massimo Bernaschi, Flavio Lombardi, Marco Pedicini Kite attack: reshaping the cube attack for a flexible GPU-based maxterm search In Journal of Cryptographic Engineering, Springer, (Online first May 2019) [bibtex|doi].

  @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 GPU-based 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 cipher-independent 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 GPU-based cube attack against round-reduced versions of three well-known ciphers: Trivium, Grain-128 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 first-ever 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 Grain-128 up to 160 initialization rounds on non-programmable 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 multi-GPU 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="2190-8516",
  doi="10.1007/s13389-019-00217-3",
  url="https://doi.org/10.1007/s13389-019-00217-3"
  }	 	
  

• M. Cianfriglia, S. Guarino, M. Bernaschi, F. Lombardi and M. Pedicini A Novel GPU-Based Implementation of the Cube Attack - In: Gollmann D., Miyaji A., Kikuchi H. (eds) Applied Cryptography and Network Security. ACNS 2017. Lecture Notes in Computer Science, vol 10355. Springer, Cham [bibtex|doi].

  @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 GPU-Based Implementation of the Cube Attack",
  bookTitle="Applied Cryptography and Network Security: 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings",
  year="2017",
  publisher="Springer International Publishing",
  address="Cham",
  pages="184--207",
  isbn="978-3-319-61204-1",
  doi="10.1007/978-3-319-61204-1_10",
  url="http://dx.doi.org/10.1007/978-3-319-61204-1_10"
  }
  

Logic in Computer Science:

• Marco Pedicini, Mario Piazza, Quentijn W.Q. Puite, On the number of provable formulas in L. Bellotti, G. Turbanti (eds), Fourth Pisa Colloquium in Logic, Language and Epistemology. Essays in Honour of E. Moriconi, Edizioni ETS, 2021, pp. 145-166. [bibtex|pdf].

  @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={145-166}
  }
  

• A. C. Lai, M. Pedicini, M. Piazza Abstract Machines, Optimal Reduction, and Streams, Mathematical Structures in Computer Science (2019). [bibtex|doi].

  @article{Lai2019,
  doi = {10.1017/s096012951900001x},
  url = {https://doi.org/10.1017%2Fs096012951900001x},
  year = 2019,
  month = {apr},
  publisher = {Cambridge University Press ({CUP})},
  pages = {1--32},
  author = {Anna Chiara Lai and Marco Pedicini and Mario Piazza},
  title = {Abstract machines, optimal reduction, and streams},
  journal = {Mathematical Structures in Computer Science}
  } 
  

Logic in Computer Science:

• D. Canavese, E. Cesena, R. Ouchary, M. Pedicini, L. Roversi. Light combinators for finite fields arithmetics, Science of Computer Programming 111 (2015) 365--394 [bibtex|doi].

  @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 = "0167-6423",
   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 running-time efficiency can be obtained by means of the least hand-made 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."
  }
  

• D. Canavese, E. Cesena, R. Ouchary, M. Pedicini, L. Roversi. Can a Light Typing Discipline be compatible with efficient implementation of finite fields inversion ?, in Foundational and Practical Aspects of Resource Analysis Third International Workshop, FOPARA 2013, Bertinoro, Italy, August 29-31, 2013, Revised Selected Papers, LNCS 8552, pp. 38 - 57 (2014) [bibtex|doi].

  @incollection{
  year={2014},
  isbn={978-3-319-12465-0},
  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/978-3-319-12466-7_3},
  title={Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion?},
  url={http://dx.doi.org/10.1007/978-3-319-12466-7_3},
  publisher={Springer International Publishing},
  author={Canavese, Daniele and Cesena, Emanuele and Ouchary, Rachid and Pedicini, Marco and Roversi, Luca},
  pages={38-57},
  language={English}
  }
  

• M. Pedicini, G. Pellitta, M. Piazza. Sequential and Parallel Abstract Machines for Optimal Reduction, presented at Trends in Functional Programming (2014) [bibtex|pdf].

  @Unpublished{pedicini:TFP2014,
   	author = "M. Pedicini, G. Pellitta, M. Piazza.",
   	title = "Sequential and Parallel Abstract Machines for Optimal Reduction",
   	year = "2014"
  }
  

Quantum Computing:

• A.C. Lai, M. Pedicini, S. Rognone. Quantum Entanglement and the Bell matrix, Quantum Information Processing, July 2016, Volume 15, Issue 7, pp 2923-2936 (2016). [bibtex|pdf| arxiv|doi].

  @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 high-dimensional 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="1573-1332",
  doi="10.1007/s11128-016-1302-3",
  url="http://dx.doi.org/10.1007/s11128-016-1302-3"
  }
  

Computational Methods in Systems Biology:

• T. Clancy, M. Pedicini, F. Castiglione, D. Santoni, V. Nygaard, T. J. Lavelle, M. Benson, E. Hovig. Immunological network signatures of cancer progression and survival BMC Medical Genomics, 4:28 (2011) [bibtex|doi].

  @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/1755-8794-4-28},
  	issn={1755-8794},
  	journal={BMC MEDICAL GENOMICS},
  	pages={--},
  	title={Immunological network signatures of cancer progression and survival},
  	url={http://dx.medra.org/10.1186/1755-8794-4-28},
  	volume={4:28},
  	year=2011,
  }
  
  

Cryptography:

• A. Agnesse, M. Pedicini. Cube attack in finite fields of higher order. In Conferences in Research and Practice in Information Technology (CRPIT), Vol. 116, Colin Boyd and Josef Pieprzyk, Eds. Australian Computer Society, Inc. Conference Proceedings of the 9th Australasian Information Security Conference (AISC 2011), Perth, Australia, (January 2011) [bibtex|acm|pdf].

  @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 = {978-1-920682-96-5},
   	location = {Perth, Australia},
   	pages = {9--14},
   	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},
  } 
  

Number Theory and Automata:

• V. Komornik, A.C. Lai, M. Pedicini. Generalized golden ratios of ternary alphabets, in Journal of the European Mathematical Society, Volume 13, Issue 4, pp. 1113--1146 (2011) [bibtex|doi].

  @article{komornik2015,
  	author={KOMORNIK V and LAI A. C and PEDICINI M.},
  	issn={1435-9855},
  	journal={JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY},
  	pages={1113--1146},
  	title={Generalized golden ratios of ternary alphabets},
  	url={http://dx.medra.org/10.4171/JEMS/277},
  	volume=13,
  	year=2011,
  }
  

Logic in Computer Science:

• E. Cesena, M. Pedicini, L. Roversi. Typing a Core Binary Field Arithmetic in a Light Logic, contributed paper at FOPARA2011, Madrid (2011), [bibtex|doi].

  @incollection{pedicini:LNCS2011,
  	year={2012},
   	isbn={978-3-642-32494-9},
   	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/978-3-642-32495-6_2},
   	title={Typing a Core Binary-Field Arithmetic in a Light Logic},
   	url={http://dx.doi.org/10.1007/978-3-642-32495-6_2},
   	publisher={Springer Berlin Heidelberg},
   	author={Cesena, Emanuele and Pedicini, Marco and Roversi, Luca},
   	pages={19-35},
   	language={English}
  }
  

Mathematical Logic:

• M. Pedicini, M. Piazza. Elementary Complexity and von Neumann Algebras, CoRR abs/0912.5342, submitted (2009) [bibtex|pdf].

  @misc{pedicini2009,
  	author={PEDICINI M. and PIAZZA M},
  	note={preprint sottomesso per la publicazione su rivista.},
  	pages={1--22},
  	title={Elementary computation and von Neumann Algebras},
  	volume={arXiv:0912.5342v1},
  	year=2009,
  }
  

• M. Pedicini, M. Piazza, An application of von Neumann algebras to computational complexity, in M. D'Agostino et alii (editors), New Essays In Logic and Philosophy of Science, College Publications, London, pp. 183-194, November 2010 [bibtex].

  @inproceedings{pedicini2010-1,
  	address={LONDON -- GBR},
  	author={PEDICINI M. and PIAZZA M},
  	booktitle={New Essays In Logic and Philosophy of Science},
  	location={Milan},
  	month={8-10 Ottobre 2007},
  	pages={183--194},
  	publisher={College Pubblications},
  	title={An application of von Neumann Algebras to computational complexity},
  	volume=1,
  	year=2010,
  }
  

Computational Methods in Systems Biology:

• M. Pedicini, F. Barrenas, T. Clancy, F. Castiglione, E. Hovig, K. Kanduri, D. Santoni, M. Benson. Combining network modeling and gene expression microarray analysis to explore the dynamics of Th1 and Th2 cell regulation, PLOS Computational Biology 6(12): e1001032 (2010) [bibtex|doi].

  @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={1553-734X},
  	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,
  }	
  

• F. Castiglione, D. Santoni and M. Pedicini. Implementing agent's rules with gene regulatory networks in mesoscopic-level models of cellular interactions. In A practical guide to bioinformatics analysis : pp. 57--68, Editor Gabriel P.C. Fung, iConcept Press (2010) [bibtex].

  @inbook{castiglione2010,
  	address={ANNERLEY -- AUS},
  	author={CASTIGLIONE F and SANTONI D and PEDICINI M.},
  	chapter={Implementing agent's rules with gene regulatory networks in mesoscopic-level models of cellular interactions.},
  	isbn={978-0-9807330-2-0},
  	publisher={iConcept Press Pty Ltd.},
  	title={A PRACTICAL GUIDE TO BIOINFORMATICS ANALYSIS},
  	year=2010,
  }	
  

• D. Santoni, M. Pedicini, F. Castiglione. Implementation of a regulatory gene network to simulate the TH1/2 differentiation in an agent-based model of hypersensitivity reactions. Bioinformatics 24(11): 1374-1380 (2008) [bibtex|doi].

  @article{santoni2008,
  	author={SANTONI D and PEDICINI M. and CASTIGLIONE F},
  	doi={10.1093/bioinformatics/btn135},
  	issn={1367-4803},
  	journal={BIOINFORMATICS},
  	pages={1374--1380},
  	title={Implementation of a regulatory gene network to simulate the TH1/2 differentiation in an agent-based model of hypersensitivity reactions},
  	url={http://dx.medra.org/10.1093/bioinformatics/btn135},
  	volume=24,
  	year=2008,
  }
  

Logic in Computer Science:

• M. Pedicini, M. Piazza, Elementary Complexity into the Hyperfinite \(\mathrm{II}_1\) Factor contributed paper at CiE07 Computation and Logic in the Real World 2007, Siena, (2007) [bibtex].

  @inproceedings{pedicini2007-1,
  	author={PEDICINI M. and PIAZZA M},
  	booktitle={CiE 2007},
  	location={Siena, Italy},
  	title={Elementary Complexity into the Hyperfinite II1 Factor},
  	year=2007,
  }
  

• P. Baillot and M. Pedicini. An embedding of the BSS model of computation in light affine lambda-calculus. contributed paper at FLOC - LCC'06, 8th International Workshop on Logic and Computational Complexity Seattle, (2006) [bibtex|arxiv].

  @inproceedings{baillot2006,
  	author={BAILLOT P and PEDICINI M.},
  	booktitle={LCC'06},
  	location={Seattle, USA},
  	note={online proceedings: http://www.easychair.org/FLoC-06/LCC.html},
  	title={An embedding of the BSS model of computation in light affine lambda-calculus},
  	year=2006,
  }	
  

• M. Pedicini and F. Quaglia. PELCR: Parallel Environment for Optimal Lambda Calculus Reduction. ACM Transactions on Computational Logic, 8:3, pp. 1--14 (2007) [bibtex|doi].

  @article{pedicini2007,
  	author={PEDICINI M. and QUAGLIA F},
  	doi={10.1145/1243996.1243997},
  	issn={1529-3785},
  	journal={ACM TRANSACTIONS ON COMPUTATIONAL LOGIC},
  	pages={1--36},
  	title={PELCR: Parallel Environment for Optimal Lambda-Calculus Reduction},
  	url={http://dx.medra.org/10.1145/1243996.1243997},
  	volume=8,
  	year=2007,
  }
  

Logic in Computer Science:

• A. Cosentino, M. Pedicini and F. Quaglia. Supporting Function Calls within PELCR Electronic Notes in Theoretical Computer Science Volume 135, Issue 3 , 3 March 2006, Pages 107-117 Proceedings of the First International Workshop on Developments in Computational Models (DCM 2005) [bibtex|doi].

  @article{cosentino2006,
  	author={COSENTINO A and PEDICINI M. and QUAGLIA F},
  	doi={10.1016/j.entcs.2005.09.025},
  	issn={1571-0661},
  	journal={ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE},
  	pages={107--117},
  	title={Supporting Function Calls within PELCR},
  	url={http://dx.medra.org/10.1016/j.entcs.2005.09.025},
  	volume=135,
  	year=2006,
  }	
  

• M. Pedicini and F. Quaglia. Scheduling vs Communication in PELCR, Proc. Euro-Par'02, Paderborn (Germany), LNCS, Spinger-Verlang, August (2002) [bibtex|doi].

  @article{pedicini2002,
  	author={PEDICINI M. and QUAGLIA F},
  	doi={10.1007/3-540-45706-2_89},
  	issn={0302-9743},
  	journal={LECTURE NOTES IN COMPUTER SCIENCE},
  	pages={648--655},
  	title={Scheduling vs Communication in PELCR},
  	url={http://dx.medra.org/10.1007/3-540-45706-2_89},
  	volume=2400,
  	year=2002,
  }	
  

• M. Pedicini and F. Quaglia. A parallel implementation for optimal lambda-calculus reduction Proceedings of the 2nd International Conference on Principles and Practice of Declarative Programming, pages 3-14. ACM Press, (2000) [bibtex|doi].

  @inproceedings{quaglia2000,
    	title = {A Parallel Implementation for Optimal Lambda-Calculus Reduction.},
    	author = {Pedicini, Marco and Quaglia, Francesco},
    	booktitle = {PPDP},
    	pages = {3-14},
    	year = 2000,
    	ee = \url{http://doi.acm.org/10.1145/351268.351270},
    	bibsource = {DBLP, http://dblp.uni-trier.de}
  }	
  

• P. Baillot and M. Pedicini. Elementary complexity and geometry of interaction. Annales Societatis Mathematicae Polonae. Series IV. Fundamenta Informaticae 45(1-2):1-31, (2000) [bibtex|url].

  @article{baillot2000,
  	author={BAILLOT P and PEDICINI M.},
  	issn={0169-2968},
  	journal={FUNDAMENTA INFORMATICAE},
  	note={http://iospress.metapress.com/link.asp?id=9d1cd4ucuha04uvt},
  	pages={1--31},
  	title={Elementary complexity and geometry of interaction},
  	volume=45,
  	year=2000,
  }	
  

Idempotent Analysis:

• P. Loreti and M. Pedicini. An Object-Oriented Approach to Idempotent Analysis: Integral Equations as Optimal Control Problems. Contemporary Mathematics, vol. 377, AMS. Proceedings of the Conference on Idempotent Mathematics and Mathematical Physics. Editors G.L. Litvinov and V.P. Maslov (2005) [bibtex].

  @book{loreti2005,
  	address={PROVIDENCE -- USA},
  	author={LORETI P and PEDICINI M.},
  	isbn={978-0-8218-3538-8},
  	publisher={AMS},
  	title={An object-oriented approach to idempotent analysis: Integral equations as optimal control problems},
  	volume=377,
  	year=2005,
  }	
  

• P. Loreti and M. Pedicini. An idempotent analogue of resolvent kernels for a deterministic optimal control problem. (traduzione dal russo), Matematicheskie Zametki, vol. 69, no. 2, pp. 235-244 (2001) [bibtex|doi].

  @article{loreti2001,
  	author={LORETI P and PEDICINI M.},
  	doi={10.1023/A:1002824402949},
  	issn={1067-9073},
  	journal={MATHEMATICAL NOTES},
  	note={Paper appeared in russian and then in english},
  	pages={235--244},
  	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,
  }
  

Number Theory and Automata:

• M. Pedicini. Greedy expansions and sets with deleted digits. Theoretical Computer Science, 332 pp. 313-336. Elsevier, Amsterdam, The Netherlands, (2005) [bibtex|doi].

  @article{pedicini2005,
  	author={PEDICINI M.},
  	doi={10.1016/j.tcs.2004.11.002},
  	issn={0304-3975},
  	journal={THEORETICAL COMPUTER SCIENCE},
  	pages={313--336},
  	title={Greedy expansions and sets with deleted digits},
  	url={http://dx.medra.org/10.1016/j.tcs.2004.11.002},
  	volume=332,
  	year=2005,
  }	
  

• V. Komornik, P. Loreti, and M. Pedicini. An approximation property of Pisot numbers. Journal of Number Theory, vol. 80 n. 2, 218-237 Academic Press, (2000) [bibtex|doi].

  @article{komornik2000,
  	author={KOMORNIK V and LORETI P and PEDICINI M.},
  	doi={10.1006/jnth.1999.2456},
  	issn={0022-314X},
  	journal={JOURNAL OF NUMBER THEORY},
  	pages={218--237},
  	title={An approximation property of Pisot numbers},
  	url={http://dx.medra.org/10.1006/jnth.1999.2456},
  	volume=80,
  	year=2000,
  }	
  

Logic in Computer Science:

• P. Baillot and M. Pedicini. Elementary complexity and geometry of interaction (extended abstract). In J.-Y. Girard, editor, 4th International Conference, TLCA'99, L'Aquila, number 1581 in Lecture Notes in Computer Science, pages 25-39. Springer Verlag, Berlin, (1999) [bibtex|doi].

  @incollection{baillot1999,
   	year={1999},
  	isbn={978-3-540-65763-7},
   	booktitle={Typed Lambda Calculi and Applications},
   	volume={1581},
   	series={Lecture Notes in Computer Science},
   	editor={Girard, Jean-Yves},
   	doi={10.1007/3-540-48959-2_4},
   	title={Elementary Complexity and Geometry of Interaction},
   	url={http://dx.doi.org/10.1007/3-540-48959-2_4},
   	publisher={Springer Berlin Heidelberg},
   	author={Baillot, Patrick and Pedicini, Marco},
   	pages={25-33},
   	language={English}
  }
  

• G. F. Mascari and M. Pedicini. Types and dynamics in partially additive categories. In J. Gunawardena, editor, Idempotency, volume 11 of Publications of the Isaac Newton Institute, pages 112-132, Cambridge, UK. Cambridge University Press, (1998) [bibtex].

  @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 3--7, 1994, Cambridge: Cambridge University Press. 112-132 },
    	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.}}
  }
  

• V. Danos, M. Pedicini, and L. Regnier. Directed virtual reductions. In M. Bezem and D. van Dalen, editors, Computer Science Logic, 10th International Workshop, CSL '96, volume 1258 of Lecture Notes in Computer Science, pages 76-88. EACSL, Springer Verlag, Berlin, DE (1997) [bibtex|doi].

  @inproceedings{danos1997,
  	address={BERLIN -- DEU},
  	author={DANOS V and PEDICINI M. and REGNIER L},
  	booktitle={Computer science logic (Utrecht, 1996)},
  	doi={10.1007/3-540-63172-0_33},
  	location={Utrecht},
  	pages={76--88},
  	publisher={Springer-Verlag},
  	title={Directed virtual reductions},
  	url={http://dx.medra.org/10.1007/3-540-63172-0_33},
  	volume=1258,
  	year=1997,
  }
  	
  

• M. Pedicini. Remarks on elementary linear logic. In A Special Issue on the ``Linear Logic 96, Tokyo Meeting'', volume 3 of Electronic Notes in Theoretical Computer Science, Elsevier, Amsterdam, The Netherlands (1996) [bibtex|doi].

  @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 = "1571-0661",
  	doi = "http://dx.doi.org/10.1016/S1571-0661(05)80419-0",
  	url = "http://www.sciencedirect.com/science/article/pii/S1571066105804190",
  	author = "Marco Pedicini"
  }
  

• G. F. Mascari and M. Pedicini. Head linear reduction and pure proof net extraction. Theoret. Comput. Sci., 135(1):111-137, Amsterdam, The Netherlands, Elsevier (1994) [bibtex|doi].

  @article{mascari1994,
  	author={MASCARI G. F and PEDICINI M.},
  	doi={10.1016/0304-3975(94)90263-1},
  	issn={0304-3975},
  	journal={THEORETICAL COMPUTER SCIENCE},
  	pages={111--137},
  	title={Head linear reduction and pure proof net extraction},
  	url={http://dx.medra.org/10.1016/0304-3975(94)90263-1},
  	volume=135,
  	year=1994,
  }
  

Principal Investigator

• for the subcontract Computational modelling in biological systems of Workpackage 5 ``Modelling and Simulation'' of H2020-JTI-IMI2 ``ERA4TB - European Tuberculosis Regimen Accelerator'' (GA n. 85398) in collaboration with Digital Biology Unit at IAC-CNR.

Participant

In charge of the following research projects :

• PRINCIPAL INVESTIGATOR of the Roma Tre University Unit of PRIN 2010-2011: Metodi Logici per il trattamento dell'informazione (other members of the Unit: Prof. V.M. Abrusci, Prof. L. Tortora de Falco, Prof. R. Maieli)
• PRINCIPAL INVESTIGATOR "INT.P01.007.006 Applied cryptography: analysis and performance of cryptographic primitives", Istituto per le Applicazioni del Calcolo (2010 - 2012) under the topic "INT.P01.007 Trustworthy and Secure Future Internet" of the CNR national project "INT.P01 Security".
• PRINCIPAL INVESTIGATOR of the Unit of Research "Interaction models in parallel non-deterministic computation" at Istituto per le Applicazioni del Calcolo of the Project MIUR-PRIN2007 "CONCERTO: Controllo e certificazione dell'uso delle risorse" (2008 - 2009).
• PRINCIPAL INVESTIGATOR CNR activity "Dynamics of Computational Processes", Istituto per le Applicazioni del Calcolo (2000 - 2004).
• PRINCIPAL INVESTIGATOR (for the italian part) of the CNR/CNRS Project "Interazione e Complessità " (2006-2007, O. Laurent was the french principal investigator).
• PRINCIPAL INVESTIGATOR (for the italian part) of the CNR/CNRS Project "Interazione e Complessità " (2004-2005, P. Baillot was the french principal investigator).
• PRINCIPAL INVESTIGATOR (for the italian part) of the CNR/CNRS Project "Valutazioni Ottimali e Parallele del lambda-calcolo" (1996-1997, V. Danos was the french principal investigator).

Participant to the following international research projects:

• Project UE Strep FP7-ICT-2011-9 (MISSION-T2D) Multiscale Immune System SImulator for the Onset of Type 2 Diabetes integrating genetic, metabolic and nutritional data other members of the Unit: see Digital Biology Unit at IAC-CNR and the project site.
• Project UE FP6/2005/NEST-PATH Contract No IST-2006-043241 (Complexdis) - "Unravelling complex diseases with complexity theory: from networks to the bedside" (2007-2009);
• Project UE FP6/2004/IST/Call4 Proposal No IST-2004-028069 (ImmunoGrid) - "The European Virtual Human Immune System Project" (2005-2007);
• Project UE TMR (Linear Logic in Theoretical Computer Science) (1998-2002);
• Project UE INTAS (Analisi Idempotente Lineare e non Lineare) (1997-1998);
• Project CEE HCM - Network (Lambda Calculs Typé es) (1992-1998);
• Project CEE ESPRIT BRA 3272 (Gentzen) (1993-1996).

Participant to the following italian research projects:

• MIUR-COFIN2005, "FOLLIA: Fondazioni Logiche di Linguaggi Astratti di Programmazione" (2005-2006), coordinator Prof. Simonetta Ronchi della Rocca;
• MIUR-COFIN2003, "PROTOCOLLO: dalla prova alla computazione con la logica lineare" (2003-2004), coordinator Prof. Simonetta Ronchi della Rocca;
• MURST-COFIN2001, "Logica Lineare e oltre" (2001-2002) coordinator Prof. Andrea Asperti.

Dynamics of Arithmetics

• One World Numeration (OWN) Seminar This is an online seminar on the topics of the series of Numeration conferences, in the spirit of other One World Seminars. If you want to participate, please contact Wolfgang Steiner with an email to numeration@irif.fr.

Cryptography

• Eurocrypt 2023, Lyon, France on April 23-27, 2023 Submission: 6 October 2022, Early Rejection: 8 December 2022, Notification: 31 January 2023.
• FSE2023 Fast Software Encryption (FSE), Beijing, China on March 20-24 2023, Submission: 23 November 2022; Notification: 23 January 2023.
• Crypto 2022 (Crypto), Santa Barbara, USA, August 13-August 18

Computational Methods in Systems Biology

• WIVACE - XVI Workshop on Artificial Life and Evolutionary Computation Gaeta, 14-16 September 2022 Angevin-Aragonese Castle of Gaeta – Italy.

Logic and Theoretical Computer Science

• Logic Colloquium 2018 July 23 - 28, 2018 Udine, Italy

Participation to Events:

• SIMAI 2018 - MS27 - Discrete Mathematics, Number Theory and Applications to Control -- Department of Engineering, University of Rome La Sapienza Quantum Entanglement and the Bell Matrix July 2-6, 2018 [slides]
• SIMAI 2018 - MS30 - Modeling, Simulation and Data Analysis for Sport -- Department of Engineering, University of Rome La Sapienza Hypothesis Testing in Tennis Point Scoring July 2-6, 2018 [slides]
• PIHOC 2018 - Workshop on Probabilistic Interactive and Higher-Order Computation -- Department of Computer Science, University of Bologna Stream Abstract Machines: Parallel and Non-deterministic execution. February 22-23, 2018 [slides]
• Dipartimento di Matematica e Fisica, Giornata di Vita Universitaria Crypto-Currency: la crittografia e la blockchain -- February 20, 2018 [m4v|pdf|]
• AILA 2017 Stream Abstract Machines: Parallel and Non-deterministic execution25 - 28 Settembre 2017, Padua, Italy [slides]
• WIVACE 2017 Attractors in synchronous and asynchronous genetic regulatory networks XII Workshop on Artificial Life and Evolutionary Computation, Venice, 19-21 September 2017, European Centre for Living Technology, Università Ca' Foscari [slides]
• First General Meeting of the Linear Logic GDRI -- Department of Computer Science, University of Bologna Abstract Machines, Optimal Reduction, and Streams February 1-3, 2016 [slides]
• Second International Conference on Mathematics and Statistics (AUS-ICMS '15) -- American University of Sharjah A multi-threaded algorithm for finding attractors in synchronous and asynchronous genetic regulatory networks April 2-5, 2015 [slides]
• Workshop: Proof and Types 25 years later: Roma Tre University, Sequential and Parallel Abstract Machines for Optimal Reduction -- March, 26-28 2015 [slides]
• Dipartimento di Matematica e Fisica, Giornata di Vita Universitaria Cut and Project: viaggio nella matematica dei quasicristalli -- March 3, 2015 [slides]
• TCS Seminar at DEIK Sequential and Parallel Abstract Machines for Optimal Reduction -- November, 11 2014 [slides]
• Workshop Numeration and Substitutions, University of Debrecen, Generalized golden ratios in ternary alphabets -- July 7 - 11, 2014 [slides].
• Symposium on Trends in Functional Programming: TFP2014, Utrecht University, Soesterberg, Sequential and Parallel Abstract Machines for Optimal Reduction -- May, 26-29 2014 [slides]
• Conference in honour of the 60th birthday of Vilmos Komornik University of Rome "La Sapienza", Rome -- May, 26-28 2014 [slides]

• Computability and Complexity (IN410) (Calcolabilità e complessità, in italian)
• Quantum Computing (IN570) (Quantum Computing, in italian)
• Algorithms for Cryptography (IN450) (Algoritmi per la Crittografia, in italian)
• Quantum Complexity Theory (PhD)

• Computability and Complexity (IN410) (Calcolabilità e complessità, in italian)
• Algorithms for Cryptography (IN450) (Algoritmi per la Crittografia, in italian)

• Computability and Complexity (IN410) (Calcolabilità e complessità, in italian)
• Algorithms for Cryptography (IN450) (Algoritmi per la Crittografia, in italian)

• Computability and Complexity (IN410) (Calcolabilità e complessità, in italian)
• Algorithms for Cryptography (IN450) (Algoritmi per la Crittografia, in italian)

• Algorithms for Cryptography (IN450) (Algoritmi per la Crittografia, in italian)
• Computability and Complexity (IN410) (Calcolabilità e complessità, in italian)

• Information and Computation (IN410) (Modelli di Calcolo)
• Programming Languages (IN490) (Linguaggi di Programmazione)
• Information Theory (IN420) (IN420, Teoria dell'Informazione)

• Algorithms for Cryptography (IN450) (Algoritmi per la Crittografia, in italian)
• Computational Journalism (IEG) (Informatica per l'Editoria e il Giornalismo, in italian)
• Computer Literacy 2 (INAB2) (Abilità Informatiche e Telematiche, in italian)
• Information and Computation (IN410) (IN410, Informatica 2 - Modelli di Calcolo)

• Information Theory (IN420) (IN420, Teoria dell'Informazione, in italian)
• Computational Journalism (IEG) (Informatica per l'Editoria e il Giornalismo, in italian)
• Computer Literacy 2 (INAB2) (Abilità Informatiche e Telematiche, in italian)
• Information and Computation (IN410) (IN410, Informatica 2 - Modelli di Calcolo)

• Algorithms for Cryptography (IN450)
• Computational Journalism (IEG)
• Computer Literacy 2 (INAB2)
• Theory of Computation and Interaction (TCI)

• Theory of Computation and Interaction (TCI)
• Information Theory (IN420)
• Computational Journalism (IEG)

• Theory of Computation and Interaction (TCI)
• Algorithms for Cryptography (IN450)
• Advanced Java Programming (IN430)
• Computational Journalism (IEG)

• Theory of Computation and Interaction (TCI)
• Computational Journalism (IEG)

• Information and Computation (IN410)
• Algorithms for Cryptography (IN450)

• Information and Computation (IN2)
• Information Theory (IN3)

• Theory of Computation and Interaction (TCI)
• Information and Computation (IN2)
• Information Theory (IN3)

• Fundamentals of ICT (FIT)
• Information and Computation (IN2)
• Information Theory (IN3)