 | 2012 |
| 15 |  | Lorenzo Carlucci,
Konrad Zdanowski:
The strength of Ramsey Theorem for coloring relatively large sets
CoRR abs/1204.1134: (2012) |
| 2011 |
| 14 |  | Lorenzo Carlucci,
Nicola Galesi,
Massimo Lauria:
Paris-Harrington Tautologies.
IEEE Conference on Computational Complexity 2011: 93-103 |
| 13 |  | Lorenzo Carlucci,
Gyesik Lee,
Andreas Weiermann:
Sharp thresholds for hypergraph regressive Ramsey numbers.
J. Comb. Theory, Ser. A 118(2): 558-585 (2011) |
| 2010 |
| 12 |  | Lorenzo Carlucci,
Nicola Galesi,
Massimo Lauria:
Paris-Harrington tautologies.
Electronic Colloquium on Computational Complexity (ECCC) 17: 153 (2010) |
| 2009 |
| 11 |  | Lorenzo Carlucci:
Incremental Learning with Ordinal Bounded Example Memory.
ALT 2009: 323-337 |
| 10 |  | Lorenzo Carlucci,
John Case,
Sanjay Jain:
Learning correction grammars.
J. Symb. Log. 74(2): 489-516 (2009) |
| 2008 |
| 9 |  | Lorenzo Carlucci,
John Case,
Sanjay Jain,
Frank Stephan:
Non-U-shaped vacillatory and team learning.
J. Comput. Syst. Sci. 74(4): 409-430 (2008) |
| 2007 |
| 8 |  | Lorenzo Carlucci,
John Case,
Sanjay Jain:
Learning Correction Grammars.
COLT 2007: 203-217 |
| 7 |  | Lorenzo Carlucci,
John Case,
Sanjay Jain,
Frank Stephan:
Results on memory-limited U-shaped learning.
Inf. Comput. 205(10): 1551-1573 (2007) |
| 2006 |
| 6 |  | Lorenzo Carlucci,
John Case,
Sanjay Jain,
Frank Stephan:
Memory-Limited U-Shaped Learning.
COLT 2006: 244-258 |
| 5 |  | Lorenzo Carlucci,
Sanjay Jain,
Efim B. Kinber,
Frank Stephan:
Variations on U-shaped learning.
Inf. Comput. 204(8): 1264-1294 (2006) |
| 2005 |
| 4 |  | Lorenzo Carlucci,
John Case,
Sanjay Jain,
Frank Stephan:
Non U-Shaped Vacillatory and Team Learning.
ALT 2005: 241-255 |
| 3 |  | Lorenzo Carlucci,
Sanjay Jain,
Efim B. Kinber,
Frank Stephan:
Variations on U-Shaped Learning.
COLT 2005: 382-397 |
| 2 |  | Lorenzo Carlucci:
Worms, gaps, and hydras.
Math. Log. Q. 51(4): 342-350 (2005) |
| 2003 |
| 1 |  | Lorenzo Carlucci:
A new proof-theoretic proof of the independence of Kirby-Paris' Hydra Theorem.
Theor. Comput. Sci. 300(1-3): 365-378 (2003) |