last revised 15.03.09
Marco Pedicini
Istituto per le Applicazioni del Calcolo "M. Picone"
Ricercatore CNR
tel: +39 06 7716482 oppure 06 49766813, fax: +39 06 4404306
Events .
- Crypto 2009 August 16-20, 2009, Santa Barbara, California, USA.
Slides
Papers
-
M. Pedicini, M. Piazza,
An application of von Neumann algebras to computational complexity, SILFS Proceedings, OUP in press.
-
V. Komornik, A.C. Lai, M. Pedicini.
Generalized golden ratios of ternary alphabets submitted.
-
M. Pedicini, M. Piazza,
Elementary Complexity into the Hyperfinite II1 Factor contributed paper at CiE07 - Computation and Logic in the Real World 2007, Siena, (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).
-
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).
-
M. Pedicini and F. Quaglia.
PELCR: Parallel Environment for Optimal Lambda Calculus Reduction.
ACM Transactions on Computational Logic,
to appear.
- M. Pedicini.
Greedy expansions and sets with deleted digits.
Theoretical Computer Science, 332 (2005) pp. 313-336.
Elsevier, Amsterdam, The Netherlands.
- 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).
- M. Pedicini and F. Quaglia.
Scheduling vs Communication in PELCR,
Proc. Euro-Par'02, Paderborn (Germany), LNCS,
Spinger-Verlang, August 2002.
- 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, 2001, pp. 235-244.
-
M. Pedicini and F. Quaglia.
A parallel implementation for optimal lambda-calculus reduction.
ACM Proceedings of the 2nd International Conference
on Principles and Practice of Declarative Programming,
pages 3-14. ACM Press, (2000).
- V. Komornik, P. Loreti, and M. Pedicini.
An approximation property of Pisot numbers.
Journal of Number Theory, vol. 80 n. 2, 218-237 (2000)
Academic Press.
-
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).
-
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).
-
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, (1998). Cambridge University Press.
-
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).
- 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).
-
G. F. Mascari and M. Pedicini.
Head linear reduction and pure proof net extraction.
Theoret. Comput. Sci., 135(1):111-137, (1994), Amsterdam, The Netherlands, Elsevier.
PhD Course: