| 2007 |
|---|
| 10 | EE | Salvatore Caporaso,
Nicola Corriero:
Kleene, Rogers and Rice Theorems Revisited in C and in Bash
CoRR abs/0712.1279: (2007) |
| 2006 |
|---|
| 9 | EE | Salvatore Caporaso:
A Predicative Harmonization of the Time and Provable Hierarchies
CoRR abs/cs/0609130: (2006) |
| 8 | EE | Salvatore Caporaso:
A decidable characterization of the classes between lintime and exptime.
Inf. Process. Lett. 97(1): 36-40 (2006) |
| 2001 |
|---|
| 7 | | Salvatore Caporaso,
Emanuele Covino,
Giovanni Pani:
A predicative approach to the classification problem.
J. Funct. Program. 11(1): 95-116 (2001) |
| 6 | EE | Salvatore Caporaso,
Michele Zito,
Nicola Galesi:
A predicative and decidable characterization of the polynomial classes of languages.
Theor. Comput. Sci. 250(1-2): 83-99 (2001) |
| 2000 |
|---|
| 5 | EE | Emanuele Covino,
Giovanni Pani,
Salvatore Caporaso:
Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes.
CIAC 2000: 239-252 |
| 4 | EE | Salvatore Caporaso,
Giovanni Pani,
Emanuele Covino:
Incompleteness in Linear Time.
J. UCS 6(12): 1185-1196 (2000) |
| 1998 |
|---|
| 3 | EE | Salvatore Caporaso,
Michele Zito:
On a Relation Between Uniform Coding and Problems of the Form DTIMEF(F) =? DSPACEF(F).
Acta Inf. 35(8): 665-672 (1998) |
| 1997 |
|---|
| 2 | | Salvatore Caporaso,
Michele Zito,
Nicola Galesi,
Emanuele Covino:
Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy.
CIAC 1997: 61-73 |
| 1996 |
|---|
| 1 | | Salvatore Caporaso:
Safe Turing Machines, Grzegorczyk Classes and Polytime.
Int. J. Found. Comput. Sci. 7(3): 241-252 (1996) |
