NAPOLI, Margherita
 Distribuzione geografica
Continente #
NA - Nord America 3.208
EU - Europa 722
AS - Asia 271
SA - Sud America 10
Continente sconosciuto - Info sul continente non disponibili 4
AF - Africa 2
OC - Oceania 1
Totale 4.218
Nazione #
US - Stati Uniti d'America 3.201
UA - Ucraina 259
CN - Cina 192
IT - Italia 186
DE - Germania 76
IE - Irlanda 69
SE - Svezia 57
FI - Finlandia 55
TR - Turchia 51
VN - Vietnam 17
BR - Brasile 10
CA - Canada 7
GB - Regno Unito 6
EU - Europa 4
FR - Francia 4
IN - India 4
IL - Israele 3
JP - Giappone 2
KR - Corea 2
PL - Polonia 2
RU - Federazione Russa 2
AT - Austria 1
AU - Australia 1
BG - Bulgaria 1
CM - Camerun 1
HR - Croazia 1
LU - Lussemburgo 1
NE - Niger 1
PT - Portogallo 1
RO - Romania 1
Totale 4.218
Città #
Ann Arbor 1.033
Wilmington 369
Jacksonville 316
Woodbridge 307
Chandler 285
Houston 229
Princeton 212
Dublin 69
Nanjing 60
Andover 54
Izmir 51
Salerno 46
Pellezzano 42
Mestre 38
Boardman 33
Beijing 20
Düsseldorf 20
Shenyang 20
Fairfield 19
Hebei 19
Jiaxing 18
Dong Ket 16
Nanchang 16
Ashburn 14
Changsha 13
Dearborn 13
Norwalk 12
Tianjin 8
Somma 7
Des Moines 6
Ottawa 6
San Diego 6
Avellino 5
Napoli 5
Cambridge 4
Los Angeles 4
Philadelphia 4
Spinea 4
Borgia 3
Guangzhou 3
Jinan 3
Pune 3
Redwood City 3
Cachan 2
Catania 2
Dormagen 2
Edinburgh 2
Fuzhou 2
Grevenbroich 2
San Martino Valle Caudina 2
Tokyo 2
Warsaw 2
Washington 2
Aiello Del Sabato 1
Atlanta 1
Brisbane 1
Chino Hills 1
Hanoi 1
Helsinki 1
Kunming 1
Lanzhou 1
Lappeenranta 1
Las Vegas 1
Lisbon 1
London 1
Luxembourg 1
Montreal 1
Mumbai 1
Phoenix 1
Plymouth 1
Rio de Janeiro 1
Romano Di Lombardia 1
Rome 1
San Leucio 1
Seattle 1
Secaucus 1
Sofia 1
Southwark 1
Taiyuan 1
Taizhou 1
Venezia 1
Vienna 1
Woodland Hills 1
Xian 1
Yellow Springs 1
Zagreb 1
Zhengzhou 1
Totale 3.472
Nome #
Proceedings First Symposium on Games, Automata, Logic, and Formal Verification 144
Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints 137
null 132
Synchronization of a Line of Identical Processors at a Given Time 114
Verification of Scope-dependent Hierarchical State Machines 109
Timed tree Automata with an application to Temporal Logic 105
A Decidable Dense Branching-time Temporal Logic 104
Succinctness of descriptions of SBTA-languages 102
A Compositional Approach to Synchronize Two Dimensional Networks of Processors 100
Web structures: a tool for representing and manipulating programs 100
Verification of Succinct Hierarchical State Machines 99
Representing hyper-graphs by regular languages 98
The word problem for visibly pushdown languages described by grammars 93
Hierarchical and Recursive State Machines with Context-Dependent Properties 88
Testing Programs by Queries 88
Compositionality in the Synchronization of Processors Exchanging a minimal amount of Information 84
Parametric metric interval temporal logic 83
Scope-Bounded Pushdown Languages 82
Graded CTL model checking for test generation. 81
Systolic Y-tree automata: closure properties and decision problemsFundamentals of Computation Theory 80
A Temporal Logic for Multi-threaded Programs 78
Synchronization of 1-way connected processors 77
Proceedings of First International Symposium on Games, Automata, Logics and Formal Verification (GANDALF 2010) 77
Coalitional Games with Priced-Resource Agents 77
Different Time Solutions for the Firing Squad Synchronization Problem on Basic Grid Networks 76
C-tree systolic automata 76
Graded Alternating-Time Temporal Logic 74
Scope-Bounded Pushdown Languages 73
Program Complexity in Hierarchical Module Checking 72
Graded-CTL: Satisfiability and Symbolic Model Checking 71
Specification and Verification of Protocols With Time Constraints 70
Finite automata on timed omega-trees. 70
Representing Infinite hyper-graphs by regular languages 68
A NuSMV Extension for Graded-CTL Model Checking 68
null 67
Graded Alternating-Time Temporal Logic 66
On a Logic for Coalitional Games with Priced-Resource Agents 66
Synchronization of a line of identical processors at a given timeTAPSOFT '97: Theory and Practice of Software Development 63
CTL Model-Checking with Graded Quantifiers 62
Model checking coalitional games in shortage resource scenarios 62
Weak Muller acceptance conditions for tree automata 61
Automata-based Representations for Infinite Graphs 61
Languages accepted by systolic Y-tree automata: structural characterizations 59
On the Membership Problem for Visibly Pushdown Languages 58
Parametric Metric Interval Temporal Logic 58
A Model of Finite Automata on Timed omega-Trees 57
MODEL-CHECKING FOR GRADED CTL 57
State complexity of SBTA languagesLATIN '95: Theoretical Informatics 56
Parallel Word Substitution 55
Weak Muller Acceptance Conditions for Tree Automata 52
Graded Alternating Time Temporal Logic 50
Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations 50
A Unifying Approach for Multistack Pushdown Automata 47
Proceeding of the 1st International Sumposium on Games, Automata, Logics and Formal Verification (GANDALF 2010) 44
Power of interconnections and of nondeterminism in regularY-tree systolic automata 44
Minimum and non-minimum time solutions to the firing squad synchronization problem 32
Synchronization of 1-way connected processorsFundamentals of Computation Theory 18
Reachability of scope-bounded multistack pushdown systems 14
Synchronization of a line of identical processors at a given time 14
Totale 4.323
Categoria #
all - tutte 10.336
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 10.336


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/201993 0 0 0 0 0 0 0 0 0 0 88 5
2019/2020538 193 2 58 2 53 16 58 4 54 28 62 8
2020/2021439 4 56 53 0 52 14 58 0 103 3 66 30
2021/2022357 0 0 0 4 16 1 5 13 55 50 46 167
2022/2023630 62 47 3 82 88 141 1 65 100 4 31 6
2023/2024109 16 36 11 10 7 6 7 2 1 12 1 0
Totale 4.323