CRIS Current Research Information System

DAL LAGO, UGO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 7.433
AS - Asia 5.948
EU - Europa 5.057
SA - Sud America 438
Continente sconosciuto - Info sul continente non disponibili 378
AF - Africa 203
OC - Oceania 24
Totale 19.481
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 7.320
CN - Cina 1.772
SG - Singapore 1.729
GB - Regno Unito 1.163
VN - Vietnam 892
IT - Italia 877
NL - Olanda 722
DE - Germania 592
HK - Hong Kong 426
FR - Francia 404
IN - India 366
SE - Svezia 311
BR - Brasile 310
RU - Federazione Russa 240
KR - Corea 206
UA - Ucraina 204
BD - Bangladesh 168
IE - Irlanda 158
JP - Giappone 108
ZA - Sudafrica 100
TR - Turchia 86
EE - Estonia 73
FI - Finlandia 63
AR - Argentina 59
BG - Bulgaria 52
CA - Canada 45
ID - Indonesia 42
AT - Austria 39
MX - Messico 33
ES - Italia 32
CI - Costa d'Avorio 28
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 17
SC - Seychelles 17
CH - Svizzera 15
GR - Grecia 15
TW - Taiwan 15
JO - Giordania 13
DZ - Algeria 9
PK - Pakistan 9
UY - Uruguay 9
SA - Arabia Saudita 8
CZ - Repubblica Ceca 6
EG - Egitto 6
HN - Honduras 6
JM - Giamaica 6
CL - Cile 5
LT - Lituania 5
MY - Malesia 5
PE - Perù 5
PY - Paraguay 5
AE - Emirati Arabi Uniti 4
CR - Costa Rica 4
DK - Danimarca 4
IR - Iran 4
LB - Libano 4
MA - Marocco 4
UZ - Uzbekistan 4
VE - Venezuela 4
AZ - Azerbaigian 3
BO - Bolivia 3
GE - Georgia 3
GT - Guatemala 3
KG - Kirghizistan 3
PR - Porto Rico 3
RO - Romania 3
SN - Senegal 3
SV - El Salvador 3
TN - Tunisia 3
TT - Trinidad e Tobago 3
AL - Albania 2
BH - Bahrain 2
EU - Europa 2
KE - Kenya 2
LU - Lussemburgo 2
MD - Moldavia 2
MK - Macedonia 2
MT - Malta 2
NI - Nicaragua 2
NP - Nepal 2
QA - Qatar 2
SR - Suriname 2
BB - Barbados 1
BS - Bahamas 1
BY - Bielorussia 1
BZ - Belize 1
CG - Congo 1
CY - Cipro 1
DJ - Gibuti 1
DO - Repubblica Dominicana 1
ET - Etiopia 1
GA - Gabon 1
Totale 19.087
Salva come PNG Salva come JPEG
Città #
Singapore 1.108
Southend 1.032
Fairfield 749
Kerkrade 649
San Jose 571
Ashburn 537
Hefei 472
Santa Clara 419
Hong Kong 406
Woodbridge 384
Wilmington 318
Seattle 317
Houston 304
Cambridge 288
Bologna 255
Princeton 228
Chandler 224
Ho Chi Minh City 209
Ann Arbor 207
Beijing 199
Seoul 193
Hanoi 165
Dublin 158
Boardman 151
Lauterbourg 149
Dong Ket 127
Council Bluffs 122
Jacksonville 115
Dallas 97
Nanjing 97
Westminster 95
Los Angeles 94
Tokyo 93
Berlin 85
Padova 84
Medford 81
New York 72
Istanbul 71
Buffalo 62
The Dalles 57
Redondo Beach 55
San Diego 52
Sofia 52
Milan 51
Saint Petersburg 50
Bengaluru 45
Guangzhou 43
Jinan 42
Des Moines 39
Shenyang 37
Mülheim 36
Redwood City 36
Da Nang 35
Hebei 35
Tianjin 35
Helsinki 34
São Paulo 34
Jakarta 33
Chicago 32
Hyderabad 32
Abidjan 28
Nanchang 28
Amsterdam 27
Shanghai 27
Changsha 24
Munich 24
Lappeenranta 23
Lomé 23
Nuremberg 22
Zhengzhou 22
Frankfurt am Main 20
Brussels 19
Dearborn 19
Haiphong 19
Modena 19
London 18
Yubileyny 18
Orem 17
Rome 17
Hangzhou 16
Jiaxing 16
Johannesburg 16
Vienna 16
Mexico City 15
Olalla 15
Phoenix 15
Verona 15
Brooklyn 14
Lyon 14
Turin 14
Warsaw 14
Amman 13
Chennai 13
Marseille 13
Atlanta 12
Baghdad 12
Norwalk 12
Redmond 12
San Francisco 12
Toronto 12
Totale 12.557
Salva come PNG Salva come JPEG
Nome #
Counting Qubits and Gates: Resource Analysis in Quantum Programming Languages 708
A Relational Theory of Effects and Coeffects 214
An invariant cost model for the lambda calculus 203
Beta reduction is invariant, indeed 194
Phase Semantics and Decidability of Elementary Affine Logic 186
Metric reasoning about Lambda-Terms: The general case 179
The machinery of interaction 178
The weak lambda-calculus as a reasonable machine 177
The geometry of parallelism: Classical, probabilistic, and quantum effects 176
On Measure Quantifiers in First-Order Arithmetic 175
Infinitary Lambda Calculi from a Linear Perspective 170
The Space of Interaction 170
Effectful Normal Form Bisimulation 167
Towards Quantum Multiparty Session Types 165
Probabilistic Recursion Theory and Implicit Computational Complexity 164
Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories 162
Light logics and higher-order processes 162
On Model-Checking Higher-Order Effectful Programs 161
A Higher-Order Characterization of Probabilistic Polynomial Time 161
(Leftmost-outermost) beta reduction is invariant, indeed 161
On coinductive equivalences for higher-order probabilistic functional programs 161
Automating sized-type inference for complexity analysis 161
A Short Introduction to Implicit Computational Complexity 160
Decomposing Probabilistic Lambda-Calculi 160
On Applicative Similarity, Sequentiality, and Full Abstraction 159
A Semantic Proof of Polytime Soundness of Light Affine Logic 158
On Computational Indistinguishability and Logical Relations 157
Effectful program distancing 155
Effectful applicative bisimilarity: Monads, relators, and Howe's method 153
Bounded Linear Logic, Revisited 153
Context Semantics, Linear Logic and Computational Complexity 152
Differential logical relations, Part I: The simply-typed case 150
The (In)Efficiency of interaction 150
General Ramified Recurrence is Sound for Polynomial Time 149
Tidy: Symbolic Verification of Timed Cryptographic Protocols 148
On Counting Propositional Logic and Wagner's Hierarchy 148
Higher order linear ramified recurrence 148
Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories 147
On the Lattice of Program Metrics 146
Elementary affine logic and call-by-value lambda-calculus 146
Functional Programming in Sublinear Space 146
Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages 145
Computation by interaction for space-bounded functional programming 145
Open Higher-Order Logic 144
Derivational Complexity is an Invariant Cost Model 144
A lambda-calculus foundation for universal probabilistic programming 144
Effectful applicative similarity for call-by-name lambda calculi 144
Towards Randomized Bounded Arithmetic 143
Light Logics and the Call-by-value Lambda Calculus 142
Automating sized-Type inference and complexity analysis 142
On Dynamic Lifting and Effect Typing in Circuit Description Languages 141
On Session Typing, Probabilistic Polynomial Time, and Cryptographic Experiments 139
On Quantitative Algebraic Higher-Order Theories 138
Curry and Howard Meet Borel 138
Quantitative Game Semantics for Linear Logic 138
A Semantic Proof of Polytime Soundness of Light Affine Logic 138
Linear Dependent Types and Relative Completeness 138
On session types and polynomial time 138
The geometry of linear higher-order recursion 137
Parallelism and synchronization in an infinitary context 136
On the termination problem for probabilistic higher-order recursive programs 136
Multi Types and Reasonable Space 135
Quantitative models and implicit complexity 135
On Intersection Types and Probabilistic Lambda Calculi 135
On randomised strategies in the λ-calculus 135
On continuation-passing transformations and expected cost analysis 135
Context semantics, linear logic and computational complexity 134
Bounded Linear Logic, Revisited 134
Analysing the complexity of functional programs: Higher-order meets first-order 134
Applicative bisimulation and quantum λ-calculi 134
Light Logics and Higher-Order Processes 134
Compact and Tractable Automaton-based Representations for Time Granularities 133
A Recursion-Theoretic Characterization of the Probabilistic Class PP 133
On higher-order cryptography 132
Proofs as efficient programs 131
On Feller Continuity and Full Abstraction 130
Complexity Analysis in Presence of Control Operators and Higher-Order Functions 130
Soft Session Types 128
Probabilistic termination by monadic affine sized typing 128
The geometry of concurrent interaction: Handling multiple ports by way of multiple tokens 128
Effectful applicative similarity for call-by-name lambda calculi 127
Reasonable Space for the Lambda-Calculus, Logarithmically 125
On the Equivalence of Automaton-based Representations of Time Granularities 123
On Constructor Rewrite Systems and the Lambda-Calculus 123
On sharing, memoization, and polynomial time 123
On light logics, uniform encodings and polynomial time 123
Confluence Results for a Quantum Lambda Calculus with Measurements 123
Probabilistic Operational Semantics for the Lambda Calculus 123
Intersection types and (positive) almost-sure termination 123
The geometry of linear higher-order recursion 122
A higher-order characterization of probabilistic polynomial time 122
On higher-order probabilistic subrecursion 122
On sharing, memoization, and polynomial time 122
Quantum Implicit Computational Complexity 122
Resource transition systems and full abstraction for linear higher-order effectful programs 122
Taming Modal Impredicativity: Superlazy Reduction 121
Realizability Models and Implicit Complexity 117
On probabilistic term rewriting 117
On probabilistic term rewriting 116
Linear dependent types in a call-by-value scenario 115
Totale 14.999
Salva come PNG Salva come JPEG
Categoria #
all - tutte 55.995
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 55.995
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/20222.019 0 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.836 365 630 860 536 544 993 671 381 894 412 324 226
2026/2027329 175 154 0 0 0 0 0 0 0 0 0 0
Totale 19.481