BERNASCONI, ANNA
 Distribuzione geografica
Continente #
NA - Nord America 10.130
AS - Asia 4.900
EU - Europa 4.428
SA - Sud America 1.018
AF - Africa 307
Continente sconosciuto - Info sul continente non disponibili 8
OC - Oceania 5
Totale 20.796
Nazione #
US - Stati Uniti d'America 9.751
IT - Italia 2.164
SG - Singapore 1.471
CN - Cina 1.272
BR - Brasile 845
HK - Hong Kong 820
SE - Svezia 404
VN - Vietnam 349
FR - Francia 292
BG - Bulgaria 282
DE - Germania 282
GB - Regno Unito 259
CA - Canada 245
RU - Federazione Russa 189
TR - Turchia 175
UA - Ucraina 168
FI - Finlandia 158
IN - India 143
JP - Giappone 126
NG - Nigeria 107
BD - Bangladesh 105
KR - Corea 98
IQ - Iraq 72
CH - Svizzera 67
MX - Messico 59
AR - Argentina 57
SA - Arabia Saudita 48
ZA - Sudafrica 46
MA - Marocco 30
NL - Olanda 27
PK - Pakistan 27
UZ - Uzbekistan 27
VE - Venezuela 26
BE - Belgio 25
CI - Costa d'Avorio 25
ES - Italia 24
KE - Kenya 24
EC - Ecuador 22
EG - Egitto 21
CO - Colombia 17
JO - Giordania 17
PY - Paraguay 17
IR - Iran 16
UY - Uruguay 15
IL - Israele 14
TT - Trinidad e Tobago 14
PL - Polonia 13
ID - Indonesia 12
AE - Emirati Arabi Uniti 11
DO - Repubblica Dominicana 11
JM - Giamaica 11
CR - Costa Rica 10
TH - Thailandia 10
AT - Austria 9
BJ - Benin 9
NP - Nepal 9
PS - Palestinian Territory 9
CL - Cile 8
KZ - Kazakistan 8
AL - Albania 7
CZ - Repubblica Ceca 7
DZ - Algeria 7
HN - Honduras 7
OM - Oman 7
PE - Perù 7
PH - Filippine 7
RO - Romania 7
AZ - Azerbaigian 6
IE - Irlanda 6
MY - Malesia 6
SN - Senegal 6
AO - Angola 5
BB - Barbados 5
BS - Bahamas 5
ET - Etiopia 5
EU - Europa 5
KG - Kirghizistan 5
LB - Libano 5
PT - Portogallo 5
BO - Bolivia 4
GR - Grecia 4
NI - Nicaragua 4
QA - Qatar 4
RS - Serbia 4
TN - Tunisia 4
TW - Taiwan 4
AU - Australia 3
BY - Bielorussia 3
GE - Georgia 3
LT - Lituania 3
LU - Lussemburgo 3
NO - Norvegia 3
XK - ???statistics.table.value.countryCode.XK??? 3
BM - Bermuda 2
CD - Congo 2
CG - Congo 2
DK - Danimarca 2
GA - Gabon 2
KW - Kuwait 2
LC - Santa Lucia 2
Totale 20.755
Città #
Woodbridge 1.107
Ann Arbor 946
Singapore 907
Ashburn 880
Hong Kong 804
Fairfield 786
Houston 665
Santa Clara 621
San Jose 556
Serra 476
Milan 456
Chandler 440
Seattle 333
Wilmington 313
Shanghai 290
Cambridge 287
Sofia 279
Beijing 270
Dallas 268
Jacksonville 230
New York 210
Ottawa 194
Los Angeles 179
Boardman 145
Hefei 129
Princeton 126
Pisa 125
Lawrence 114
Lagos 104
Nanjing 103
Tokyo 100
Lauterbourg 98
Seoul 97
Florence 93
Ho Chi Minh City 86
Izmir 85
Munich 72
Hanoi 66
Medford 64
São Paulo 63
Bern 62
Des Moines 60
Istanbul 53
Redondo Beach 50
Rome 50
Buffalo 48
Dearborn 47
San Diego 45
Helsinki 44
The Dalles 42
Jüchen 41
Nanchang 41
Dong Ket 39
Boulder 36
Belo Horizonte 30
Dhaka 29
Columbus 28
Council Bluffs 28
Frankfurt am Main 28
Chicago 26
Abidjan 25
Livorno 25
Shenyang 25
Tashkent 24
Baghdad 23
Rio de Janeiro 23
Norwalk 22
Kunming 21
Turku 21
Riyadh 20
Changsha 19
Imperia 19
Johannesburg 19
Nairobi 19
Jeddah 18
Bologna 17
Amman 16
Curitiba 16
Düsseldorf 16
Jiaxing 16
London 16
Ogden 16
Strasbourg 16
Trento 16
Verona 16
Brussels 15
Hebei 15
Brasília 14
Como 13
Marseille 13
Massarosa 13
Nuremberg 13
Torino 13
Orem 12
Redwood City 12
Salvador 12
Tehran 12
Campinas 11
Chennai 11
Haiphong 11
Totale 14.668
Nome #
Computing preimages and ancestors in reaction systems 401
Elementi di crittografia 385
Introduzione alla Complessità Computazionale 303
Compact DSOP and Partial DSOP Forms 247
On the Construction of Small Fully Testable Circuits with Low Depth 238
Testability of SPP Three-Level Logic Networks in Static Fault Models 236
Sensitivity vs. Block Sensitivity (an average-case study) 228
An Approximation Algorithm for Fully Testable kEP-SOP Networks 228
Stuck-At-Fault Testability of SPP Three-Level Logic Forms 226
On the Construction of Small Fully Testable Circuits with Low Depth 224
Measures of Boolean Function Complexity based on Harmonic Analysis 222
Fun at a Department Store: Data Mining Meets Switching Theory 219
LOGIC MINIMIZATION AND TESTABILITY OF 2SPP-P-CIRCUITS 213
Exploiting Regularities for Boolean Function Synthesis 213
Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem 210
On the Complexity of Balanced Boolean functions 203
A Note on the Polynomial Representation of Boolean Functions over GF(2) 203
Autosymmetric Multiple-Valued Functions: Theory and Spectral Characterization 201
Effects of Different Encodings and Distance Functions on Quantum Instance-based Classifiers 201
Spectral Properties of Some Matrices Close to the Toeplitz Triangular Form 197
Mathematical Techniques for the Analysis of Boolean Functions 196
The optimization of kEP-SOPs: Computational complexity, approximability and experiments 196
Complexity of some arithmetic problems for binary polynomials 195
EXOR Projected Sum of Products 195
On Projecting Sums of Products 195
COMBINATORIAL PROPERTIES OF CLASSES OF FUNCTIONS HARD TO COMPUTE IN CONSTANT DEPTH 194
How fast can one compute the permanent of circulant matrices? 192
Quantum Networks on Cubelike Graphs 191
An Approximation Algorithm for Cofactoring-Based Synthesis 185
Efficient Minimization of Fully Testable 2-SPP Networks 184
On Boolean Functions associated to Bipartite Cayley Graphs 184
Logic Synthesis and Testability of D-Reducible Functions 183
The Connection Layout in a Lattice of Four-Terminal Switches 182
Harmonic Analysis and Boolean Function Complexity 181
On Decomposing Boolean Functions via Extended Cofactoring 180
Approximate Logic Synthesis by Symmetrization 180
Logic Minimization and Testability of 2-SPP Networks 179
Dimension-reducible Boolean Functions based on Affine Spaces 179
Two Combinatorial Problems on the Layout of Switching Lattices 179
Logic Synthesis of EXOR Projected Sum of Products 177
Fast Three-Level Logic Minimization Based on Autosymmetry 176
Enhancing Logic Synthesis of Switching Lattices by Generalized Shannon Decomposition Methods 175
Synthesis of P-circuits for logic restructuring 174
Minimization of P-Circuits using Boolean Relations 174
SOP restructuring by exploiting don't cares 172
Biconditional-BDD Ordering for Autosymmetric Functions 172
Literal Selection in Switching Lattice Design 172
Fast Three-Level Logic Minimization Based on Autosimmetry 168
Implicit Test of Regularity for Incompletely Specified Boolean Functions 167
On the error resilience of ordered binary decision diagrams 167
An Approximation Algorithm for Generalized EXOR Projected Sum of Products 166
Bi-Decomposition using Boolean Relations 166
Computing Groebner Bases in the Boolean Setting with Applications to Counting 165
Logic synthesis and testing techniques for switching nano-crossbar arrays 165
Algoritmi ricorsivi da lavorare ai ferri 164
Three-Level Logic Minimization Based on Function Regularities 164
On Boolean Functions Satisfying Odd Order Propagation Criteria 162
Hilbert function and complexity lower bounds for symmetric Boolean functions 160
Spectral Analysis of Symmetric Threshold Functions 159
2-SPP Approximate Synthesis for Error Tolerant Applications 159
Synthesis and Performance Optimization of a Switching Nano-Crossbar Computer 159
DRedSOP: Synthesis of a new class of regular functions 159
Characterization and computation of ancestors in reaction systems 159
The Average Sensitivity of Square-Freeness 158
Composition of switching lattices for regular and for decomposed functions 158
2-SPP: a practical trade-off between SP and SPP synthesis 156
A New Heuristic for DSOP Minimization 156
Circuit Complexity of Testing Square-Free Numbers 154
On Formal Descriptions for Knitting Recursive Patterns 152
On the Complexity of Balanced Boolean functions 152
Fault mitigation of switching lattices under the stuck-at-fault model 152
A CHARACTERIZATION OF BENT FUNCTIONS IN TERMS OF STRONGLY REGULAR GRAPHS 150
Clustering Classical Data with Quantum k-Means 149
Knitting for Fun: A Recursive Sweater 149
Minimization of EP-SOPs via Boolean Relations 149
Logic Synthesis by Signal-Driven Decomposition 149
Using flexibility in P-circuits by Boolean relations 148
On a hierarchy of Boolean functions hard to compute in constant depth 147
Boolean Minimization of Projected Sums of Products via Boolean Relations 147
Room Allocation: a Polynomial subcase of the Quadratic Assignment Problem 146
Skip index: Supporting efficient inter-block queries and query authentication on the blockchain 144
On the Average Sensitivity of Testing Square-free numbers 142
Circuit and Decision Tree Complexity of Some Number Theoretic Problems 142
Literal Selection in Switching Lattice Design 140
Minimization of incompletely specified functions as three-level logic via Boolean relations 139
Quantum Subroutine for Efficient Matrix Multiplication 138
Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults 138
Stuck-At Fault Mitigation of Emerging Technologies Based Switching Lattices 138
Compact OBDDs for 2D-Reducible Functions 136
Synthesis of Complemented Circuits 136
Synthesis of Autosymmetric Functions in a New Three-Level Form 135
A survey of set accumulators for blockchain systems 134
Index-resilient Zero-Suppressed BDDs: Definition and Operations 133
ON THE POLYNOMIAL REPRESENTATION OF BOOLEAN FUNCTIONS OVER GF(2) 131
Effect of Different Encodings and Distance Functions on Quantum Instance-based Classifiers 131
Compact and Testable Circuits for Regular Functions 130
Quantum clustering with k-Means: A hybrid approach 129
An analysis of Bitcoin dust through authenticated queries 128
Weighted don't cares 128
Testability of Switching Lattices in the Stuck at Fault Model 127
Totale 17.620
Categoria #
all - tutte 53.556
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 53.556


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021225 0 0 0 0 0 0 0 0 0 0 68 157
2021/20221.327 42 82 55 85 224 165 79 107 42 45 123 278
2022/20231.378 212 121 51 105 240 178 12 105 198 7 110 39
2023/20241.407 208 161 156 133 206 233 91 16 23 34 27 119
2024/20255.130 24 157 102 147 420 409 436 273 370 517 521 1.754
2025/20264.117 398 540 438 359 402 349 704 181 221 452 73 0
Totale 21.054