CRIS Current Research Information System

DAL LAGO, UGO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.817
AS - Asia 5.776
EU - Europa 4.900
SA - Sud America 430
AF - Africa 199
OC - Oceania 24
Continente sconosciuto - Info sul continente non disponibili 2
Totale 18.148
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.748
CN - Cina 1.753
SG - Singapore 1.713
GB - Regno Unito 1.160
VN - Vietnam 892
IT - Italia 740
NL - Olanda 717
DE - Germania 587
HK - Hong Kong 417
FR - Francia 400
IN - India 366
SE - Svezia 310
BR - Brasile 308
RU - Federazione Russa 240
KR - Corea 206
UA - Ucraina 204
IE - Irlanda 158
JP - Giappone 108
ZA - Sudafrica 100
TR - Turchia 86
EE - Estonia 73
FI - Finlandia 63
AR - Argentina 59
BG - Bulgaria 52
ID - Indonesia 42
BD - Bangladesh 40
AT - Austria 39
ES - Italia 31
CA - Canada 29
CI - Costa d'Avorio 28
MX - Messico 27
IQ - Iraq 24
PH - Filippine 23
TG - Togo 23
AU - Australia 22
BE - Belgio 21
HR - Croazia 21
PL - Polonia 21
TH - Thailandia 19
EC - Ecuador 18
CO - Colombia 16
CH - Svizzera 15
GR - Grecia 15
TW - Taiwan 15
JO - Giordania 13
SC - Seychelles 13
DZ - Algeria 9
PK - Pakistan 9
UY - Uruguay 9
SA - Arabia Saudita 8
CZ - Repubblica Ceca 6
EG - Egitto 6
LT - Lituania 5
MY - Malesia 5
PY - Paraguay 5
AE - Emirati Arabi Uniti 4
DK - Danimarca 4
IR - Iran 4
LB - Libano 4
MA - Marocco 4
PE - Perù 4
UZ - Uzbekistan 4
VE - Venezuela 4
AZ - Azerbaigian 3
BO - Bolivia 3
CL - Cile 3
GE - Georgia 3
HN - Honduras 3
KG - Kirghizistan 3
RO - Romania 3
SN - Senegal 3
TN - Tunisia 3
AL - Albania 2
BH - Bahrain 2
CR - Costa Rica 2
EU - Europa 2
KE - Kenya 2
LU - Lussemburgo 2
MK - Macedonia 2
MT - Malta 2
NP - Nepal 2
QA - Qatar 2
BS - Bahamas 1
BY - Bielorussia 1
CG - Congo 1
CY - Cipro 1
DJ - Gibuti 1
DO - Repubblica Dominicana 1
ET - Etiopia 1
GA - Gabon 1
GD - Grenada 1
GH - Ghana 1
GT - Guatemala 1
HU - Ungheria 1
IL - Israele 1
JM - Giamaica 1
KZ - Kazakistan 1
LV - Lettonia 1
MD - Moldavia 1
MZ - Mozambico 1
Totale 18.134
Salva come PNG Salva come JPEG
Città #
Singapore 1.094
Southend 1.032
Fairfield 749
Kerkrade 649
Ashburn 489
Hefei 472
San Jose 456
Santa Clara 403
Hong Kong 398
Woodbridge 382
Wilmington 318
Seattle 317
Houston 301
Cambridge 288
Bologna 229
Princeton 228
Chandler 224
Ho Chi Minh City 209
Ann Arbor 207
Seoul 193
Beijing 185
Hanoi 165
Dublin 157
Lauterbourg 149
Boardman 147
Dong Ket 127
Jacksonville 110
Nanjing 97
Westminster 95
Dallas 94
Tokyo 93
Berlin 85
Padova 84
Los Angeles 83
Medford 80
Istanbul 71
New York 60
The Dalles 57
Redondo Beach 55
Buffalo 52
San Diego 52
Sofia 52
Saint Petersburg 50
Bengaluru 45
Guangzhou 43
Jinan 42
Des Moines 37
Shenyang 37
Redwood City 36
Da Nang 35
Hebei 35
Mülheim 35
Tianjin 35
Helsinki 34
São Paulo 34
Jakarta 33
Hyderabad 32
Milan 32
Abidjan 28
Nanchang 28
Chicago 27
Amsterdam 26
Shanghai 26
Changsha 24
Munich 24
Council Bluffs 23
Lappeenranta 23
Lomé 23
Nuremberg 22
Zhengzhou 22
Frankfurt am Main 20
Brussels 19
Dearborn 19
Haiphong 19
London 18
Yubileyny 18
Modena 17
Hangzhou 16
Jiaxing 16
Johannesburg 16
Orem 16
Vienna 16
Olalla 15
Verona 15
Rome 14
Warsaw 14
Amman 13
Chennai 13
Marseille 13
Baghdad 12
Lyon 12
Norwalk 12
Redmond 12
Bangkok 11
Hải Dương 11
Issaquah 11
Mahé 11
Portici 11
Shenzhen 11
Tongling 11
Totale 12.111
Salva come PNG Salva come JPEG
Nome #
Counting Qubits and Gates: Resource Analysis in Quantum Programming Languages 691
An invariant cost model for the lambda calculus 199
Beta reduction is invariant, indeed 191
Phase Semantics and Decidability of Elementary Affine Logic 183
The weak lambda-calculus as a reasonable machine 175
A Relational Theory of Effects and Coeffects 174
The geometry of parallelism: Classical, probabilistic, and quantum effects 170
On Measure Quantifiers in First-Order Arithmetic 167
Infinitary Lambda Calculi from a Linear Perspective 165
Effectful Normal Form Bisimulation 165
The machinery of interaction 164
Light logics and higher-order processes 161
A Short Introduction to Implicit Computational Complexity 159
On coinductive equivalences for higher-order probabilistic functional programs 159
A Higher-Order Characterization of Probabilistic Polynomial Time 158
Automating sized-type inference for complexity analysis 158
Probabilistic Recursion Theory and Implicit Computational Complexity 157
The Space of Interaction 157
A Semantic Proof of Polytime Soundness of Light Affine Logic 156
On Applicative Similarity, Sequentiality, and Full Abstraction 154
Decomposing Probabilistic Lambda-Calculi 154
Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories 153
(Leftmost-outermost) beta reduction is invariant, indeed 153
Bounded Linear Logic, Revisited 153
On Model-Checking Higher-Order Effectful Programs 150
Effectful applicative bisimilarity: Monads, relators, and Howe's method 150
Metric reasoning about Lambda-Terms: The general case 150
Effectful program distancing 147
Context Semantics, Linear Logic and Computational Complexity 145
Higher order linear ramified recurrence 145
Differential logical relations, Part I: The simply-typed case 145
Functional Programming in Sublinear Space 144
Computation by interaction for space-bounded functional programming 144
On Counting Propositional Logic and Wagner's Hierarchy 142
Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories 142
Light Logics and the Call-by-value Lambda Calculus 142
Open Higher-Order Logic 141
General Ramified Recurrence is Sound for Polynomial Time 141
Derivational Complexity is an Invariant Cost Model 141
A lambda-calculus foundation for universal probabilistic programming 141
Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages 139
Elementary affine logic and call-by-value lambda-calculus 139
Effectful applicative similarity for call-by-name lambda calculi 139
Automating sized-Type inference and complexity analysis 139
The (In)Efficiency of interaction 139
Tidy: Symbolic Verification of Timed Cryptographic Protocols 137
On the Lattice of Program Metrics 136
A Semantic Proof of Polytime Soundness of Light Affine Logic 136
Towards Randomized Bounded Arithmetic 135
On Dynamic Lifting and Effect Typing in Circuit Description Languages 135
Towards Quantum Multiparty Session Types 135
Quantitative Game Semantics for Linear Logic 135
Linear Dependent Types and Relative Completeness 135
On Quantitative Algebraic Higher-Order Theories 134
On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments 134
Applicative bisimulation and quantum λ-calculi 134
On session types and polynomial time 134
Analysing the complexity of functional programs: Higher-order meets first-order 133
The geometry of linear higher-order recursion 132
Bounded Linear Logic, Revisited 132
On Intersection Types and Probabilistic Lambda Calculi 132
On the termination problem for probabilistic higher-order recursive programs 132
Multi Types and Reasonable Space 131
Curry and Howard Meet Borel 131
Compact and Tractable Automaton-based Representations for Time Granularities 131
Quantitative models and implicit complexity 130
Context semantics, linear logic and computational complexity 130
Parallelism and synchronization in an infinitary context 130
Light Logics and Higher-Order Processes 130
Proofs as efficient programs 128
Complexity Analysis in Presence of Control Operators and Higher-Order Functions 128
On randomised strategies in the λ-calculus 128
A Recursion-Theoretic Characterization of the Probabilistic Class PP 128
On continuation-passing transformations and expected cost analysis 124
Probabilistic termination by monadic affine sized typing 123
The geometry of concurrent interaction: Handling multiple ports by way of multiple tokens 123
On Feller Continuity and Full Abstraction 122
On light logics, uniform encodings and polynomial time 122
Reasonable Space for the Lambda-Calculus, Logarithmically 121
Confluence Results for a Quantum Lambda Calculus with Measurements 121
On Constructor Rewrite Systems and the Lambda-Calculus 120
On higher-order cryptography 120
Probabilistic Operational Semantics for the Lambda Calculus 120
Effectful applicative similarity for call-by-name lambda calculi 120
On the Equivalence of Automaton-based Representations of Time Granularities 119
The geometry of linear higher-order recursion 119
On sharing, memoization, and polynomial time 119
On higher-order probabilistic subrecursion 119
Taming Modal Impredicativity: Superlazy Reduction 118
Intersection types and (positive) almost-sure termination 117
Resource transition systems and full abstraction for linear higher-order effectful programs 116
Linear dependent types in a call-by-value scenario 115
On sharing, memoization, and polynomial time 115
Quantum Implicit Computational Complexity 115
Realizability Models and Implicit Complexity 115
On probabilistic term rewriting 114
Type Inference for Sublinear Space Functional Programming 112
On Quasi-Interpretations, Blind Abstractions and Implicit Complexity 111
A higher-order characterization of probabilistic polynomial time 111
Linear Dependent Types in a Call-by-Value Scenario 109
Totale 14.367
Salva come PNG Salva come JPEG
Categoria #
all - tutte 50.798
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 50.798
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021510 0 0 0 0 0 0 0 0 0 119 88 303
2021/20222.230 211 53 113 336 220 147 67 147 82 40 465 349
2022/20231.546 173 206 74 190 97 176 60 74 285 46 110 55
2023/2024625 38 86 75 85 43 79 43 30 14 53 42 37
2024/20252.810 98 520 193 235 548 74 186 115 51 60 247 483
2025/20266.208 365 630 860 536 544 993 671 381 894 334 0 0
Totale 18.524