CRIS Current Research Information System

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021929 0 0 0 0 0 0 46 103 270 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/20264.020 365 630 860 536 544 993 92 0 0 0 0 0
Totale 16.336