| 2008 |
| 10 | | Emanuele Covino,
Giovanni Pani,
Daniele Scrimieri:
Extending C++ Static Computation of Polynomial-Time Algorithms.
FCS 2008: 90-96 |
| 2007 |
| 9 | | Emanuele Covino,
Giovanni Pani,
Daniele Scrimieri:
Static Computation of Polynomial-time Functions in C++.
FCS 2007: 41-45 |
| 8 | EE | Emanuele Covino,
Giovanni Pani,
Daniele Scrimieri:
Compile-time Computation of Polytime Functions.
J. UCS 13(4): 468-478 (2007) |
| 2005 |
| 7 | | Paolo Buono,
Maria Francesca Costabile,
Emanuele Covino,
Giovanni Pani:
A visual tool for multidimensional data analysis.
DMS 2005: 333-338 |
| 2003 |
| 6 | EE | Emanuele Covino,
Giovanni Pani:
A Refinement of the µ-measure for Stack Programs.
Electr. Notes Theor. Comput. Sci. 90(1): (2003) |
| 2002 |
| 5 | EE | Emanuele Covino,
Giovanni Pani:
An Implicit Recursive Language for the Polynomial Time-space Complexity Classes.
J. UCS 8(1): 75-84 (2002) |
| 2001 |
| 4 | | Salvatore Caporaso,
Emanuele Covino,
Giovanni Pani:
A predicative approach to the classification problem.
J. Funct. Program. 11(1): 95-116 (2001) |
| 2000 |
| 3 | EE | Emanuele Covino,
Giovanni Pani,
Salvatore Caporaso:
Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes.
CIAC 2000: 239-252 |
| 2 | EE | Salvatore Caporaso,
Giovanni Pani,
Emanuele Covino:
Incompleteness in Linear Time.
J. UCS 6(12): 1185-1196 (2000) |
| 1997 |
| 1 | | Salvatore Caporaso,
Michele Zito,
Nicola Galesi,
Emanuele Covino:
Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy.
CIAC 1997: 61-73 |