BERNASCONI, ANNA
 Distribuzione geografica
Continente #
NA - Nord America 7.829
EU - Europa 3.613
AS - Asia 1.399
AF - Africa 135
SA - Sud America 56
Continente sconosciuto - Info sul continente non disponibili 5
OC - Oceania 2
Totale 13.039
Nazione #
US - Stati Uniti d'America 7.632
IT - Italia 1.960
CN - Cina 788
SE - Svezia 396
SG - Singapore 283
BG - Bulgaria 279
CA - Canada 194
GB - Regno Unito 170
DE - Germania 163
UA - Ucraina 153
FR - Francia 148
TR - Turchia 133
FI - Finlandia 120
NG - Nigeria 102
RU - Federazione Russa 100
VN - Vietnam 97
CH - Svizzera 63
BR - Brasile 56
HK - Hong Kong 38
CI - Costa d'Avorio 24
BE - Belgio 19
IR - Iran 15
JP - Giappone 15
NL - Olanda 10
IN - India 9
BJ - Benin 7
TH - Thailandia 7
IL - Israele 6
RO - Romania 6
CZ - Repubblica Ceca 5
ES - Italia 5
EU - Europa 5
AT - Austria 3
GR - Grecia 3
IE - Irlanda 2
MX - Messico 2
NZ - Nuova Zelanda 2
SA - Arabia Saudita 2
SI - Slovenia 2
SN - Senegal 2
BY - Bielorussia 1
HU - Ungheria 1
JM - Giamaica 1
KR - Corea 1
KZ - Kazakistan 1
LU - Lussemburgo 1
LV - Lettonia 1
NP - Nepal 1
PK - Pakistan 1
RS - Serbia 1
SK - Slovacchia (Repubblica Slovacca) 1
TW - Taiwan 1
UZ - Uzbekistan 1
Totale 13.039
Città #
Woodbridge 1.106
Ann Arbor 946
Fairfield 786
Houston 662
Santa Clara 610
Serra 473
Chandler 440
Milan 426
Ashburn 344
Seattle 332
Wilmington 310
Cambridge 286
Sofia 279
Shanghai 278
Jacksonville 230
Ottawa 194
New York 189
Singapore 161
Beijing 148
Boardman 145
Princeton 125
Lawrence 114
Nanjing 103
Lagos 102
Pisa 90
Florence 84
Izmir 84
Medford 64
Bern 62
Des Moines 57
Dearborn 47
Istanbul 46
San Diego 45
Rome 43
Jüchen 41
Nanchang 41
Dong Ket 39
Boulder 36
Hong Kong 33
Helsinki 29
Abidjan 24
Livorno 24
Shenyang 24
Norwalk 22
Kunming 21
Imperia 19
Changsha 16
Los Angeles 16
Ogden 16
Strasbourg 16
Hebei 15
Jiaxing 15
Trento 15
Verona 15
Brussels 13
Como 13
Marseille 13
Massarosa 13
Torino 13
Redwood City 12
Tehran 12
Hefei 11
Grosseto 10
Tianjin 10
Falls Church 9
Bologna 8
Düsseldorf 8
Indiana 8
Novosibirsk 8
Cotonou 7
Dallas 7
Hangzhou 7
Monsummano Terme 7
Naples 7
Orange 7
Redmond 7
Santa Marinella 7
Amherst 6
Bangkok 6
Bari 6
Brugherio 6
Busalla 6
Fuzhou 6
Guangzhou 6
Venosa 6
Busto Arsizio 5
Capannori 5
Central District 5
Cerreto Guidi 5
Lucca 5
Phoenix 5
Pistoia 5
Portoferraio 5
San Francisco 5
Auburn Hills 4
Carrara 4
Casella 4
Fano 4
Grafing 4
Jinan 4
Totale 10.222
Nome #
Computing preimages and ancestors in reaction systems 330
Elementi di crittografia 312
Introduzione alla Complessità Computazionale 224
On the Construction of Small Fully Testable Circuits with Low Depth 192
Compact DSOP and Partial DSOP Forms 179
On the Construction of Small Fully Testable Circuits with Low Depth 177
Testability of SPP Three-Level Logic Networks in Static Fault Models 176
An Approximation Algorithm for Fully Testable kEP-SOP Networks 172
Stuck-At-Fault Testability of SPP Three-Level Logic Forms 163
Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem 162
Sensitivity vs. Block Sensitivity (an average-case study) 157
Exploiting Regularities for Boolean Function Synthesis 157
Fun at a Department Store: Data Mining Meets Switching Theory 156
Autosymmetric Multiple-Valued Functions: Theory and Spectral Characterization 153
LOGIC MINIMIZATION AND TESTABILITY OF 2SPP-P-CIRCUITS 152
Measures of Boolean Function Complexity based on Harmonic Analysis 151
The optimization of kEP-SOPs: Computational complexity, approximability and experiments 145
Quantum Networks on Cubelike Graphs 144
EXOR Projected Sum of Products 143
On Projecting Sums of Products 141
On the Complexity of Balanced Boolean functions 139
How fast can one compute the permanent of circulant matrices? 134
A Note on the Polynomial Representation of Boolean Functions over GF(2) 133
Harmonic Analysis and Boolean Function Complexity 133
Spectral Properties of Some Matrices Close to the Toeplitz Triangular Form 131
An Approximation Algorithm for Cofactoring-Based Synthesis 131
Minimization of P-Circuits using Boolean Relations 131
Biconditional-BDD Ordering for Autosymmetric Functions 131
Complexity of some arithmetic problems for binary polynomials 130
Logic Synthesis of EXOR Projected Sum of Products 130
Fast Three-Level Logic Minimization Based on Autosymmetry 129
Logic synthesis and testing techniques for switching nano-crossbar arrays 129
COMBINATORIAL PROPERTIES OF CLASSES OF FUNCTIONS HARD TO COMPUTE IN CONSTANT DEPTH 128
On Decomposing Boolean Functions via Extended Cofactoring 128
Effects of Different Encodings and Distance Functions on Quantum Instance-based Classifiers 128
SOP restructuring by exploiting don't cares 127
Logic Minimization and Testability of 2-SPP Networks 126
Synthesis of P-circuits for logic restructuring 126
Mathematical Techniques for the Analysis of Boolean Functions 124
DRedSOP: Synthesis of a new class of regular functions 124
Efficient Minimization of Fully Testable 2-SPP Networks 123
Logic Synthesis and Testability of D-Reducible Functions 123
An Approximation Algorithm for Generalized EXOR Projected Sum of Products 121
Dimension-reducible Boolean Functions based on Affine Spaces 120
Three-Level Logic Minimization Based on Function Regularities 119
Approximate Logic Synthesis by Symmetrization 115
Implicit Test of Regularity for Incompletely Specified Boolean Functions 114
Room Allocation: a Polynomial subcase of the Quadratic Assignment Problem 114
2-SPP Approximate Synthesis for Error Tolerant Applications 114
On the error resilience of ordered binary decision diagrams 114
Algoritmi ricorsivi da lavorare ai ferri 113
On Boolean Functions associated to Bipartite Cayley Graphs 113
Hilbert function and complexity lower bounds for symmetric Boolean functions 113
Knitting for Fun: A Recursive Sweater 112
Enhancing Logic Synthesis of Switching Lattices by Generalized Shannon Decomposition Methods 111
Spectral Analysis of Symmetric Threshold Functions 110
The Average Sensitivity of Square-Freeness 109
The Connection Layout in a Lattice of Four-Terminal Switches 109
2-SPP: a practical trade-off between SP and SPP synthesis 106
Bi-Decomposition using Boolean Relations 106
Circuit and Decision Tree Complexity of Some Number Theoretic Problems 103
On Formal Descriptions for Knitting Recursive Patterns 102
Minimization of EP-SOPs via Boolean Relations 102
On the Complexity of Balanced Boolean functions 102
Two Combinatorial Problems on the Layout of Switching Lattices 101
Circuit Complexity of Testing Square-Free Numbers 100
On Boolean Functions Satisfying Odd Order Propagation Criteria 99
A CHARACTERIZATION OF BENT FUNCTIONS IN TERMS OF STRONGLY REGULAR GRAPHS 98
A New Heuristic for DSOP Minimization 98
On a hierarchy of Boolean functions hard to compute in constant depth 97
Synthesis and Performance Optimization of a Switching Nano-Crossbar Computer 96
Using flexibility in P-circuits by Boolean relations 96
Compact OBDDs for 2D-Reducible Functions 94
Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults 94
Minimization of incompletely specified functions as three-level logic via Boolean relations 92
Logic Synthesis by Signal-Driven Decomposition 92
Fast Three-Level Logic Minimization Based on Autosimmetry 90
Characterization and computation of ancestors in reaction systems 90
Computing Groebner Bases in the Boolean Setting with Applications to Counting 89
On the Average Sensitivity of Testing Square-free numbers 87
Logic Synthesis for Switching Lattices by Decomposition with P-Circuits 86
Composition of switching lattices for regular and for decomposed functions 86
Literal Selection in Switching Lattice Design 85
Stuck-At Fault Mitigation of Emerging Technologies Based Switching Lattices 84
Synthesis of Autosymmetric Functions in a New Three-Level Form 83
Compact and Testable Circuits for Regular Functions 82
Efficient Optimal Greedy Algorithms for Room Allocation 82
Index-resilient Zero-Suppressed BDDs: Definition and Operations 79
Testability of Switching Lattices in the Stuck at Fault Model 79
An analysis of Bitcoin dust through authenticated queries 78
Weighted don't cares 78
Fault mitigation of switching lattices under the stuck-at-fault model 78
Computing the full quotient in bi-decomposition by approximation 78
Synthesis of Complemented Circuits 76
Effect of Different Encodings and Distance Functions on Quantum Instance-based Classifiers 76
Clustering Classical Data with Quantum k-Means 74
Error-resilient BDDs: a preliminary study 74
Projected Don't Cares 74
Error Resilient OBDDs 74
Boolean Minimization of Projected Sums of Products via Boolean Relations 74
Totale 11.959
Categoria #
all - tutte 34.896
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 34.896


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.022 0 0 0 0 0 0 241 169 302 125 140 45
2020/20211.213 87 55 94 80 113 140 76 93 179 71 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/20251.470 24 157 102 147 420 409 211 0 0 0 0 0
Totale 13.277