SANGIORGI, DAVIDE
 Distribuzione geografica
Continente #
NA - Nord America 5.827
AS - Asia 4.273
EU - Europa 3.736
SA - Sud America 319
AF - Africa 154
OC - Oceania 9
Continente sconosciuto - Info sul continente non disponibili 3
Totale 14.321
Nazione #
US - Stati Uniti d'America 5.771
GB - Regno Unito 1.495
CN - Cina 1.368
SG - Singapore 1.204
VN - Vietnam 751
IT - Italia 442
DE - Germania 429
FR - Francia 268
HK - Hong Kong 246
UA - Ucraina 223
IN - India 222
BR - Brasile 220
RU - Federazione Russa 212
SE - Svezia 133
IE - Irlanda 126
TR - Turchia 107
KR - Corea 91
HR - Croazia 88
ZA - Sudafrica 84
JP - Giappone 83
EE - Estonia 64
RO - Romania 57
FI - Finlandia 48
AR - Argentina 34
BD - Bangladesh 32
ID - Indonesia 29
CA - Canada 27
PH - Filippine 26
AT - Austria 23
GR - Grecia 23
CI - Costa d'Avorio 22
EC - Ecuador 21
BE - Belgio 19
DK - Danimarca 19
SC - Seychelles 19
IQ - Iraq 18
TH - Thailandia 17
NL - Olanda 16
CH - Svizzera 15
MX - Messico 14
CL - Cile 11
CO - Colombia 11
PK - Pakistan 10
TW - Taiwan 10
AU - Australia 9
ES - Italia 9
PL - Polonia 8
SA - Arabia Saudita 8
TG - Togo 8
KZ - Kazakistan 6
LB - Libano 6
MY - Malesia 6
TN - Tunisia 6
VE - Venezuela 6
CR - Costa Rica 5
JO - Giordania 5
SK - Slovacchia (Repubblica Slovacca) 5
UZ - Uzbekistan 5
CZ - Repubblica Ceca 4
GT - Guatemala 4
KE - Kenya 4
PE - Perù 4
PY - Paraguay 4
UY - Uruguay 4
IL - Israele 3
NP - Nepal 3
OM - Oman 3
AE - Emirati Arabi Uniti 2
BG - Bulgaria 2
BO - Bolivia 2
EG - Egitto 2
ET - Etiopia 2
EU - Europa 2
JM - Giamaica 2
LK - Sri Lanka 2
LU - Lussemburgo 2
PT - Portogallo 2
RE - Reunion 2
SI - Slovenia 2
SY - Repubblica araba siriana 2
A1 - Anonimo 1
AM - Armenia 1
AZ - Azerbaigian 1
BH - Bahrain 1
BN - Brunei Darussalam 1
BS - Bahamas 1
BW - Botswana 1
CG - Congo 1
CV - Capo Verde 1
DO - Repubblica Dominicana 1
GH - Ghana 1
GY - Guiana 1
IR - Iran 1
KG - Kirghizistan 1
LA - Repubblica Popolare Democratica del Laos 1
MA - Marocco 1
MD - Moldavia 1
NI - Nicaragua 1
PS - Palestinian Territory 1
RS - Serbia 1
Totale 14.319
Città #
Southend 1.383
Singapore 749
Fairfield 586
Chandler 379
Ashburn 370
Santa Clara 348
Dallas 336
Ann Arbor 296
Woodbridge 280
Wilmington 265
Seattle 264
San Jose 239
Hong Kong 230
Hefei 223
Houston 210
Princeton 202
Cambridge 188
Dong Ket 157
Beijing 154
Jacksonville 152
Ho Chi Minh City 151
Dublin 124
Boardman 121
Lauterbourg 117
Hanoi 116
Istanbul 98
Bologna 96
New York 94
Westminster 88
Nanjing 82
Seoul 76
Padova 75
Tokyo 72
Medford 64
Los Angeles 57
Jinan 56
Bucharest 53
Buffalo 44
Shenyang 44
Saint Petersburg 43
Turin 43
Berlin 41
The Dalles 41
Nanchang 34
Changsha 32
Mülheim 31
Shanghai 30
Frankfurt am Main 28
Redondo Beach 27
Hebei 26
São Paulo 26
Tianjin 25
Hangzhou 23
Abidjan 22
Guangzhou 22
Da Nang 21
Fremont 21
Helsinki 21
Nuremberg 21
San Diego 21
Chicago 20
Dearborn 20
Haiphong 20
Jiaxing 19
Norwalk 19
Zhengzhou 19
Bengaluru 18
Mahé 18
Haikou 17
Jakarta 17
Kunming 15
Lappeenranta 15
Ningbo 15
Olalla 15
Phoenix 15
Brussels 14
Council Bluffs 14
Redwood City 13
Brooklyn 12
Copenhagen 12
Fuzhou 12
Taizhou 12
Biên Hòa 11
Des Moines 11
Jyväskylä 11
Milan 11
San Francisco 11
Bern 10
Grafing 10
London 10
Montreal 10
Verona 10
Yubileyny 10
Baghdad 9
San Venanzo 9
Vienna 9
Bangkok 8
Can Tho 8
Lomé 8
Rio de Janeiro 8
Totale 9.763
Nome #
A Component Model for the ABS Language 229
Bisimulation and Coinduction Enhancements: A Historical Perspective 212
A hybrid type system for lock-freedom of mobile processes 203
A Correct Abstract Machine for Safe Ambients. 198
The Servers of Serverless Computing: A Formal Revisitation of Functions as a Service 197
Environmental bisimulations for higher-order languages 195
Asynchronous π -calculus at Work: The Call-by-Need Strategy 194
On asynchrony in name-passing calculi 193
Separability in the Ambient Logic 190
Introduction to bisimulation and coinduction 188
Environmental bisimulations for probabilistic higher-order languages 185
An Object Group-Based Component Model 182
Unique solutions of contractions, CCS, and their HOL formalisation 180
Eager functions as processes 180
Playing with bisimulation in erlang 179
Advanced Topics in Bisimulation and Coinduction 171
Towards an Algebraic Theory of Typed Mobile Processes 168
Concurrency Theory: A Historical Perspective on Coinduction and Process Calculi 168
An efficient abstract machine for Safe Ambients 167
Equations, contractions, and unique solutions 167
Functions as Processes: Termination and the lambda mu mu~ - Calculus 166
DIVERGENCE AND UNIQUE SOLUTION OF EQUATIONS 165
A Model of Evolvable Components 162
Concurrency theory: timed automata, testing, program synthesis 162
A Hybrid Type System for Lock-Freedom of Mobile Processes 162
Light logics and higher-order processes 161
On the Expressiveness of the Ambient Logic 160
Mobile Processes and Termination 160
On coinductive equivalences for higher-order probabilistic functional programs 160
From Enhanced Coinduction towards Enhanced Induction 159
Ensuring termination by typability 159
Strong Normalisation in λ-Calculi with References 158
Towards ‘up to context’ reasoning about higher-order processes 158
On Applicative Similarity, Sequentiality, and Full Abstraction 155
On the representation of McCarthy's amb in the Pi-calculus 154
Bisimulation and Co-induction: Some Problems 154
Safe Ambients: Abstract machine and distributed implementation 154
Bisimulations up-to: Beyond first-order transition systems 151
The proof technique of unique solutions of contractions 151
On the representation of references in the Pi-Calculus 151
Ensuring Termination by Typability 149
On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi 146
Beyond Bisimulation: The "up-to" Techniques 145
Bisimulation: From The Origins to Today 145
Higher-order languages: Bisimulation and coinductive equivalences (extended abstract) 144
Name-passing calculi: From fusions to preorders and types 143
Towards a Calculus For Wireless Systems 141
Symmetries and dualities in name-passing process calculi 140
Enhancements of the bisimulation proof method 140
On the Complexity of Termination Inference for Processes 139
Termination in Impure Concurrent Languages 138
Equations, contractions, and unique solutions 138
Trustworthy Global Computing, International Symposium, LNCS 3705 137
Bisimilarity via unique-solution techniques 137
Ownership Types for the Join Calculus 136
On the origins of bisimulation and coinduction 136
Session types revisited 136
On the Expressiveness and Decidability of Higher-Order Process Calculi 136
Eager functions as processes 135
Duality and i/o-Types in the π-Calculus 134
Towards an algebraic theory of typed mobile processes 134
Termination in higher-order concurrent calculi 134
Environmental Bisimulations for Higher-Order Languages 133
Divergence and unique solution of equations 133
Termination in Higher-Order Concurrent Calculi 132
On the discriminating power of passivation and higher-order interaction 131
On the discriminating power of testing equivalences for reactive probabilistic systems: Results and open problems 131
Light Logics and Higher-Order Processes 131
Trees from functions as processes 129
Tools and Verification 128
EXPRESSing Session Types 127
Origins of bisimulation and coinduction 127
Type Systems for Bigraphs 127
Sensoria 126
Logical Bisimulations and Functional Languages 126
Games, Mobile Processes, and Functions 125
The pi-calculus 125
Static and dynamic typing for the termination of mobile processes 125
Unique solutions of contractions, CCS, and their HOL formalisation 125
Session types revisited 124
Trees from functions as processes 122
Enhanced Induction in Behavioural Relations 121
Termination of processes 121
Session Types Revisited: A Decade Later 120
SCC: a Service Centered Calculus 119
The Bisimulation Proof Method: Enhancements and Open Problems 119
HATS Abstract Behavioral Specification: The Architectural View 116
On the Expressiveness of Polyadicity in Higher-Order Process Calculi 115
Types in concurrency 112
Name-Passing Calculi: From Fusions to Preorders and Types2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science 111
Environmental bisimulations for probabilistic higher-order languages 111
An Abstract Account of Up-to Techniques for Inductive Behavioural Relations 110
On sequentiality and well-bracketing in the π-calculus 109
On the Representation of McCarthy's amb in the pi-calculus 104
null 102
Modular coinduction up-to for higher-order languages via first-order transition systems 86
On the expressiveness and decidability of higher-order process calculi 81
Extensional and Non-extensional Functions as Processes 80
null 75
An operational semantics for a calculus for wireless systems 71
Totale 14.381
Categoria #
all - tutte 39.410
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 39.410


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021378 0 0 0 0 0 0 0 0 0 0 95 283
2021/20221.808 264 55 115 93 176 95 33 122 78 23 414 340
2022/20231.473 241 191 68 176 120 153 40 71 191 25 136 61
2023/2024458 23 59 27 30 20 101 72 21 11 54 21 19
2024/20251.855 29 302 173 138 456 86 222 17 32 37 64 299
2025/20263.871 170 383 839 297 382 217 449 146 624 273 91 0
Totale 14.542