| 2011 | ||
|---|---|---|
| j6 | Nicola Corriero, Giuseppe Gargiuolo, Giovanni Pani: IFHNFS: fast indexing information in mobile devices. Procedia CS 5: 765-770 (2011) | |
| 2010 | ||
| c5 | Emanuele Covino, Giovanni Pani: Template Metaprogramming, Partial Evaluation and Computational Complexity Classes. FCS 2010: 165-176 | |
| 2008 | ||
| c4 | Emanuele Covino, Giovanni Pani, Daniele Scrimieri: Extending C++ Static Computation of Polynomial-Time Algorithms. FCS 2008: 90-96 | |
| 2007 | ||
| j5 | Emanuele Covino, Giovanni Pani, Daniele Scrimieri: Compile-time Computation of Polytime Functions. J. UCS 13(4): 468-478 (2007) | |
| c3 | Emanuele Covino, Giovanni Pani, Daniele Scrimieri: Static Computation of Polynomial-time Functions in C++. FCS 2007: 41-45 | |
| 2005 | ||
| c2 | Paolo Buono, Maria Francesca Costabile, Emanuele Covino, Giovanni Pani: A visual tool for multidimensional data analysis. DMS 2005: 333-338 | |
| 2003 | ||
| j4 | Emanuele Covino, Giovanni Pani: A Refinement of the µ-measure for Stack Programs. Electr. Notes Theor. Comput. Sci. 90: 37-44 (2003) | |
| 2002 | ||
| j3 | Emanuele Covino, Giovanni Pani: An Implicit Recursive Language for the Polynomial Time-space Complexity Classes. J. UCS 8(1): 75-84 (2002) | |
| 2001 | ||
| j2 | Salvatore Caporaso, Emanuele Covino, Giovanni Pani: A predicative approach to the classification problem. J. Funct. Program. 11(1): 95-116 (2001) | |
| 2000 | ||
| j1 | Salvatore Caporaso, Giovanni Pani, Emanuele Covino: Incompleteness in Linear Time. J. UCS 6(12): 1185-1196 (2000) | |
| c1 | Emanuele Covino, Giovanni Pani, Salvatore Caporaso: Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes. CIAC 2000: 239-252 | |
| 1 | Paolo Buono | |
| 2 | Salvatore Caporaso | |
| 3 | Nicola Corriero | |
| 4 | Maria Francesca Costabile | |
| 5 | Emanuele Covino | |
| 6 | Giuseppe Gargiuolo | |
| 7 | Daniele Scrimieri |
Data released under the ODC-BY 1.0 license — See also our legal information page