On the Necessity of U‐Shaped Learning L Carlucci, J Case Topics in cognitive Science 5 (1), 56-88, 2013 | 75 | 2013 |

Results on memory-limited U-shaped learning L Carlucci, J Case, S Jain, F Stephan Information and Computation 205 (10), 1551-1573, 2007 | 42* | 2007 |

Unprovability results involving braids L Carlucci, P Dehornoy, A Weiermann Proceedings of the London Mathematical Society 102 (1), 159-192, 2011 | 21 | 2011 |

Variations on U-shaped learning L Carlucci, S Jain, E Kinber, F Stephan Information and Computation 204 (8), 1264-1294, 2006 | 20 | 2006 |

Non U-shaped vacillatory and team learning L Carlucci, J Case, S Jain, F Stephan International Conference on Algorithmic Learning Theory, 241-255, 2005 | 19 | 2005 |

Non-U-shaped vacillatory and team learning L Carlucci, J Case, S Jain, F Stephan Journal of Computer and System Sciences 74 (4), 409-430, 2008 | 15 | 2008 |

Worms, gaps, and hydras L Carlucci Mathematical Logic Quarterly 51 (4), 342-350, 2005 | 15 | 2005 |

Sharp thresholds for hypergraph regressive Ramsey numbers L Carlucci, G Lee, A Weiermann Journal of Combinatorial Theory, Series A 118 (2), 558-585, 2011 | 12 | 2011 |

Learning correction grammars L Carlucci, J Case, S Jain The Journal of Symbolic Logic 74 (2), 489-516, 2009 | 12 | 2009 |

Variations on U-shaped learning L Carlucci, S Jain, E Kinber, F Stephan International Conference on Computational Learning Theory, 382-397, 2005 | 11 | 2005 |

“Weak yet strong” restrictions of Hindman’s Finite Sums Theorem L Carlucci Proceedings of the American Mathematical Society 146 (2), 819-829, 2018 | 10 | 2018 |

Classifying the phase transition threshold for regressive Ramsey functions L Carlucci, G Lee, A Weiermann preprint, 2006 | 10 | 2006 |

A weak variant of Hindman’s Theorem stronger than Hilbert’s Theorem L Carlucci Archive for Mathematical Logic 57 (3), 381-389, 2018 | 9 | 2018 |

A new proof-theoretic proof of the independence of Kirby–Paris’ Hydra Theorem L Carlucci Theoretical Computer Science 300 (1-3), 365-378, 2003 | 9 | 2003 |

U-shaped learning may be necessary 3 L Carluccia, J Caseb, S Jainc, F Stephand | 8 | 2005 |

A note on Hindman-type theorems for uncountable cardinals L Carlucci Order 36 (1), 19-22, 2019 | 7 | 2019 |

The strength of Ramsey’s theorem for coloring relatively large sets L Carlucci, K Zdanowski The Journal of Symbolic Logic 79 (1), 89-102, 2014 | 6 | 2014 |

New bounds on the strength of some restrictions of Hindman’s Theorem L Carlucci, LA Kołodziejczyk, F Lepore, K Zdanowski Computability 9 (2), 139-153, 2020 | 4 | 2020 |

Paris-harrington tautologies L Carlucci, N Galesi, M Lauria 2011 IEEE 26th Annual Conference on Computational Complexity, 93-103, 2011 | 4 | 2011 |

Restrictions of Hindman’s Theorem: An Overview L Carlucci Conference on Computability in Europe, 94-105, 2021 | 3 | 2021 |