MAUGERI, PIETRO
 Distribuzione geografica
Continente #
NA - Nord America 175
EU - Europa 112
AS - Asia 59
AF - Africa 15
SA - Sud America 12
Totale 373
Nazione #
US - Stati Uniti d'America 169
SG - Singapore 51
IT - Italia 43
IE - Irlanda 28
BR - Brasile 12
DE - Germania 12
FI - Finlandia 8
NG - Nigeria 6
RU - Federazione Russa 6
CA - Canada 5
CI - Costa d'Avorio 5
GB - Regno Unito 4
ZA - Sudafrica 4
BD - Bangladesh 3
UA - Ucraina 3
GR - Grecia 2
PL - Polonia 2
RO - Romania 2
AE - Emirati Arabi Uniti 1
CH - Svizzera 1
CN - Cina 1
IL - Israele 1
IN - India 1
MX - Messico 1
NL - Olanda 1
PK - Pakistan 1
Totale 373
Città #
Santa Clara 71
Singapore 30
Dublin 28
Andover 13
Boardman 10
Chandler 9
Bremen 8
Cambridge 8
Lawrence 8
Catania 7
Helsinki 7
Palermo 7
Abuja 6
Abidjan 5
Chicago 5
Civitanova Marche 5
San Mateo 5
Des Moines 4
Johannesburg 4
Ottawa 4
Ancona 3
Tower Hamlets 3
Cagliari 2
Horia 2
Lentini 2
Modica 2
Munich 2
Nuremberg 2
Porto Recanati 2
Saint Petersburg 2
Acaraú 1
Amsterdam 1
Ann Arbor 1
Aparecida de Goiânia 1
Assis 1
Brasília 1
Campinas 1
Catalão 1
Chandigarh 1
Clifton 1
Dubai 1
Faisalabad 1
Lappeenranta 1
Latina 1
Massapequa 1
Mexico City 1
Natore 1
Niscemi 1
Ouro Preto do Oeste 1
Pedreira 1
Piancó 1
Rome 1
São Gonçalo 1
São José dos Pinhais 1
São Paulo 1
Tel Aviv 1
Toronto 1
Wilmington 1
Zhengzhou 1
Totale 295
Nome #
A potential-based variant of the Bellman-Ford algorithm 54
Polynomial-time satisfiability tests for ’small’ membership theories 44
On the convexity of a fragment of pure set theory with applications within a nelson-oppen framework 41
A quadratic reduction of constraints over nested sets to purely boolean formulae in CNF 40
Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’ languages involving membership 39
Polynomial-time satisfiability tests for Boolean fragments of set theory 38
Two crucial cubic-time components of polynomial-maximal decidable Boolean languages 36
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case 34
Complexity assessments for decidable fragments of Set Theory. III Testers for Crucial, Polynomial-Maximal Decidable Boolean Languages 26
A complete complexity taxonomy of ‘small’ fragments of theory Multi-Level Syllogistic 26
The Satisfiability Problem for Boolean Set Theory with a Rational Choice Correspondence 10
Complexity Results for Some Fragments of Set Theory Involving the Unordered Cartesian Product Operator 6
Totale 394
Categoria #
all - tutte 1.739
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 1.739


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20206 0 0 0 0 0 0 0 0 0 0 2 4
2020/202122 4 1 0 0 7 1 4 1 2 0 0 2
2021/202253 1 10 2 0 5 0 17 1 5 0 2 10
2022/202371 8 0 0 9 1 14 0 8 17 0 1 13
2023/202456 4 13 1 4 2 0 6 2 0 10 12 2
2024/2025180 3 15 14 8 50 32 4 19 12 23 0 0
Totale 394