29.3k citations
- A. Savoy-Navarro6 profiles49 · h 111
- J. Cuevas3 profiles49 · h 118
- M. Feindt3 profiles49 · h 111
- P. Renton6 profiles49 · h 60
- R. Orava4 profiles49 · h 78
- F. Šforza41
- M. Houlden5 profiles35 · h 50
- B. Stelzer9 profiles31 · h 88
- L. Lyons5 profiles30 · h 118
- M. Stanitzki5 profiles30 · h 87
- G. Gomez Ceballos29
- L. Brigliadori2 profiles29 · h 111
- University of PaduaIT67 papers
- Istituto Nazionale di Fisica Nucleare, Sezione di PadovaIT64 papers
- Institute for High Energy PhysicsES59 papers
- Centre National de la Recherche ScientifiqueFR56 papers
- University of TriesteIT55 papers
- University of BolognaIT52 papers
- Joint Institute for Nuclear ResearchRU51 papers
- Karlsruhe Institute of TechnologyDE51 papers
- National and Kapodistrian University of AthensGR51 papers
- University of LiverpoolGB51 papers
- University of OxfordGB51 papers
- Laboratoire de Physique Nucléaire et de Hautes ÉnergiesFR50 papers
Showing 2003Show all
3 papers · 1 filter
cs.LO2003
Temporalized logics and automata for time granularity
M. Franceschet, A. Montanari
Suitable extensions of the monadic second-order theory of k successors have been proposed in the literature to capture the notion of time granularity. In this paper, we provide the…
math.NT2003★ 1 cited
A lower bound for the height of a rational function at -unit points
Pietro Corvaja, Umberto Zannier
Let be a finitely generated subgroup of the multiplicative group $\G_m^2(\bar{Q})$. Let $p(X,Y),q(X,Y)\in\bat{Q}$ be two coprime polynomials not both vanishing at ; let…
cs.PL2003★ 2 cited
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
Agostino Dovier, Carla Piazza, Gianfranco Rossi
Lists, multisets, and sets are well-known data structures whose usefulness is widely recognized in various areas of Computer Science. These data structures have been analyzed from…