ROSSI, Sabina
 Distribuzione geografica
Continente #
NA - Nord America 13.732
EU - Europa 5.626
AS - Asia 3.002
SA - Sud America 20
OC - Oceania 13
Continente sconosciuto - Info sul continente non disponibili 12
AF - Africa 4
Totale 22.409
Nazione #
US - Stati Uniti d'America 13.583
CN - Cina 2.250
PL - Polonia 1.484
IT - Italia 1.129
UA - Ucraina 542
IE - Irlanda 448
GB - Regno Unito 432
DE - Germania 427
SE - Svezia 414
FI - Finlandia 315
SG - Singapore 304
RU - Federazione Russa 180
HK - Hong Kong 160
CA - Canada 145
TR - Turchia 135
FR - Francia 62
BE - Belgio 42
AT - Austria 33
VN - Vietnam 31
CH - Svizzera 24
ID - Indonesia 18
KR - Corea 18
NL - Olanda 16
GR - Grecia 15
IN - India 14
ES - Italia 12
AU - Australia 11
IR - Iran 11
UZ - Uzbekistan 11
CL - Cile 10
EU - Europa 10
DK - Danimarca 9
LB - Libano 9
BD - Bangladesh 8
BR - Brasile 8
BA - Bosnia-Erzegovina 6
IL - Israele 6
JP - Giappone 6
RO - Romania 6
CZ - Repubblica Ceca 5
BG - Bulgaria 4
PK - Pakistan 4
PT - Portogallo 4
TW - Taiwan 4
HR - Croazia 3
MY - Malesia 3
NO - Norvegia 3
A2 - ???statistics.table.value.countryCode.A2??? 2
AE - Emirati Arabi Uniti 2
EE - Estonia 2
HU - Ungheria 2
LA - Repubblica Popolare Democratica del Laos 2
MA - Marocco 2
MX - Messico 2
NZ - Nuova Zelanda 2
PA - Panama 2
AL - Albania 1
BJ - Benin 1
CO - Colombia 1
CY - Cipro 1
IQ - Iraq 1
LI - Liechtenstein 1
LT - Lituania 1
LU - Lussemburgo 1
ME - Montenegro 1
MM - Myanmar 1
MO - Macao, regione amministrativa speciale della Cina 1
PE - Perù 1
PH - Filippine 1
SI - Slovenia 1
SK - Slovacchia (Repubblica Slovacca) 1
TH - Thailandia 1
ZA - Sudafrica 1
Totale 22.409
Città #
Woodbridge 2.421
Fairfield 1.901
Warsaw 1.464
Chandler 1.116
Houston 963
Jacksonville 951
Ashburn 882
Ann Arbor 817
Seattle 778
Wilmington 626
Cambridge 618
Dublin 446
Mestre 271
Jinan 267
Nanjing 254
Shenyang 206
New York 199
Beijing 198
Singapore 180
Dearborn 171
Venezia 156
San Mateo 154
Hong Kong 153
Izmir 132
Des Moines 125
Hebei 122
Guangzhou 121
Boston 116
Tianjin 113
Southend 109
Mülheim 107
Princeton 106
Andover 103
San Diego 90
Hangzhou 84
Boardman 83
Changsha 79
Zhengzhou 79
Toronto 77
Nanchang 74
Taiyuan 74
Ningbo 62
Jiaxing 61
Taizhou 60
Venice 59
Haikou 55
Ottawa 54
Los Angeles 53
Fuzhou 51
Altamura 48
Saint Petersburg 48
Milan 44
Brussels 41
San Paolo di Civitate 37
London 35
Redwood City 31
Berlin 30
Dong Ket 30
Hefei 28
Vienna 25
Kilburn 21
Washington 21
Norwalk 19
Jakarta 18
Kunming 17
Brooklyn 16
Verona 16
Udine 15
Phoenix 14
Padova 13
Polska 11
Helsinki 10
Puxian 10
Moscow 9
Auburn Hills 8
Bologna 8
Clearwater 8
Edinburgh 8
Fremont 8
Orange 8
Latiano 7
Renton 7
Simi Valley 7
Treviso 7
Winnipeg 7
Zanjan 7
Amsterdam 6
Bari 6
Chicago 6
Hounslow 6
Kemerovo 6
Kitzingen 6
Lanzhou 6
Novokuznetsk 6
Philadelphia 6
Riva 6
Sarajevo 6
Shanghai 6
Xiangfen 6
Dolo 5
Totale 18.221
Nome #
Connectivity and energy-aware preorders for mobile ad-hoc networks 545
Analysis of ECN/RED and SAP-LAW with simultaneous TCP and UDP traffic 512
Behavioural equivalences and interference metrics for mobile ad-hoc networks 503
A Product-Form Model for the Performance Evaluation of a Bandwidth Allocation Strategy in WSNs 502
null 439
On the relations between Markov chain lumpability and reversibility 422
Priority-based bandwidth allocation in wireless sensor networks 411
Performance evaluation of AQM techniques with heterogeneous traffic 407
Persistent Stochastic Non-Interference 407
Dynamic Control of the Join-Queue Lengths in Saturated Fork-Join Stations 405
Quantitative Analysis of Concurrent Reversible Computations 392
A Product-form Model for the Analysis of Systems with Aging Objects 369
Model Checking Adaptive Service Compositions 340
Biased processor sharing in fork-join queues 333
Lumping-based equivalences in Markovian automata: Algorithms and applications to product-form analyses 329
Guest editor's forewords: Special issue on Valuetools 2017 329
A Framework for Throughput and Energy Efficiency in Mobile ad Hoc Networks 284
Product-forms for Probabilistic Input/Output Automata 282
Evaluating Resistance to Jamming and Casual Interception in Mobile Wireless Networks 279
Automatic Energy-aware Performance Analysis of Mobile Ad-hoc Networks 276
A Probabilistic Energy-Aware Model for Mobile Ad-Hoc Networks 269
A Process Algebraic Framework for Estimating the Energy Consumption in Ad-hoc Wireless Sensor Networks 259
On Modular Termination Proofs of General Logic Programs 254
Power control in saturated fork-join queueing systems 251
A Calculus for Power-aware Multicast Communications in Ad Hoc Networks 248
Fair workload distribution for multi-server systems with pulling strategies 242
Information Flow in Secure Contexts 239
Interference-sensitive Preorders for MANETs 235
Declarative Semantics of Input Consuming Logic Programs 231
Automated Verification of Behavioural Properties of Prolog Programs 230
Termination of Well-Typed Logic Programs 230
P-Congruences as Non-Interference for the pi-calculus 229
Sender- and Receiver-centered Interference in Wireless Ad Hoc Networks 224
Performance Analysis and Formal Verification of Cognitive Wireless Networks 219
Aggregation and Truncation of Reversible Markov Chains Modulo State Renaming 219
Information Flow Security for Stochastic Processes 218
Autoreversibility: exploiting symmetries in Markov chains 211
A Process Calculus for Energy-Aware Multicast Communications of Mobile Ad-Hoc Networks 208
Information Flow Security and Recursive Systems 207
On Discrete Time Reversibility modulo State Renaming and its Applications 207
A Proof System for Information Flow Security 205
Refinement Operators and Information Flow Security 204
Action Refinement in Process Algebra and Security Issues 204
Specialising Logic Programs with respect to Call/Post Specifications 203
Compliance Preorders for Web Services. 202
Properties of Input-Consuming Derivations 201
Unwinding Conditions for Security in Imperative Languages 198
Unwinding in Information Flow Security 197
Information Flow Security for Service Compositions. 196
Semantics and Termination of Simply-moded Logic Programs with Dynamic Scheduling 195
Automated Verification of Prolog Programs 195
Bisimulation and Unwinding for Verifying Possibilistic Security Properties 194
Reexecution-Based Analysis of Logic Programs with Delay Declarations. 194
Static vs Dynamic Typing for Access Control in Pi-Calculus 190
Modelling Downgrading in Information Flow Security 188
Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations 185
Specification-based Automatic Verification of Prolog Programs 182
On the relations between Lumpability and Reversibility 182
Compositional Information Flow Security for Concurrent Programs 181
A Theory of Adaptable Contract-based Service Composition. 181
Properties of Input-Consuming Derivations 178
Static Analysis of Prolog with Cut 176
A process algebra for (delimited) persistent stochastic non-interference 176
Transforming processes to check and ensure Information Flow Security 175
Static Analysis of Prolog with Cut 173
Semantics of well-moded input-consuming logic programs 172
Sequence-based Abstract Interpretation of Prolog 172
Non-Interference Proof Techniques for the Analysis of Cryptographic Protocols 171
Compositional information flow security for concurrent programs 170
Context-Sensitive Equivalences for Non-Interference based Protocol Analysis 168
Automated Behavioural Verification of Prolog Programs 166
An Abstract Interpretation Framework which Accurately Handles Prolog Search-Rule and the Cut 165
Information Flow Security in Dynamic Contexts 165
Semantics of input-consuming programs 164
Secure Contexts for Confidential Data 163
Lumping-Based Equivalences in Markovian Automata and Applications to Product-Form Analyses 162
A Security Property for Processes in Dynamic Contexts 160
Bridging Language-Based and Process Calculi Security 158
Information Flow Security in Dynamic Contexts 158
A Theory of Noninterference for the pi-calculus 158
Call-Correct Specialisation of Logic Programs 157
Verifying Persistent Security Properties. 157
Theoretical and experimental evaluation of the two-level processor sharing discipline for TCP flows 156
Termination of Simply Moded Logic Programs with Dynamic Scheduling. 155
Model Checking Adaptive Multilevel Service Compositions 152
PicNic - Pi-calculus Non-Interference checker 151
Proofs Methods for Bisimulation based Information Flow Security 150
CoPS - Checker of Persistent Security 148
A Queueing Model that Works Only on the Biggest Jobs 147
An Abstract Interpretation Framework for (almost) Full Prolog 138
Proportional Lumpability 130
Dynamic resource allocation in fork-join queues 125
Delimited persistent stochastic non-interference 119
Frequency scaling in multilevel queues 111
Fair Work Distribution on Permissioned Blockchains: a Mobile Window Based Approach 105
Contextual Lumpability 98
On the Use of Proof-of-Work in Permissioned Blockchains: Security and Fairness 97
Speed scaling in fork-join queues: A comparative study 92
Smart-RED: A novel congestion control mechanism for high throughput and low queuing delay 89
Controlling Information Release in the pi-calculus 86
Totale 22.186
Categoria #
all - tutte 65.796
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 65.796


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20204.784 0 324 403 1.113 345 454 347 560 442 402 248 146
2020/20214.397 279 208 354 182 586 372 448 229 230 454 660 395
2021/20223.698 438 585 273 464 292 53 125 109 91 345 648 275
2022/20232.992 210 276 53 354 363 793 139 242 293 18 210 41
2023/20241.410 73 74 66 42 146 294 82 82 158 62 197 134
2024/202583 57 26 0 0 0 0 0 0 0 0 0 0
Totale 22.881