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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/20221.285 0 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.404 398 540 438 359 402 349 704 181 221 452 158 202
2026/2027234 195 39 0 0 0 0 0 0 0 0 0 0
Totale 21.575