BERNASCONI, ANNA
 Distribuzione geografica
Continente #
NA - Nord America 7.220
EU - Europa 3.535
AS - Asia 1.113
AF - Africa 135
SA - Sud America 36
Continente sconosciuto - Info sul continente non disponibili 5
OC - Oceania 2
Totale 12.046
Nazione #
US - Stati Uniti d'America 7.025
IT - Italia 1.941
CN - Cina 513
SE - Svezia 396
BG - Bulgaria 279
SG - Singapore 278
CA - Canada 194
GB - Regno Unito 169
DE - Germania 160
UA - Ucraina 152
FR - Francia 148
TR - Turchia 133
NG - Nigeria 102
FI - Finlandia 100
VN - Vietnam 97
RU - Federazione Russa 68
CH - Svizzera 63
BR - Brasile 36
HK - Hong Kong 35
CI - Costa d'Avorio 24
BE - Belgio 19
IR - Iran 15
JP - Giappone 15
IN - India 9
NL - Olanda 9
BJ - Benin 7
TH - Thailandia 7
RO - Romania 6
CZ - Repubblica Ceca 5
ES - Italia 5
EU - Europa 5
IL - Israele 5
AT - Austria 3
GR - Grecia 3
IE - Irlanda 2
NZ - Nuova Zelanda 2
SA - Arabia Saudita 2
SI - Slovenia 2
SN - Senegal 2
HU - Ungheria 1
KR - Corea 1
KZ - Kazakistan 1
LU - Lussemburgo 1
LV - Lettonia 1
MX - Messico 1
PK - Pakistan 1
RS - Serbia 1
SK - Slovacchia (Repubblica Slovacca) 1
TW - Taiwan 1
Totale 12.046
Città #
Woodbridge 1.106
Ann Arbor 946
Fairfield 786
Houston 662
Serra 473
Chandler 440
Milan 425
Ashburn 342
Seattle 332
Wilmington 310
Cambridge 286
Sofia 279
Jacksonville 230
Ottawa 194
New York 189
Singapore 158
Beijing 147
Boardman 145
Princeton 125
Lawrence 114
Nanjing 103
Lagos 102
Pisa 87
Florence 84
Izmir 84
Medford 64
Bern 62
Des Moines 57
Dearborn 47
Istanbul 46
San Diego 45
Rome 42
Jüchen 41
Nanchang 41
Dong Ket 39
Boulder 36
Hong Kong 30
Shanghai 25
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
Helsinki 10
Tianjin 10
Falls Church 9
Bologna 8
Düsseldorf 8
Indiana 8
Santa Clara 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
Busalla 6
Fuzhou 6
Novosibirsk 6
Venosa 6
Busto Arsizio 5
Capannori 5
Central District 5
Cerreto Guidi 5
Phoenix 5
Pistoia 5
Portoferraio 5
San Francisco 5
Auburn Hills 4
Carrara 4
Casella 4
Fano 4
Grafing 4
Guangzhou 4
Jinan 4
Lanzhou 4
Lucca 4
Totale 9.327
Nome #
Computing preimages and ancestors in reaction systems 324
Elementi di crittografia 303
Introduzione alla Complessità Computazionale 217
On the Construction of Small Fully Testable Circuits with Low Depth 185
On the Construction of Small Fully Testable Circuits with Low Depth 170
An Approximation Algorithm for Fully Testable kEP-SOP Networks 165
Testability of SPP Three-Level Logic Networks in Static Fault Models 162
Stuck-At-Fault Testability of SPP Three-Level Logic Forms 156
Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem 155
Sensitivity vs. Block Sensitivity (an average-case study) 152
Compact DSOP and Partial DSOP Forms 151
Exploiting Regularities for Boolean Function Synthesis 150
Fun at a Department Store: Data Mining Meets Switching Theory 149
LOGIC MINIMIZATION AND TESTABILITY OF 2SPP-P-CIRCUITS 146
Autosymmetric Multiple-Valued Functions: Theory and Spectral Characterization 146
Measures of Boolean Function Complexity based on Harmonic Analysis 143
Quantum Networks on Cubelike Graphs 138
The optimization of kEP-SOPs: Computational complexity, approximability and experiments 137
EXOR Projected Sum of Products 136
On Projecting Sums of Products 133
On the Complexity of Balanced Boolean functions 132
How fast can one compute the permanent of circulant matrices? 127
A Note on the Polynomial Representation of Boolean Functions over GF(2) 126
Harmonic Analysis and Boolean Function Complexity 126
Biconditional-BDD Ordering for Autosymmetric Functions 126
Spectral Properties of Some Matrices Close to the Toeplitz Triangular Form 125
Minimization of P-Circuits using Boolean Relations 124
Logic Synthesis of EXOR Projected Sum of Products 123
An Approximation Algorithm for Cofactoring-Based Synthesis 123
Fast Three-Level Logic Minimization Based on Autosymmetry 122
COMBINATORIAL PROPERTIES OF CLASSES OF FUNCTIONS HARD TO COMPUTE IN CONSTANT DEPTH 121
Complexity of some arithmetic problems for binary polynomials 121
On Decomposing Boolean Functions via Extended Cofactoring 121
Logic synthesis and testing techniques for switching nano-crossbar arrays 121
SOP restructuring by exploiting don't cares 120
Logic Minimization and Testability of 2-SPP Networks 119
Synthesis of P-circuits for logic restructuring 119
Effects of Different Encodings and Distance Functions on Quantum Instance-based Classifiers 118
Mathematical Techniques for the Analysis of Boolean Functions 117
Efficient Minimization of Fully Testable 2-SPP Networks 116
Logic Synthesis and Testability of D-Reducible Functions 116
DRedSOP: Synthesis of a new class of regular functions 116
An Approximation Algorithm for Generalized EXOR Projected Sum of Products 114
Dimension-reducible Boolean Functions based on Affine Spaces 113
Three-Level Logic Minimization Based on Function Regularities 112
2-SPP Approximate Synthesis for Error Tolerant Applications 107
On the error resilience of ordered binary decision diagrams 107
Room Allocation: a Polynomial subcase of the Quadratic Assignment Problem 106
Hilbert function and complexity lower bounds for symmetric Boolean functions 106
Approximate Logic Synthesis by Symmetrization 106
Knitting for Fun: A Recursive Sweater 105
Algoritmi ricorsivi da lavorare ai ferri 104
Implicit Test of Regularity for Incompletely Specified Boolean Functions 104
Enhancing Logic Synthesis of Switching Lattices by Generalized Shannon Decomposition Methods 104
Spectral Analysis of Symmetric Threshold Functions 102
The Average Sensitivity of Square-Freeness 102
On Boolean Functions associated to Bipartite Cayley Graphs 102
Bi-Decomposition using Boolean Relations 99
2-SPP: a practical trade-off between SP and SPP synthesis 98
The Connection Layout in a Lattice of Four-Terminal Switches 97
Circuit and Decision Tree Complexity of Some Number Theoretic Problems 96
Minimization of EP-SOPs via Boolean Relations 95
On Formal Descriptions for Knitting Recursive Patterns 94
On the Complexity of Balanced Boolean functions 94
On Boolean Functions Satisfying Odd Order Propagation Criteria 93
Circuit Complexity of Testing Square-Free Numbers 93
A CHARACTERIZATION OF BENT FUNCTIONS IN TERMS OF STRONGLY REGULAR GRAPHS 91
A New Heuristic for DSOP Minimization 91
Two Combinatorial Problems on the Layout of Switching Lattices 90
On a hierarchy of Boolean functions hard to compute in constant depth 89
Synthesis and Performance Optimization of a Switching Nano-Crossbar Computer 89
Using flexibility in P-circuits by Boolean relations 89
Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults 87
Compact OBDDs for 2D-Reducible Functions 84
Logic Synthesis by Signal-Driven Decomposition 84
Characterization and computation of ancestors in reaction systems 84
Fast Three-Level Logic Minimization Based on Autosimmetry 83
Minimization of incompletely specified functions as three-level logic via Boolean relations 83
Computing Groebner Bases in the Boolean Setting with Applications to Counting 81
On the Average Sensitivity of Testing Square-free numbers 79
Logic Synthesis for Switching Lattices by Decomposition with P-Circuits 79
Composition of switching lattices for regular and for decomposed functions 78
Literal Selection in Switching Lattice Design 77
Stuck-At Fault Mitigation of Emerging Technologies Based Switching Lattices 77
Compact and Testable Circuits for Regular Functions 75
Efficient Optimal Greedy Algorithms for Room Allocation 75
Synthesis of Autosymmetric Functions in a New Three-Level Form 74
Index-resilient Zero-Suppressed BDDs: Definition and Operations 70
Fault mitigation of switching lattices under the stuck-at-fault model 70
Computing the full quotient in bi-decomposition by approximation 70
Testability of Switching Lattices in the Stuck at Fault Model 70
Weighted don't cares 69
Synthesis of Complemented Circuits 69
Error-resilient BDDs: a preliminary study 67
Projected Don't Cares 67
Error Resilient OBDDs 67
Effect of Different Encodings and Distance Functions on Quantum Instance-based Classifiers 67
Autosymmetric and Dimension Reducible Multiple-Valued Functions 66
Boolean Minimization of Projected Sums of Products via Boolean Relations 66
Complemented circuits 65
Totale 11.172
Categoria #
all - tutte 32.176
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 32.176


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.442 0 0 0 0 202 218 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/2025460 24 157 102 147 30 0 0 0 0 0 0 0
Totale 12.267