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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/20211.164 0 0 0 0 0 174 20 156 331 105 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/20262.261 170 383 839 297 382 190 0 0 0 0 0 0
Totale 12.932